Computational geometry: an introduction
Computational geometry: an introduction
Digital straightness: a review
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Graphical Models
Robust Voronoi-based curvature and feature estimation
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Two linear-time algorithms for computing the minimum length polygon of a digital contour
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
| Hi-index | 0.00 |
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.