Euclidean farthest-point Voronoi diagram of a digital edge - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2015

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.
Fichier principal
Vignette du fichier
farthestDT.pdf (398.54 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01157948 , version 1 (29-05-2015)

Identifiants

Citer

Tristan Roussillon. Euclidean farthest-point Voronoi diagram of a digital edge. Discrete Applied Mathematics, 2015, 183, pp.118-129. ⟨10.1016/j.dam.2014.06.017⟩. ⟨hal-01157948⟩
163 Consultations
329 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More