Home /Research /On validating planar worlds
OTHER

On validating planar worlds

Vida Dujmoviác, Sue Whitesides

Year
2001
Citations
6

Abstract

We present an optimal linear time algorithm for solving a map validation problem: a robot equipped with one portable marker must determine the correctness of a given map of its graph-like world, modelled as a possibly non-planar embedding of a planar graph.

Keywords

CorrectnessPlanar straight-line graphPlanarPlanar graphEmbeddingComputer scienceGraphRobotBook embeddingGraph embedding

Related papers

Browse all OTHER papers