sign in
english version rss feed

inria-00142973, version 1

A computational study of ruled surfaces

Laurent Busé () a1, Mohamed Elkadi b1, André Galligo () b1

Journal of Symbolic Computation 44, 3 (2009) 232--241

Abstract: We study rational ruled surfaces and $\mu$-bases which were recently considered in a series of articles by Chen and coworkers. We give short and conceptual proofs with geometric insights and efficient algorithms. In particular, we provide a method to reparameterize an improper parameterization and we also briefly explain how to deal with approximate input data. Finally we provide an algorithmic description of self-intersection loci.

  • a –  INRIA
  • b –  Université de Nice Sophia-Antipolis
  • 1:  GALAAD (INRIA Sophia Antipolis)
  • INRIA – CNRS : UMR6621 – Université de Nice Sophia Antipolis (UNS)
  • Domain : Computer Science/Symbolic Computation
    Mathematics/Algebraic Geometry
 
  • inria-00142973, version 1
  • oai:hal.inria.fr:inria-00142973
  • From: 
  • Submitted on: Monday, 23 April 2007 17:22:15
  • Updated on: Tuesday, 17 March 2009 10:35:28
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...