Delaunay Properties of Digital Straight Segments
From MaRDI portal
Publication:3000713
DOI10.1007/978-3-642-19867-0_26zbMath1272.52027OpenAlexW1592679998MaRDI QIDQ3000713
Tristan Roussillon, Jacques-Olivier Lachaud
Publication date: 19 May 2011
Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19867-0_26
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Radix representation; digital problems (11A63) Combinatorial aspects of tessellation and tiling problems (05B45)
Related Items (3)
An output-sensitive algorithm to compute the normal vector of a digital plane ⋮ Efficiently testing digital convexity and recognizing digital convex polygons ⋮ Euclidean farthest-point Voronoi diagram of a digital edge
This page was built for publication: Delaunay Properties of Digital Straight Segments
