On the peeper's Voronoi diagram

Franz Aurenhammer, [No Value] G. Stöckl

Research output: Book/ReportOther reportResearch

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.
Original languageEnglish
Place of PublicationGraz
Publisher.
DOIs
Publication statusPublished - 1988

Fingerprint

Diagrams
Visibility
Visible

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)

Cite this

On the peeper's Voronoi diagram. / Aurenhammer, Franz; G. Stöckl, [No Value].

Graz : ., 1988.

Research output: Book/ReportOther reportResearch

Aurenhammer, Franz ; G. Stöckl, [No Value]. / On the peeper's Voronoi diagram. Graz : ., 1988.
@book{149d47092376456aa7a8809243ce13cb,
title = "On the peeper's Voronoi diagram",
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.",
author = "Franz Aurenhammer and {G. St{\"o}ckl}, {[No Value]}",
note = "Reportnr.: IIG_Report-Series 264",
year = "1988",
doi = "10.1145/126546.126548",
language = "English",
publisher = ".",

}

TY - BOOK

T1 - On the peeper's Voronoi diagram

AU - Aurenhammer, Franz

AU - G. Stöckl, [No Value]

N1 - Reportnr.: IIG_Report-Series 264

PY - 1988

Y1 - 1988

N2 - 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.

AB - 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.

U2 - 10.1145/126546.126548

DO - 10.1145/126546.126548

M3 - Other report

BT - On the peeper's Voronoi diagram

PB - .

CY - Graz

ER -