Extraction of cylinders and cones from minimal point sets
Computational Geometry
2016-06-22 v2 Symbolic Computation
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.
Keywords
Cite
@article{arxiv.1603.04582,
title = {Extraction of cylinders and cones from minimal point sets},
author = {Laurent Busé and André Galligo and Jiajun Zhang},
journal= {arXiv preprint arXiv:1603.04582},
year = {2016}
}