Order-fc voronoi diagrams, fc-sections, and k-sets

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we characterize all-dimensional faces of order- k Voronoi diagrams. First we introduce the notion of fc-section to give a precise definition of these faces. Then, we characterize the unbounded faces by extending the classical notion of k-set. Finally, by studying some relations between fc-sections, we give a new proof of the size of order-A: Voronoi diagrams in the plane.

Cite

CITATION STYLE

APA

Schmitt, D., & Spehner, J. C. (2000). Order-fc voronoi diagrams, fc-sections, and k-sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1763, pp. 290–304). Springer Verlag. https://doi.org/10.1007/978-3-540-46515-7_26

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