Delaunay properties of digital straight segments

Tristan Roussillon (1) , Jacques-Olivier Lachaud (2)

1 M2DisCo - Geometry Processing and Constrained Optimization
2 LAMA - Laboratoire de Mathématiques

We present new results concerning the Delaunay triangulation of the set of points of pieces of digital straight lines. More precisely, we show how the triangulation topology follows the arithmetic decomposition of the line slope as well as its combinatorial decomposition (splitting formula). A byproduct is a linear time algorithm for computing the Delaunay triangulation and the Voronoi diagram of such sets.

Domaines: Informatique [cs]

Tristan Roussillon, Jacques-Olivier Lachaud. Delaunay properties of digital straight segments. 16-th IAPR International Conference on Discrete Geometry for Computer Imagery (DGCI) , Apr 2011, Nancy, France. pp.308-319, ⟨10.1007/978-3-642-19867-0_26⟩. ⟨hal-01354557⟩