Abstract
Given a set of n points in the plane, any β-skeleton and [γ0, γ1] graph can be computed in quadratic time. The presented algorithms are optimal for β values that are less than 1 and [γ0, γ1] values that result in non-planar graphs. For β = 1, we show a numerically robust algorithm that computes Gabriel graphs in quadratic time and degree 2. We finally show how a β-spectrum can be computed in optimal O(n2) time.
Cite
CITATION STYLE
Hurtado, F., Liotta, G., & Meijer, H. (2001). Optimal, suboptimal, and robust algorithms for proximity graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2125, pp. 2–13). Springer Verlag. https://doi.org/10.1007/3-540-44634-6_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
