On the Peeper's Voronoi diagram

Authors:
F. Aurenhammer;G. Stöckl
Affiliations:
Institutes for Information Processing, Graz Technical University, Schiesstattgasse 4a, A-8010 Graz, Austria;Institutes for Information Processing, Graz Technical University, Schiesstattgasse 4a, A-8010 Graz, Austria
Venue:
ACM SIGACT News
Year:
1991

Citing 0
Cited 3

Algorithms for computing Best Coverage Path in the presence of obstacles in a sensor field

Journal of Discrete Algorithms
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
Computing best coverage path in the presence of obstacles in a sensor field

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the peeper's Voronoi diagram for n sites, any point in the plane belongs to the region of the closest site visible from it. Visibility is constrained to a segment on a line avoiding the convex hull of the sites. We show that the peeper's Voronoi diagram attains a size of Θ(n2) in the worst case, and that it can be computed in O(n2)time and space.