On the Peeper's Voronoi diagram-Reference-Cited by-同舟云学术

On the Peeper's Voronoi diagram

Published:1991-09 Issue:4 Volume:22 Page:50-59
ISSN:0163-5700
Container-title:ACM SIGACT News
language:en
Short-container-title:SIGACT News

Author:

Aurenhammer F.¹,Stöckl G.¹

Affiliation:

1. Institutes for Information Processing, Graz Technical University, Schiesstattgasse 4a, A-8010 Graz, Austria

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 Θ( n 2 ) in the worst case, and that it can be computed in O ( n 2 )time and space.

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/126546.126548

Reference13 articles.

1. On the geodesic Voronoi diagram of point sites in a simpl e polygon;Aronov B .;Algorithmica,1989

2. Power diagrams : properties, algorithms , and applications . SIAM J;Aurenhammer F .;Computing,1987

3. On shortest paths between two conve x polyhedra . J;Baltsan A .;ACM,1988

4. Multidimensional divide and conquer;Bentley J .;Comm. ACM,1980

5. A functional approach to data structures and its use i n multidimensional searching . SIAM J;Chazelle B .;Computing,1988

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A note on visibility-constrained Voronoi diagrams;Discrete Applied Mathematics;2014-09

2. Voronoi diagram with visual restriction;Theoretical Computer Science;2014-05

3. Algorithms for computing Best Coverage Path in the presence of obstacles in a sensor field;Journal of Discrete Algorithms;2012-05

4. Voronoi Diagram with Visual Restriction;Frontiers in Algorithmics and Algorithmic Aspects in Information and Management;2012

5. Finding constrained and weighted Voronoi diagrams in the plane;Computational Geometry;1998-05