Sciweavers

SODA
2008
ACM
106views Algorithms» more  SODA 2008»
13 years 5 months ago
Exact and efficient 2D-arrangements of arbitrary algebraic curves
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
Arno Eigenwillig, Michael Kerber
ISSAC
2009
Springer
171views Mathematics» more  ISSAC 2009»
13 years 10 months ago
Computing cylindrical algebraic decomposition via triangular decomposition
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
Changbo Chen, Marc Moreno Maza, Bican Xia, Lu Yang