Spanners of Additively Weighted Point Sets

DOI10.1007/978-3-540-69903-3_33zbMath1155.68547OpenAlexW2809377824MaRDI QIDQ3512473

Mathieu Couture, Paz Carmi, Prosenjit Bose

Publication date: 15 July 2008

Published in: Algorithm Theory – SWAT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_33

Mathematics Subject Classification ID

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

Related Items (4)

Spanners of Additively Weighted Point Sets ⋮ Geometric spanners for weighted point sets ⋮ Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces ⋮ Vertex fault-tolerant spanners for weighted points in polygonal domains

Cites Work

• Unnamed Item
• Unnamed Item
• A sweepline algorithm for Voronoi diagrams
• Classes of graphs which approximate the complete Euclidean graph
• Geometric Spanner Networks
• Spanners of Additively Weighted Point Sets
• 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

This page was built for publication: Spanners of Additively Weighted Point Sets