Euclidean farthest-point Voronoi diagram of a digital edge

DOI10.1016/j.dam.2014.06.017zbMath1319.68231OpenAlexW2031575653MaRDI QIDQ2255824

Tristan Roussillon

Publication date: 18 February 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.06.017

zbMATH Keywords

convex hullfarthest-point Voronoi diagramdigital edgefarthest-point Delaunay triangulation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two linear-time algorithms for computing the minimum length polygon of a digital contour
• Lyndon + Christoffel = digitally convex
• An output sensitive algorithm for discrete convex hulls
• Faithful polygonal representation of the convex and concave parts of a digital curve
• Delaunay Properties of Digital Straight Segments
• Computing Two-Dimensional Integer Hulls
• Separable Distance Transformation and Its Applications

This page was built for publication: Euclidean farthest-point Voronoi diagram of a digital edge