Dynamic Voronoi diagrams

Authors:
I. Gowda;D. Kirkpatrick;D. Lee;A. Naamad
Affiliations:
-;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

Collision avoidance and low-observable navigation in a dynamic environment

Mathematical and Computer Modelling: An International Journal
Voronoi diagram with visual restriction

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
A navigation mesh for dynamic environments

Computer Animation and Virtual Worlds

Quantified Score

Hi-index	754.84

Visualization

Abstract

A new dynamizing technique is introduced wherebynpoint Voronoi diagrams (both closest and farthest point) can be updated inO(n)time per insertion or deletion, in the worst case. General properties of these dynamic Voronoi diagrams are explored including a storage/ deletion-time trade-off. In addition, their application to such problems as nearest neighbor search and the 2-minimum spanning circle problem is discussed.