Skip to main content
Conference Proceedings

Maximizing a voronoi region: The convex case

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2518 LNCS 624-634
DOI: 10.1007/3-540-36136-7_54
11Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given a set S of s points in the plane, where do we place a new point, p, in order to maximize the area of its region in the Voronoi diagram of S and p? We study the case where the Voronoi neighbors of p are in convex position, and prove that there is at most one local maximum. © Springer-Verlag Berlin Heidelberg 2002.

Author supplied keywords

Cite

CITATION STYLE

APA

Dehne, F., Klein, R., & Seidel, R. (2002). Maximizing a voronoi region: The convex case. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2518 LNCS, pp. 624–634). https://doi.org/10.1007/3-540-36136-7_54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free