Computational geometry: an introduction
Computational geometry: an introduction
Computer graphics (2nd ed. in C): principles and practice
Computer graphics (2nd ed. in C): principles and practice
The convex Hull of Rational Plane Curves
Graphical Models
A Parametric Solution to Common Tangents
SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
The convex hull of freeform surfaces
Computing - Geometric modelling dagstuhl 2002
| Hi-index | 0.00 |
We develop an algorithm to compute the convex hull of a closed planar parametric curve. The algorithm sweeps a tangent around the curve, using bitangents to define events and effectively wrapping a tangent around the hull. First, a point on the hull is found using a walk out of a concavity and next, the entire hull is found using a walk punctuated by bitangents. The algorithm is a smooth analogue to two classical computational geometry algorithms: plane sweep and giftwrapping. It leverages our recent work on the computation of bitangents.