Abstract
In this paper, we define and investigate the properties of k-Gabriel graphs and also propose an algorithm to construct the k-Gabriel graph of a points set in O(k2 nlogn) time. The k-Gabriel graphs are also used to improve the running time of solving the Euclidean bottleneck biconnected edge subgraph problem from O(n2) to O (nlogn), and that of solving the Euclidean bottleneck matching problem from O(n2) O(n1.5log0.5n).
Cite
CITATION STYLE
Su, T. H., & Chang, R. C. (1990). The K-gabriel graphs and their applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 450 LNCS, pp. 67–75). Springer Verlag. https://doi.org/10.1007/3-540-52921-7_56
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
