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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Chaussard, J., Couprie, M., Talbot, H.: A discrete λ-medial axis. In: Brlek, S., Reutenauer, C., Provençal, X. (eds.) DGCI 2009. LNCS, vol. 5810, pp. 421–433. Springer, Heidelberg (2009)
Chazal, F., Lieutier, A.: The λ-medial axis. Graph. Models 67(4), 304–331 (2005)
Davenport, H.: The Higher Arithmetic. Cambridge University Press, Cambridge (1992)
Edelsbrunner, H., Kirkpatrick, D.G., Seidel, R.: On the Shape of a Set of Points in the Plane. IEEE Trans. on IT 29(4), 551–559 (1983)
Klette, R., Rosenfeld, A.: Digital straightness – a review. Discrete Applied Mathematics 139(1-3), 197–230 (2004)
Mérigot, Q., Ovsjanikov, M., Guibas, L.: Robust voronoi-based curvature and feature estimation. In: Proc. SIAM/ACM Joint Conference on Geometric and Physical Modeling (SPM 2009), pp. 1–12. ACM, New York (2009)
Preparata, F.P., Shamos, M.I.: Computational geometry: an introduction. Springer, Heidelberg (1985)
Provençal, X., Lachaud, J.O.: Two linear-time algorithms for computing the minimum length polygon of a digital contour. In: Brlek, S., Reutenauer, C., Provençal, X. (eds.) DGCI 2009. LNCS, vol. 5810, pp. 104–117. Springer, Heidelberg (2009)
Reveillès, J.P.: Géométrie discrète, calcul en nombres entiers et algorithmique. Thèse d’etat, Université Louis Pasteur, Strasbourg, France (1991) (in french)
Voss, K.: Discrete Images, Objects, and Functions in ℤn. Springer, Heidelberg (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roussillon, T., Lachaud, JO. (2011). Delaunay Properties of Digital Straight Segments. In: Debled-Rennesson, I., Domenjoud, E., Kerautret, B., Even, P. (eds) Discrete Geometry for Computer Imagery. DGCI 2011. Lecture Notes in Computer Science, vol 6607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19867-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-19867-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19866-3
Online ISBN: 978-3-642-19867-0
eBook Packages: Computer ScienceComputer Science (R0)