Book contents
- Frontmatter
- Contents
- Preface
- I Preliminaries
- II Spanners Based on Simplicial Cones
- 4 Spanners Based on the Θ-Graph
- 5 Cones in Higher Dimensional Space and Θ-Graphs
- 6 Geometric Analysis: The Gap Property
- 7 The Gap-Greedy Algorithm
- 8 Enumerating Distances Using Spanners of Bounded Degree
- III The Well-Separated Pair Decomposition and Its Applications
- IV The Path-Greedy Algorithm and Its Analysis
- V Further Results on Spanners and Applications
- Bibliography
- Algorithms Index
- Index
4 - Spanners Based on the Θ-Graph
from II - Spanners Based on Simplicial Cones
Published online by Cambridge University Press: 05 September 2009
- Frontmatter
- Contents
- Preface
- I Preliminaries
- II Spanners Based on Simplicial Cones
- 4 Spanners Based on the Θ-Graph
- 5 Cones in Higher Dimensional Space and Θ-Graphs
- 6 Geometric Analysis: The Gap Property
- 7 The Gap-Greedy Algorithm
- 8 Enumerating Distances Using Spanners of Bounded Degree
- III The Well-Separated Pair Decomposition and Its Applications
- IV The Path-Greedy Algorithm and Its Analysis
- V Further Results on Spanners and Applications
- Bibliography
- Algorithms Index
- Index
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9780511546884/resource/name/firstPage-9780511546884c4_p63-91_CBO.jpg)
- Type
- Chapter
- Information
- Geometric Spanner Networks , pp. 63 - 91Publisher: Cambridge University PressPrint publication year: 2007