Geometric Spanner of Objects under L 1 Distance
From MaRDI portal
Publication:3511351
DOI10.1007/978-3-540-69733-6_39zbMath1148.68555OpenAlexW2017060216MaRDI QIDQ3511351
Jinhui Xu, Naoki Katoh, Shin-ichi Tanigawa, Yang Yang, Yongding Zhu
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
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal spanners for axis-aligned rectangles
- Sparse geometric graphs with small dilation
- 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
This page was built for publication: Geometric Spanner of Objects under L 1 Distance