Cylinders Through Five Points: Complex and Real Enumerative Geometry

It is known that five points in R3 generically determine a finite number of cylinders containing those points. We discuss ways in which it can be shown that the generic (complex) number of solutions, with multiplicity, is six, of which an even number will be real valued and hence correspond to actual cylinders in R3. We partially classify the case of no real solutions in terms of the geometry of the five given points. We also investigate the special case where the five given points are coplanar, as it differs from the generic case for both complex and real valued solution cardinalities.

[1]  Michael Kalkbrener.  Solving systems of algebraic equations by using Gröbner bases , 1987, EUROCAL.

[2]  Maria Grazia Marinari,et al.  The shape of the Shape Lemma , 1994, ISSAC '94.

[3]  François Goulette,et al.  A note on the construction of right circular cylinders through five 3D points , 2003 .

[4]  Antonio Montes,et al.  Improving the DISPGB algorithm using the discriminant ideal , 2006, J. Symb. Comput..

[5]  Gábor Megyesi.  Lines Tangent to Four Unit Spheres with Coplanar Centres , 2001, Discret. Comput. Geom..

[6]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[7]  C. Hoffmann,et al.  Symbolic and numerical techniques for constraint solving , 1998 .

[8]  Franco P. Preparata,et al.  On circular Cylinders by Four or Five Points in Space , 2001 .

[9]  Bud Mishra,et al.  Algorithmic Algebra , 1993, Texts and Monographs in Computer Science.

[10]  François Goulette,et al.  Extracting Cylinders in Full 3D Data Using a Random Sampling Method and the Gaussian Image , 2001, VMV.

[11]  Bo Yuan,et al.  On Spatial Constraint Solving Approaches , 2000, Automated Deduction in Geometry.

[12]  Tomás Recio,et al.  Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems , 2006, Automated Deduction in Geometry.

[13]  Dongming Wang,et al.  Automated Deduction in Geometry , 1996, Lecture Notes in Computer Science.

[14]  Heinz Kredel,et al.  Gröbner Bases: A Computational Approach to Commutative Algebra , 1993 .

[15]  Volker Weispfenning,et al.  Comprehensive Gröbner Bases , 1992, J. Symb. Comput..

[16]  János Pach,et al.  Common Tangents to Four Unit Balls in R3 , 2001, Discret. Comput. Geom..

[17]  B. Sturmfels.  Polynomial Equations and Convex Polytopes , 1998 .

[18]  O. Bottema,et al.  On the lines in space with equal distances to n given points , 1977 .

[19]  Xavier Goaoc,et al.  Common Tangents to Spheres in ℝ3 , 2006, Discret. Comput. Geom..

[20]  佐藤 洋祐,et al.  特集 Comprehensive Grobner Bases , 2007 .

[21]  Marek Teichmann,et al.  Smallest enclosing cylinders , 1996, SCG '96.

[22]  Volker Weispfenning.  Comprehensive Gröbner bases and regular rings , 2006, J. Symb. Comput..