LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
The design and implementation of panar maps in CGAL
Journal of Experimental Algorithmics (JEA)
Efficient topology determination of implicitly defined algebraic plane curves
Computer Aided Geometric Design
High-Level Filtering for Arrangements of Conic Arcs
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On the exact computation of the topology of real algebraic curves
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Fast and exact geometric analysis of real algebraic plane curves
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
Exact and efficient 2D-arrangements of arbitrary algebraic curves
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Improving the topology computation of an arrangement of cubics
Computational Geometry: Theory and Applications
| Hi-index | 0.01 |
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.