Abstract
We present an approach that extends the Bentley-Ottmann sweep-line algorithm [2] to the exact computation of the topology of arrangements induced by non-singular algebraic curves of arbitrary degrees. Algebraic curves of degree greater than 1 are difficult to handle in case one is interested in exact and efficient solutions. In general, the coordinates of intersection points of two curves are not rational but algebraic numbers and this fact has a great negative impact on the efficiency of algorithms coping with them. The most serious problem when computing arrangements of non-singular algebraic curves turns out be the detection and location of tangential intersection points of two curves. The main contribution of this paper is a solution to this problem, using only rational arithmetic. We do this by extending the concept of Jacobi curves introduced in [11]. Our algorithm is output-sensitive in the sense that the algebraic effort we need for sweeping a tangential intersection point depends on its multiplicity.
Partially supported by the IST Programme of the EU as a Shared-cost RTD (FET Open) Project under Contract No IST-2000-26473 (ECG – Effective Computational Geometry for Curves and Surfaces)
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bajaj, C., Kim, M.S.: Convex hull of objects bounded by algebraic curves. Algorithmica 6, 533–553 (1991)
Bentley, J.L., Ottmann, T.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. C-28, 643–647 (1979)
Berberich, E., Eigenwillig, A., Hemmer, M., Hert, S., Mehlhorn, K., Schömer, E.: A computational basis for conic arcs and boolean operations on conic polygons. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 174–186. Springer, Heidelberg (2002)
Canny, J.: The Complexity of Robot Motion Planning. MIT Press, Cambridge (1987)
Collins, G.E., Loos, R.: Real zeros of polynomials. In: Buchberger, B., Collins, G.E., Loos, R. (eds.) Computer Algebra: Symbolic and Algebraic Computation, pp. 83–94. Springer, New York (1982)
Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms. Springer, New York (1997)
Dobkin, D.P., Souvaine, D.L.: Computational geometry in a curved world. Algorithmica 5, 421–457 (1990)
Dupont, L., Lazard, D., Lazard, S., Petitjean, S.: Near-optimal parameterization of the intersection of quadrics. In: Proc. 19th Annu. ACM Sympos. Comput. Geom., pp. 246–255 (2003)
Eigenwillig, A., Schömer, E., Wolpert, N.: Sweeping arrangements of cubic segments exactly and efficiently. Technical Report ECG-TR-182202-01 (2002)
Flato, E., Halperin, D., Hanniel, I., Nechushtan, O.: The design and implementation of planar maps in cgal. In: Proceedings of the 3rd Workshop on Algorithm Engineering. Lecture Notes Comput. Sci, pp. 154–168 (1999)
Geismann, N., Hemmer, M., Schömer, E.: Computing a 3-dimensional cell in an arrangement of quadrics: Exactly and actually! In: Proc. 17th Annu. ACM Sympos. Comput. Geom., pp. 264–271 (2001)
Gunning, R., Rossi, H.: Analytic functions of several complex variables. Prentice- Hall, Inc., Englewood Cliffs (1965)
Hong, H.: An efficient method for analyzing the topology of plane real algebraic curves. Mathematics and Computers in Simulation 42, 571–582 (1996)
Keyser, J., Culver, T., Manocha, D., Krishnan, S.: MAPC: A library for efficient and exact manipulation of algebraic points and curves. In: Proc. 15th Annu. ACM Sympos. Comput. Geom., pp. 360–369 (1999)
Mehlhorn, K., Näher, S.: LEDA – A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)
Milne, P.S.: On the solutions of a set of polynomial equations. Symbolic and Numerical Computation for Artificial Intelligence, 89–102 (1992)
Mourrain, B., Técourt, J.-P., Teillaud, M.: Sweeping an arrangement of quadrics in 3d. In: Proceedings of 19th European Workshop on Computational Geometry (2003)
Mulmuley, K.: A fast planar partition algorithm, II. J. ACM 38, 74–103 (1991)
Sakkalis, T.: The topological configuration of a real algebraic curve. Bulletin of the Australian Mathematical Society 43, 37–50 (1991)
Snoeyink, J., Hershberger, J.: Sweeping arrangements of curves. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 6, 309–349 (1991)
Wein, R.: On the planar intersection of natural quadrics. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 884–895. Springer, Heidelberg (2002)
Wolpert, N.: An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics. Universität des Saarlandes, Saarbrücken, Ph.D. Thesis (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wolpert, N. (2003). Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive