Path-planning by tessellation of obstacles

Authors:
Tane Pendragon;Lyndon While
Affiliations:
School of Computer Science & Software Engineering, The University of Western Australia, Western Australia;School of Computer Science & Software Engineering, The University of Western Australia, Western Australia
Venue:
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Year:
2003

Citing 1
Cited 1

Voronoi tessellation of points with integer coordinates: Time-efficient implementation and online edge-list generation

Pattern Recognition

Exploring the design space of multiscale 3D orientation

Proceedings of the International Conference on Advanced Visual Interfaces

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe two algorithms for static path-planning, with the aim of deriving the trajectory that always maximises the distance of the path from the nearest obstacle. The bubble algorithm allocates individual pixels to generating points, growing the area owned by each point at a globally constant rate to ensure that boundaries are equidistant between neighbouring points. The geometric algorithm derives the same "perfect path", but without examining pixels individually, and thus with good performance. It compares geometric elements pairwise to generate segments of the boundaries, then intersects these segments to derive the perfect path. The geometric algorithm is the lowest-complexity algorithm yet described that derives this perfect path.