Celestial Walk: A Terminating, Memoryless Walk for Convex Subdivisions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Computer Graphics Techniques Year : 2018

Celestial Walk: A Terminating, Memoryless Walk for Convex Subdivisions

Abstract

A common solution for routing messages or performing point location in planar subdivisions consists in walking from one face to another using neighboring relationships. If the next face does not depend on the previously visited faces, the walk is called memoryless. We present a new memoryless strategy for convex subdivisions. The known alternatives are straight walk, which is a bit slower and not memoryless, and visibility walk, which is guaranteed to work properly only for Delaunay triangulations. We prove termination of our walk using a novel distance measure that, for our proposed walking strategy, is strictly monotonically decreasing.
Fichier principal
Vignette du fichier
Kuijper2018Walk(1).pdf (7.01 Mo) Télécharger le fichier
Vignette du fichier
vignette.png (23.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Loading...

Dates and versions

hal-01867771 , version 1 (04-09-2018)

Identifiers

  • HAL Id : hal-01867771 , version 1

Cite

Wouter Kuijper, Victor Ermolaev, Olivier Devillers. Celestial Walk: A Terminating, Memoryless Walk for Convex Subdivisions. Journal of Computer Graphics Techniques, 2018, 7 (3), pp.29-49. ⟨hal-01867771⟩
133 View
44 Download

Share

Gmail Facebook Twitter LinkedIn More