COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION
Authors:
- 1 February 2011
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Geometry & Applications
- Vol. 21 (01) , 47-69
Abstract
Boundary approximation of planar shapes by circular arcs has quantitative 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.Keywords
This publication has 33 references indexed in Scilit:
- Approximation of an open polygonal curve with a minimum number of circular arcs and biarcsComputational Geometry, 2008
- Exploiting curvatures to compute the medial axis for domains with smooth boundaryComputer Aided Geometric Design, 2004
- Voronoi diagram and medial axis algorithm for planar domains with curved boundaries I. Theoretical foundationsJournal of Computational and Applied Mathematics, 1999
- Geometric Hermite interpolation with maximal order and smoothnessComputer Aided Geometric Design, 1996
- Approximating smooth planar curves by arc splinesJournal of Computational and Applied Mathematics, 1995
- Randomized incremental construction of abstract Voronoi diagramsComputational Geometry, 1993
- The Graham scan triangulates simple polygonsPattern Recognition Letters, 1990
- An efficient algorithm for decomposing a polygon into star-shaped polygonsPattern Recognition, 1981
- A linear algorithm for finding the convex hull of a simple polygonInformation Processing Letters, 1979
- An efficient algorith for determining the convex hull of a finite planar setInformation Processing Letters, 1972