Counting cells of order-k Voronoi tessellations in R^3 with Morse theory

DOI10.4230/LIPICS.SOCG.2021.16MaRDI QIDQ7234072zbMATH OpenFDO

Authors Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian

Publication date 27 April 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2021.16

zbMATH Keywords

arrangementsconvex polytopescountingDelaunay mosaicsMorse theoryVoronoi tessellations

Mathematics Subject Classification ID

Combinatorial complexity of geometric structures (52C45) Critical points and critical submanifolds in differential topology (57R70) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• An improved bound for \(k\)-sets in three dimensions
• Applications of random sampling in computational geometry. II
• Critical points and curvature for embedded polyhedra
• Morse theory for cell complexes
• Multiple packing and covering of the plane with circles
• New applications of continuous parameters in the theory of quadratic forms. II: Investigations on primitive parallelepipeds.
• On k-Nearest Neighbor Voronoi Diagrams in the Plane

Cited in

(1)

• Higher-order color Voronoi diagrams and the colorful Clarkson-Shor framework

This page was built for publication: Counting cells of order-\(k\) Voronoi tessellations in \(\mathbb{R}^3\) with Morse theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7234072)