Extraction of cylinders and cones from minimal point sets

Laurent Busé 1 André Galligo 2, 1 Jiajun Zhang 1
1 AROMATH - AlgebRe, geOmetrie, Modelisation et AlgoriTHmes
CRISAM - Inria Sophia Antipolis - Méditerranée , National and Kapodistrian University of Athens
Abstract : We propose new algebraic methods for extracting cylinders and cones from minimal point sets, including oriented points. More precisely, we are interested in computing efficiently cylinders through a set of three points, one of them being oriented, or through a set of five simple points. We are also interested in computing efficiently cones through a set of two oriented points, through a set of four points, one of them being oriented, or through a set of six points. For these different interpolation problems, we give optimal bounds on the number of solutions. Moreover, we describe algebraic methods targeted to solve these problems efficiently.
Complete list of metadatas

https://hal.inria.fr/hal-01288325
Contributor : Laurent Busé <>
Submitted on : Tuesday, June 21, 2016 - 9:02:17 AM
Last modification on : Thursday, May 3, 2018 - 1:32:58 PM

Files

cylconinterpol-final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01288325, version 2
  • ARXIV : 1603.04582

Collections

Citation

Laurent Busé, André Galligo, Jiajun Zhang. Extraction of cylinders and cones from minimal point sets. Graphical Models, Elsevier, 2016, 86, pp.1-12. ⟨hal-01288325v2⟩

Share

Metrics

Record views

474

Files downloads

773