Towards dynamic randomized algorithms in computational geometry

DOI10.1007/3-540-57503-0zbMATH Open0809.68033OpenAlexW1527820219MaRDI QIDQ1310282FDOQ1310282

Authors: 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

Recommendations

• scientific article; zbMATH DE number 410386
• scientific article; zbMATH DE number 108277
• Randomized incremental construction of Delaunay and Voronoi diagrams
• On lazy randomized incremental construction
• scientific article; zbMATH DE number 177830

zbMATH Keywords

computational geometryrandomized algorithmsDelaunay triangulationsVoronoi diagramsDelaunay tree

Mathematics Subject Classification ID

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

Cited In (11)

• Four results on randomized incremental constructions
• Randomized incremental construction of Delaunay triangulations of nice point sets
• Title not available (Why is that?)
• Four results on randomized incremental constructions
• On lazy randomized incremental construction
• Title not available (Why is that?)
• Title not available (Why is that?)
• RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
• An introduction to randomization in computational geometry
• Union and split operations on dynamic trapezoidal maps
• Title not available (Why is that?)

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

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