Euclidean farthest-point Voronoi diagram of a digital edge
Résumé
A digital edge is a digitization of a straight segment joining two points of integer coordinates. Such a digital set may be analytically defined by the rational slope of the straight segment. We show in this paper that the convex hull, the Euclidean farthest-point Voronoi diagram as well as the dual farthest-point Delaunay triangulation of a digital edge can be fully described by the continued fraction expansion of its slope.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...