An optimal algorithm for computing angle-constrained spanners
Let <em>S</em> be a set of <em>n</em> points in R<sup><em>d</em></sup> and let <em>t</em>>1 be a real number. A graph <em>G</em>=(<em>S</em>,<em>E</em>) is called a <em>t</em>-spanner f...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Carleton University
2012-11-01
|
| Series: | Journal of Computational Geometry |
| Online Access: | http://jocg.org/index.php/jocg/article/view/94 |