Towards dynamic randomized algorithms in computational geometry

DOI10.1007/3-540-57503-0zbMath0809.68033OpenAlexW1527820219MaRDI QIDQ1310282

Monique Teillaud

Publication date: 8 December 1993

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00076966/file/RR-1727.pdf

zbMATH Keywords

computational geometryrandomized algorithmsVoronoi diagramsDelaunay triangulationsDelaunay tree

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (2)

An introduction to randomization in computational geometry ⋮ Union and split operations on dynamic trapezoidal maps

This page was built for publication: Towards dynamic randomized algorithms in computational geometry