Spanners of additively weighted point sets

DOI10.1016/j.jda.2011.03.001zbMath1223.68115OpenAlexW1902053630MaRDI QIDQ635742

Paz Carmi, Prosenjit Bose, Mathieu Couture

Publication date: 23 August 2011

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.03.001

zbMATH Keywords

geometric spannersDelaunay triangulationYao-graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

An improved construction for spanners of disks ⋮ Vertex Fault-Tolerant Geometric Spanners for Weighted Points

Cites Work

• A sweepline algorithm for Voronoi diagrams
• Classes of graphs which approximate the complete Euclidean graph
• Geometric Spanner Networks
• Generalization of Voronoi Diagrams in the Plane
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Unnamed Item
• Unnamed Item

This page was built for publication: Spanners of additively weighted point sets