CENTROID TRIANGULATIONS FROM k-SETS

DOI10.1142/S0218195911003846zbMath1251.68286MaRDI QIDQ4650084

Jean-Claude Spehner, Wael El Oraiby, Dominique Schmitt

Publication date: 23 November 2012

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

order-\(k\) Voronoi diagrams; \(k\)-set enumeration; centroid triangulations; convex inclusion chains

Mathematics Subject Classification ID

52B55: Computational aspects related to convexity

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Cites Work

• The number of small semispaces of a finite set of points in the plane
• On `\(k\)-sets' in the plane
• Cutting dense point sets in half
• Improved bounds for planar \(k\)-sets and related problems
• In between \(k\)-sets, \(j\)-facets, and \(i\)-faces: \((i,j)\)-partitions
• Dynamic half-space range reporting and its applications
• On Polya frequency functions. IV: The fundamental spline functions and their limits
• A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS
• Delaunay configurations and multivariate splines: A generalization of a result of B. N. Delaunay
• Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
• Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
• Point sets with many \(k\)-sets