A computational study of ruled surfaces

Laurent Busé 1 Mohamed Elkadi 1 André Galligo 1
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.
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/inria-00142973
Contributor : Laurent Busé <>
Submitted on : Monday, April 23, 2007 - 5:22:15 PM
Last modification on : Friday, January 12, 2018 - 1:48:38 AM
Document(s) archivé(s) le : Friday, September 21, 2012 - 2:22:02 PM

File

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

Identifiers

Collections

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⟩

Share

Metrics

Record views

376

Files downloads

186