论文信息 - Delaunay Properties of Digital Straight Segments

Delaunay Properties of Digital Straight Segments

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.

Jacques-Olivier Lachaud | Tristan Roussillon

[1] Douglas Quadling,et al. The Higher Arithmetic , 1954 .

[2] K. Voss. Discrete Images, Objects, and Functions in Zn , 1993 .

[3] Leonidas J. Guibas,et al. Robust Voronoi-based curvature and feature estimation , 2009, Symposium on Solid and Physical Modeling.

[4] F. Chazal,et al. The λ-medial axis , 2005 .

[5] Louis de Forcrand,et al. Higher Arithmetic , 1898, Nature.

[6] Azriel Rosenfeld,et al. Digital straightness - a review , 2004, Discret. Appl. Math..

[7] Jean-Pierre Reveillès. Géométrie discrète, calcul en nombres entiers et algorithmique , 1991 .

[8] Hugues Talbot,et al. A discrete λ-medial axis , 2009 .

[9] David G. Kirkpatrick,et al. On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.

[10] Jacques-Olivier Lachaud,et al. Two linear-time algorithms for computing the minimum length polygon of a digital contour , 2009, Discret. Appl. Math..

[11] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .