ISSN 1944-9488
Vol. 5, Issue 3, 2008December 31, 2007 EDT
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Articles in Vol. 5, Issue 3, 2008
Vol. 5, Issue 3, 2008
- Attack Resistance of Power-Law Random Graphs in the Finite-Mean, Infinite-Variance RegionIlkka NorrosHannu Reittu
- An Efficient Vertex Addition Method for Broadcast NetworksHovhannes A. Harutyunyan
- Fast and Efficient Restricted Delaunay Triangulation in Random Geometric GraphsChen Avin
- JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by RandomnessV. SunderamY. KohayakawaJ. ZichV. Rödl
- Threshold Graph Limits and Random Threshold GraphsPersi DiaconisSvante JansonSusan Holmes
Avin, Chen. 2008. “Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs.” Internet Mathematics 5 (3). https://doi.org/10.1080/15427951.2008.10129164.