ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computational Geometry
Volume 33, Issues 1-2, January 2006, Pages 65-97
Robust Geometric Applications and their Implementations
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (1085 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comgeo.2004.02.007    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2005 Elsevier B.V. All rights reserved.

An exact and efficient approach for computing a cell in an arrangement of quadricsstar, open

Elmar Schömera, E-mail The Corresponding Author and Nicola Wolpertb, Corresponding Author Contact Information, E-mail The Corresponding Author

aJohannes Gutenberg-Universität Mainz, Institut für Informatik, 55099 Mainz, Germany bMax-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany

Received 12 June 2003; 
accepted 20 February 2004. 
Communicated by C. Yap and S. Pion. 
Available online 29 September 2005.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

We present an approach for the exact and efficient computation of a cell in an arrangement of quadric surfaces. All calculations are based on exact rational algebraic methods and provide the correct mathematical results in all, even degenerate, cases. By projection, the spatial problem is reduced to the one of computing planar arrangements of algebraic curves. We succeed in locating all event points in these arrangements, including tangential intersections and singular points. By introducing an additional curve, which we call the Jacobi curve, we are able to find non-singular tangential intersections. We show that the coordinates of the singular points in our special projected planar arrangements are roots of quadratic polynomials. The coefficients of these polynomials are usually rational and contain at most a single square root. A prototypical implementation indicates that our approach leads to good performance in practice.

Keywords: Computational geometry; Arrangements; Algebraic surfaces; Algebraic curves; Robustness; Exact algebraic computation


Computational Geometry
Volume 33, Issues 1-2, January 2006, Pages 65-97
Robust Geometric Applications and their Implementations
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.