Abstract
We analyze how to compute in an efficient way the topology of an arrangement of quartic curves. We suggest a sweeping method that generalizes the one presented by Eigenwillig et al. for cubics. The proposed method avoids working with the roots of the involved resultants (most likely algebraic numbers) in order to give an exact and complete answer. We only treat in detail the cases of one and two curves because we do not introduce any significant variation in the several curves case with respect to Eigenwillig’s paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Basu, S., Pollack, R., Roy, M.–F.: Algorithms in Real Algebraic Geometry. In: Algorithms and Computation in Mathematics, vol. 10, Springer, Heidelberg (2006)
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)
Caravantes, J., Gonzalez–Vega, L.: Improving the Topology Computation of Arrangements of Low Degree Algebraic Curves. Work in progress (2007)
Eigenwillig, A., Kettner, L., Schömer, E., Wolpert, N.: Exact, Efficient and Complete Arrangement Computation for Cubic Curves. Computational Geometry 35, 36–73 (2006)
Flato, E., Halperin, D., Hanniel, I., Nechushtan, O., Ezra, E.: The Design and Implementation of Planar Maps in CGAL. ACM J. Experimental Algorithmics 5, article 13 (2000)
Gonzalez-Vega, L., Necula, I.: Efficient Topology Determination of Implicitly Defined Algebraic Plane Curves. Computer Aided Geometric Design 19, 719–743 (2002)
Eigenwillig, A., Kerber, M., Wolpert, N.: Fast and Exact Geometric Analysis of Real Algebraic Plane Curves. In: ISSAC 2007. Proc. Int. Symp. Symbolic and Algebraic Computation (in print)
Li, Y.B.: A New Approach for Constructing Subresultants. Applied Math. and Computation 183, 471–476 (2006)
Mehlhorn, K., Noher, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)
Seel, M.: Implementation of Planar Nef Polyhedra. Report MPI-I-2001-1-003, Max-Planck-Institut für Informatik (2001)
Seidel, R., Wolpert, N.: On the Exact Computation of the Topology of Real Algebraic Curves (Exploiting a Little More Geometry and a Little Less Algebra). In: Proc. 21st Annual ACM Symp. Computational Geometry, pp. 107–115 (2005)
Wein, R.: High-level Filtering for Arrangements of Conic Arcs. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 884–895. Springer, Heidelberg (2002)
Wolpert, N.: Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 532–543. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caravantes, J., Gonzalez-Vega, L. (2007). Computing the Topology of an Arrangement of Quartics. In: Martin, R., Sabin, M., Winkler, J. (eds) Mathematics of Surfaces XII. Mathematics of Surfaces 2007. Lecture Notes in Computer Science, vol 4647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73843-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-73843-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73842-8
Online ISBN: 978-3-540-73843-5
eBook Packages: Computer ScienceComputer Science (R0)