The worst visibility walk in a random Delaunay triangulation is $O(\sqrt{n})$
<div class="adn ads"><div class="gs"><div id=":s3" class="ii gt adP adO"><div id=":s2" class="a3s aXjCH m156228dc715cae67">We show that the memoryless routing algorithms Greedy Walk, Compass Walk, and all variants of...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Carleton University
2016-07-01
|
| Series: | Journal of Computational Geometry |
| Online Access: | http://jocg.org/index.php/jocg/article/view/252 |