Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
From MaRDI portal
Publication:3400883
DOI10.1080/15427951.2008.10129164zbMath1195.68103OpenAlexW2041623322MaRDI QIDQ3400883
Publication date: 27 January 2010
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2008.10129164
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
This page was built for publication: Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
