Eric Berberich
Michael Hemmer
Lutz Kettner
ABSTRACT
We present the first exact, complete and efficient implementation that computes for a given set P=p1,...,pn of quadric surfaces the planar map induced by all intersection curves p1∩ pi, 2 ≤ i ≤ n, running on the surface of p1. The vertices in this graph are the singular and x-extreme points of the curves as well as all intersection points of pairs of curves. Two vertices are connected by an edge if the underlying points are connected by a branch of one of the curves. Our work is based on and extends ideas developed in [20] and [9].Our implementation is complete in the sense that it can handle all kind of inputs including all degenerate ones where intersection curves have singularities or pairs of curves intersect with high multiplicity. It is exact in that it always computes the mathematical correct result. It is efficient measured in running times.
- M. H. Austern. Generic Programming and the STL: Using and Extending the C++ Standard Template Library. Addison-Wesley, 1998. Google Scholar
Digital Library
- J. L. Bentley and T. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput., C-28:643--647, 1979.Google ScholarDigital Library
- E. Berberich. Exact Arrangements of Quadric Intersection Curves. Universität des Saarlandes, Saarbrücken, 2004. Master Thesis.Google Scholar
- E. Berberich, A. Eigenwillig, M. Hemmer, S. Hert, L. Kettner, K. Mehlhorn, J. Reichel, S. Schmitt, E. Schömer, D. Weber, and N. Wolpert. Exacus---efficient and exact algorithms for curves and surfaces. Technical Report ECG-TR-361200-02, 2004.Google Scholar
- E. Berberich, A. Eigenwillig, M. Hemmer, S. Hert, K. Mehlhorn, and E. Schömer. A computational basis for conic arcs and boolean operations on conic polygons. In ESA 2002, Lecture Notes in Computer Science, pages 174--186, 2002. Google ScholarDigital Library
- G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Proc. 2nd GI Conf. on Automata Theory and Formal Languages, volume 6, pages 134--183. Lecture Notes in Computer Science, Springer, Berlin, 1975. Google ScholarDigital Library
- T. Culver, J. Keyser, M. Foskey,, S. Krishnan, and D. Manocha. Esolid - a system for exact boundary evaluation. Computer-Aided Design (Special Issue on Solid Modeling), 36, 2003.Google Scholar
- L. Dupont, D. Lazard, S. Lazard, and S. Petitjean. A new algorithm for the robust intersection of two general quadrics. In Proc. 19th Annu. ACM Sympos. Comput. Geom., pages 246--255, 2003.Google Scholar
- A. Eigenwillig, L. Kettner, E. Schömer, and N. Wolpert. Complete, exact, and efficient computations with cubic curves. In Proc. 20th Annu. ACM Symp. Comput. Geom., pages 409--418, 2004. Google ScholarDigital Library
- I. Emiris, A. Kakargias, S. Pion, M. Teillaud, and E. Tsigaridas. Towards an open curved kernel. In Proc. 20th Annu. ACM Symp. Comput. Geom., pages 438--446, 2004. Google ScholarDigital Library
- Exacus - Libraries for Efficent and Exact Algorithms for Curves and Surfaces. http://www.mpi-sb.mpg.de/projects/EXACUS/.Google Scholar
- N. Geismann, M. Hemmer, and E. Schömer. Computing a 3-dimensional cell in an arrangement of quadrics: Exactly and actually! In Proc. 17th Annu. ACM Sympos. Comput. Geom., pages 264--271, 2001. Google ScholarDigital Library
- J. Keyser, T. Culver, D. Manocha, and S. Krishnan. MAPC: A library for efficient and exact manipulation of algebraic points and curves. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 360--369, 1999. Google ScholarDigital Library
- S. Lazard, L. M. Penaranda, and S. Petitjean. Intersecting quadrics: An efficient and exact implementation. In Proc. 20th Annu. ACM Sympos. Comput. Geom., pages 419--428, 2004. Google ScholarDigital Library
- J. Levin. A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces. Commun. ACM, 19(10):555--563, Oct. 1976. Google ScholarDigital Library
- J. Levin. Mathematical models for determining the intersections of quadric surfaces. Comput. Graph. Image Process., 11:73--87, 1979.Google ScholarCross Ref
- K. Mehlhorn and S. Näher. LEDA -- A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999. Google ScholarDigital Library
- B. Mourrain, J.-P. Técourt, and M. Teillaud. Sweeping an arrangement of quadrics in 3d. In Proc. 19th European Workshop on Computational Geometry, pages 31--34, 2003.Google Scholar
- F. P. Preparata and M. I. Shamos. Computational geometry and introduction. Springer-Verlag, New York, 1985. Google ScholarDigital Library
- E. Schömer and N. Wolpert. An exact and efficient approach for computing a cell in an arrangement of quadrics. CGTA (Special Issue on Robust Geometric Algorithms and their Implementations), submitted, 2004.Google Scholar
- R. Wein. High level filtering for arrangements of conic arcs. In ESA 2002, Lecture Notes in Computer Science, pages 884--895, 2002. Google ScholarDigital Library
- N. Wolpert. An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics. Universität des Saarlandes, 2002. Ph.D. Thesis.Google Scholar
- N. Wolpert. Jacobi curves: Computing the exact topology of arrangements of non-singular algebraic curves. In ESA 2003, Lecture Notes in Computer Science, pages 532--543, 2003.Google Scholar
Index Terms
- An exact, complete and efficient implementation for computing planar maps of quadric intersection curves
Recommendations
Exact, efficient, and complete arrangement computation for cubic curves
The Bentley-Ottmann sweep-line method can compute the arrangement of planar curves, provided a number of geometric primitives operating on the curves are available. We discuss the reduction of the primitives to the analysis of curves and curve pairs, ...
Complete, exact, and efficient computations with cubic curves
SCG '04: Proceedings of the twentieth annual symposium on Computational geometryThe Bentley-Ottmann sweep-line method can be used to compute thearrangement of planar curves provided a number of geometricprimitives operating on the curves are available. We discuss themathematics of the primitives for planar algebraic curves of ...
An exact and efficient approach for computing a cell in an arrangement of quadrics
Special issue on robust geometric algorithms and their implementationsWe 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. ...
Comments