Boundary approximation of planar shapes by circular arcs has quantitive and qualitative advantages compared to using straight-line segments. We demonstrate this by way of three basic and frequent computations on shapes - convex hull, decomposition, and medial axis. In particular, we propose a novel medial axis algorithm that beats existing methods in simplicity and practicality, and at the same time guarantees convergence to the medial axis of the original shape. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Aichholzer, O., Aurenhammer, F., Hackl, T., Jüttler, B., Oberneder, M., & Šír, Z. (2007). Computational and structural advantages of circular boundary representation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4619 LNCS, pp. 374–385). Springer Verlag. https://doi.org/10.1007/978-3-540-73951-7_33
Mendeley helps you to discover research relevant for your work.