Fast triangulation of the plane with respect to simple polygons
Information and Control
On-line construction of the convex hull of a simple polyline
Information Processing Letters
The Graham scan triangulates simple polygons
Pattern Recognition Letters
Randomized incremental construction of abstract Voronoi diagrams
Computational Geometry: Theory and Applications
Journal of Computational and Applied Mathematics - Special issue on computational methods in computer graphics
Spiral arc spline approximation to a planar spiral
Journal of Computational and Applied Mathematics
Curves and Surfaces for Computer-Aided Geometric Design: A Practical Code
Curves and Surfaces for Computer-Aided Geometric Design: A Practical Code
Finding the Medial Axis of a Simple Polygon in Linear Time
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Stability and Finiteness Properties of Medial Axis and Skeleton
Journal of Dynamical and Control Systems
Towards and open curved kernel
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
The Voronoi Diagram of Curved Objects
Discrete & Computational Geometry
Stability and homotopy of a subset of the medial axis
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
A theorem on polygon cutting with applications
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Approximating curves and their offsets using biarcs and Pythagorean hodograph quintics
Computer-Aided Design
Approximation of a planar cubic Bézier spiral by circular arcs
Journal of Computational and Applied Mathematics
Medial Axis Transformation of a Planar Shape
IEEE Transactions on Pattern Analysis and Machine Intelligence
A new linear convex hull algorithm for simple polygons (Corresp.)
IEEE Transactions on Information Theory
Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere
Computational Geometry: Theory and Applications
Medial axis computation for planar free-form shapes
Computer-Aided Design
Divide-and-conquer for Voronoi diagrams revisited
Proceedings of the twenty-fifth annual symposium on Computational geometry
| Hi-index | 0.00 |
Boundary approximation of planar shapes by circular arcs has quantitive and qualitative advantages compared to using straightline 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.