Fast segment insertion and incremental construction of constrained delaunay triangulations
DOI10.1145/2462356.2462389zbMath1305.68276OpenAlexW2154441579MaRDI QIDQ5174490
Jonathan Richard Shewchuk, Brielin C. Brown
Publication date: 17 February 2015
Published in: Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2462356.2462389
computational geometryconstrained Delaunay triangulationrandomized incremental construction\(\epsilon\)-net
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
This page was built for publication: Fast segment insertion and incremental construction of constrained delaunay triangulations
