An approximate arrangement algorithm for semi-algebraic curves

MaRDI QIDQ3601544zbMATH OpenFDO

Authors Victor J. Milenkovic, Elisha Sacks

Publication date 10 February 2009

Mathematics Subject Classification ID

Semialgebraic sets and related spaces (14P10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES
• Exact, efficient, and complete arrangement computation for cubic curves
• Arrangement computation for planar algebraic curves
• scientific article; zbMATH DE number 1507303
• Topology and arrangement computation of semi-algebraic planar curves

Cited in

(9)

• Algorithms for ordering unorganized points along parametrized curves
• A package for exact kinetic data structures and sweepline algorithms
• Exact, efficient, and complete arrangement computation for cubic curves
• AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES
• Sorting Points Along an Algebraic Curve
• scientific article; zbMATH DE number 1507303 (Why is no real title available?)
• Algorithm 942
• A subdivision method for arrangement computation of semi-algebraic curves
• Topology and arrangement computation of semi-algebraic planar curves

This page was built for publication: An approximate arrangement algorithm for semi-algebraic curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601544)