Exact, efficient, and complete arrangement computation for cubic curves
From MaRDI portal
Publication:2507159
DOI10.1016/j.comgeo.2005.10.003zbMath1124.65021OpenAlexW2102336943MaRDI QIDQ2507159
Elmar Schömer, Lutz Kettner, Nicola Wolpert, Arno Eigenwillig
Publication date: 10 October 2006
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: http://edoc.mpg.de/314461
arrangementsrobustnessnumerical examplesalgebraic curvescubic curvesexact geometric computationsweep-line algorithm
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computational aspects of algebraic curves (14Q05)
Related Items
Fourth- and Higher-order Interface Tracking Via Mapping and Adjusting Regular Semianalytic sets Represented by Cubic Splines, A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics, Computing the intersections of three conics according to their Jacobian curve, Improving the topology computation of an arrangement of cubics, Topology of real algebraic space curves, Computing the topology of an arrangement of implicitly defined real algebraic plane curves
Uses Software
Cites Work
- Singular points of algebraic curves
- Vector elimination: A technique for the implicitization, inversion, and intersection of planar parametric rational polynomial curves
- Cauchy index computation
- Sign determination in residue number systems
- An elementary approach to subresultants theory.
- Subresultants revisited.
- Efficient isolation of polynomial's real roots.
- An efficient method for analyzing the topology of plane real algebraic curves.
- New structure theorem for subresultants
- Comparison of interval methods for plotting algebraic curves
- Various new expressions for subresultants and their applications
- Recent progress in exact geometric computation
- On the Bézout construction of the resultant
- Efficient topology determination of implicitly defined algebraic plane curves.
- A strong and easily computable separation bound for arithmetic expressions involving radicals
- New bounds for the Descartes method
- An exact and efficient approach for computing a cell in an arrangement of quadrics
- Note on Vincent's theorem
- Algorithms for Reporting and Counting Geometric Intersections
- The topological configuration of a real algebraic curve
- The Subresultant PRS Algorithm
- Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
- On the design of CGAL a computational geometry algorithms library
- Algebraic methods and arithmetic filtering for exact predicates on circle arcs
- Complete, exact, and efficient computations with cubic curves
- Towards and open curved kernel
- The design and implementation of panar maps in CGAL
- Algorithms – ESA 2004
- Algorithms – ESA 2005
- Computer Algebra in Scientific Computing
- Subresultants and Reduced Polynomial Remainder Sequences
- On Euclid's Algorithm and the Theory of Subresultants
- Algorithms - ESA 2003
- Algorithms in real algebraic geometry
- Sylvester-Habicht sequences and fast Cauchy index computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
