DocumentCode
1889821
Title
k-set polytopes and order-k Delaunay diagrams
Author
Schmitt, Dominique ; Spehner, Jean-Claude
Author_Institution
Lab. de Math., Inf. et Applic. Univ. de Haute-Alsace, Mulhouse
fYear
2006
fDate
2-5 July 2006
Firstpage
173
Lastpage
185
Abstract
Given a set S of n points (called sites) in a d-dimensional Euclidean space E and an integer k, 1 les k les n - 1, we consider three known structures that are defined through subsets of k elements of S: The k-set polytope of S, the order-k Voronoi diagram of S, and its dual, the order-k Delaunay diagram of S. We give a new compact characterization of all-dimensional faces of these three structures through the notions of k-couple and of k-set polytope of a k-couple. We also show that the incidence relations between these faces correspond to inclusion relations between k-couples. These characterizations allow us to give simple proofs of well known relations between the three structures, especially that the d-dimensional order-k Delaunay diagram is the projection of the lower hull of a (d + 1)- dimensional k-set polytope and is the orthogonal dual of the order-k Voronoi diagram.
Keywords
computational geometry; mesh generation; k-set polytopes; order-k Delaunay diagrams; order-k Voronoi diagram; Algebra; Computational geometry; Data analysis; Gravity; Iterative algorithms; Nearest neighbor searches;
fLanguage
English
Publisher
ieee
Conference_Titel
Voronoi Diagrams in Science and Engineering, 2006. ISVD '06. 3rd International Symposium on
Conference_Location
Banff, Alberta, BC
Print_ISBN
0-7695-2630-6
Type
conf
DOI
10.1109/ISVD.2006.43
Filename
4124818
Link To Document