Book contents
- Frontmatter
- Contents
- Preface
- I Preliminaries
- II Spanners Based on Simplicial Cones
- III The Well-Separated Pair Decomposition and Its Applications
- 9 The Well-Separated Pair Decomposition
- 10 Applications of Well-Separated Pairs
- 11 The Dumbbell Theorem
- 12 Shortcutting Trees and Spanners with Low Spanner Diameter
- 13 Approximating the Stretch Factor of Euclidean Graphs
- IV The Path-Greedy Algorithm and Its Analysis
- V Further Results on Spanners and Applications
- Bibliography
- Algorithms Index
- Index
10 - Applications of Well-Separated Pairs
from III - The Well-Separated Pair Decomposition and Its Applications
Published online by Cambridge University Press: 05 September 2009
- Frontmatter
- Contents
- Preface
- I Preliminaries
- II Spanners Based on Simplicial Cones
- III The Well-Separated Pair Decomposition and Its Applications
- 9 The Well-Separated Pair Decomposition
- 10 Applications of Well-Separated Pairs
- 11 The Dumbbell Theorem
- 12 Shortcutting Trees and Spanners with Low Spanner Diameter
- 13 Approximating the Stretch Factor of Euclidean Graphs
- IV The Path-Greedy Algorithm and Its Analysis
- V Further Results on Spanners and Applications
- Bibliography
- Algorithms Index
- Index
Summary
- Type
- Chapter
- Information
- Geometric Spanner Networks , pp. 178 - 195Publisher: Cambridge University PressPrint publication year: 2007