Skip to main content
Conference ProceedingsOPEN ACCESS

Delaunay properties of digital straight segments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6607 LNCS 308-319
DOI: 10.1007/978-3-642-19867-0_26
3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Roussillon, T., & Lachaud, J. O. (2011). Delaunay properties of digital straight segments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6607 LNCS, pp. 308–319). https://doi.org/10.1007/978-3-642-19867-0_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free