# A computational study of ruled surfaces

1 GALAAD - Geometry, algebra, algorithms
CRISAM - Inria Sophia Antipolis - Méditerranée , UNS - Université Nice Sophia Antipolis, CNRS - Centre National de la Recherche Scientifique : UMR6621
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.
Document type :
Journal articles
Domain :

Cited literature [18 references]

https://hal.inria.fr/inria-00142973
Contributor : Laurent Busé <>
Submitted on : Monday, April 23, 2007 - 5:22:15 PM
Last modification on : Wednesday, December 11, 2019 - 10:34:11 PM
Long-term archiving on: Friday, September 21, 2012 - 2:22:02 PM

### File

BuElGa-hal.pdf
Files produced by the author(s)

### Citation

Laurent Busé, Mohamed Elkadi, André Galligo. A computational study of ruled surfaces. Journal of Symbolic Computation, Elsevier, 2009, Special Issue ICPSS, 44 (3), pp.232--241. ⟨10.1016/j.jsc.2007.04.005⟩. ⟨inria-00142973⟩

Record views