Geometric Spanner of Objects under L 1 Distance

DOI10.1007/978-3-540-69733-6_39MaRDI QIDQ3511351zbMATH OpenOpenAlexFDO

Authors Yongding Zhu, Jinhui Xu, Yang Yang, Naoki Katoh, Shin-Ichi Tanigawa

Publication date 10 July 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69733-6_39

Mathematics Subject Classification ID

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

Recommendations

• Geometric Spanner of Segments
• A geometric spanner of segments
• The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation
• Optimal spanners for axis-aligned rectangles
• The minimum Manhattan network problem: Approximations and exact solutions

Cites work

• Classes of graphs which approximate the complete Euclidean graph
• Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
• Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
• Geometric Spanner of Segments
• scientific article; zbMATH DE number 4070353 (Why is no real title available?)
• scientific article; zbMATH DE number 1263225 (Why is no real title available?)
• Optimal spanners for axis-aligned rectangles
• Sparse geometric graphs with small dilation

Cited in

(5)

• Geometric Spanner Networks
• scientific article; zbMATH DE number 1263225 (Why is no real title available?)
• A geometric spanner of segments
• Geometric Spanner of Segments
• Optimal spanners for axis-aligned rectangles

This page was built for publication: Geometric Spanner of Objects under L 1 Distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511351)