AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES

DOI10.1142/S021819590700229XzbMath1144.65014OpenAlexW2155762515MaRDI QIDQ3442765

Elisha P. Sacks, Victor J. Milenkovic

Publication date: 23 May 2007

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021819590700229x

zbMATH Keywords

computational geometryarrangement algorithmsemi-algebraic curves

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Efficient Predicate Evaluation Using Randomized Degeneracy Detection, PLANAR SHAPE MANIPULATION USING APPROXIMATE GEOMETRIC PRIMITIVES, Arrangements on parametric surfaces. I: General framework and infrastructure, Out-of-order event processing in kinetic data structures

Uses Software

• LAPACK
• LEDA

Cites Work

• Unnamed Item
• Efficient and exact manipulation of algebraic points and curves
• An iterated eigenvalue algorithm for approximating roots of univariate polynomials
• Rotational polygon containment and minimum enclosure using only robust 2D constructions
• Densest translational lattice packing of non-convex polygons
• Shortest path geometric rounding
• An exact and efficient approach for computing a cell in an arrangement of quadrics
• LAPACK Users' Guide