LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
A Separation Bound for Real Algebraic Expressions
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Precise Voronoi cell extraction of free-form rational planar closed curves
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Medial axis computation for planar free-form shapes
Computer-Aided Design
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
The predicates of the Apollonius diagram: Algorithmic analysis and implementation
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Hi-index | 0.00 |
We propose a method to compute the algebraically correct medial axis for simply connected planar domains which are given by boundary representations composed of rational circular arcs. The algorithmic approach is based on the Divide-&-Conquer paradigm, as used in [12]. However, we show how to avoid inaccuracies in the medial axis computations arising from a non-algebraic biarc construction of the boundary. To this end we introduce the Exact Circular Arc Boundary representation (ECAB), which allows algebraically exact calculation of bisector curves. Fractions of these bisector curves are then used to construct the exact medial axis. We finally show that all necessary computations can be performed over the field of rational numbers with a small number of adjoint square-roots.