5 citations · 10 across the 4 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2012★ 5 cited
Exact Symbolic-Numeric Computation of Planar Algebraic Curves
Eric Berberich, Pavel Emeliyanenko, Alexander Kobel +1
We present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of th…
cs.CG2011★ 1 cited
Deconstructing Approximate Offsets
Eric Berberich, Dan Halperin, Michael Kerber +1
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance \eps in Hausdorff distance, as the Minkowski sum of…