Euclidean farthest-point Voronoi diagram of a digital edge - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2015

Euclidean farthest-point Voronoi diagram of a digital edge

Abstract

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
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

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⟩
150 View
279 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More