Skip to Main content Skip to Navigation
Conference papers

Delaunay properties of digital straight segments

Abstract : 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.
Complete list of metadatas
Contributor : Équipe Gestionnaire Des Publications Si Liris <>
Submitted on : Thursday, August 18, 2016 - 7:32:41 PM
Last modification on : Wednesday, November 20, 2019 - 2:51:52 AM

Links full text



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⟩



Record views