An approximate arrangement algorithm for semi-algebraic curves

zbMATH Open1153.14307MaRDI QIDQ3601544FDOQ3601544

Authors: Victor J. Milenkovic, Elisha Sacks 

Publication date: 10 February 2009

Recommendations

• AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES
• Exact, efficient, and complete arrangement computation for cubic curves
• Arrangement computation for planar algebraic curves
• Publication:4504029
• Topology and arrangement computation of semi-algebraic planar curves

Mathematics Subject Classification ID

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

Cited In (9)

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

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)