Circular cylinders through four or five points in space

Discrete and Computational Geometry

Volumn 29, Issue 1, 2003, Pages 83-104

  Devillers, Olivier ^a   Mourrain, Bernard ^a   Preparata, Franco P ^b   Trebuchet, Philippe ^a  

^a INRIA   (France)

^b Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037972827     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-002-2811-7     Document Type: Article

References (17)

1. P.K. Agarwal, B. Aronov, and M. Sharir. Line traversals of balls and smallest enclosing cylinders in three dimensions. In Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, pages 483-492, 1997.
2. P.K. Agarwal, B. Aronov, and M. Sharir. Exact and approximation algorithms for minimum-width cylindrical shells. In Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pages 510-517, 2000.
3. E. Anderson, Z. Bai, C. Bischof, J.W. Demmel, J.J. Dongara, J. Du Croz, A. Greenbaum, S. Hammerling, A. MCKenney, and D. Sorensen. LAPACK: A portable linear algebra library for high-performance computers. Technical Report CS-90-105, Comput. Sci. Dept., University of Tennessee, Knoxville, 1990.
4. J. Basch, O. Devillers, M. van Kreveld, M. Teillaud, and A. Vigneron. On the number of Delaunay triangulations of the projections of a set of points in three dimensions. Rapport de Recherche, INRIA, to appear.
5. O. Bottema and G.R. VeldKamp. On the lines in space with equal distance to n given points. Geom. Dedicata, 6:121-129, 1977.
6. R.M. Corless, P.M. Gianni, and B.M. Trager. A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots. In W.W. Küchlin, editor, Proc. ISSAC, pages 133-140, 1997.
7. D. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Undergraduate Texts in Mathematics. Springer-Verlag, New York, 1992.
8. O. Devillers and F.P. Preparata. Evaluating the cylindricity of a nominally cylindrical point set. In Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pages 518-527, 2000.
9. M. Elkadi and B. Mourrain. Géométrie algébrique effective en dimension 0. Notes de cours, Université de Nice, 2002.
10. I.Z. Emiris and B. Mourrain. Matrices in Elimination Theory. J. Symbolic Comput., 28(1&2):3-44, 1999.
11. 3. Submitted.
12. 3. Discrete Comput. Geom., 26:1-17, 2001.
13. B. Mourrain. Computing isolated polynomial roots by matrix methods. J. Symbolic Comput., 26(6):715-738, 1998.
14. B. Mourrain. A new criterion for normal form algorithms. In M. Fossorier, H. Imai, Shu Lin, and A. Poli, editors, Proc. AAECC, volume 1719 of LNCS, pages 430-443. Springer-Verlag, Berlin, 1999.
15. B. Mourrain and H. Prieto. A framework for symbolic and numeric computations. Rapport de Recherche 4013, INRIA, 2000.
16. B. Mourrain and Ph. Trébuchet. Solving projective complete intersection faster. In C. Traverse, editor, Proc. Internat. Sympos. Symbolic and Algebraic Computation, pages 231-238. ACM Press, New York, 2000.
17. E. Schömer, J. Sellen, M. Teichmann, and C. Yap. Smallest enclosing cylinders. In Proc. 12th Annu. ACM Sympos. Computational Geometry, pages C13-C14, 1996.