A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations

DOI10.1007/978-3-662-48350-3_50zbMath1466.68070OpenAlexW1826145615MaRDI QIDQ3452821

Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01213070/file/esa.pdf

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial probability (60C05) Simplicial sets and complexes in algebraic topology (55U10)

Related Items (4)

A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations ⋮ Coxeter triangulations have good quality ⋮ Only distances are required to reconstruct submanifolds ⋮ Delaunay simplices in diagonally distorted lattices

Cites Work

• Unnamed Item
• Unnamed Item
• The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes
• A weak characterisation of the Delaunay triangulation
• Only distances are required to reconstruct submanifolds
• THE STABILITY OF DELAUNAY TRIANGULATIONS
• A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations
• A constructive proof of the general lovász local lemma
• Computing planar Voronoi diagrams in double precision
• Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic

This page was built for publication: A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations