A LINEAR-TIME CONSTRUCTION OF THE RELATIVE NEIGHBORHOOD GRAPH FROM THE DELAUNAY TRIANGULATION

被引：19
|
作者：
LINGAS, A [1 ]
机构：
[1] LUND UNIV,DEPT COMP SCI,S-22100 LUND,SWEDEN
来源：
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 1994年 / 4卷 / 04期
关键词：
COMPUTATIONAL GEOMETRY; PATTERN RECOGNITION; DELAUNAY TRIANGULATION; RELATIVE NEIGHBORHOOD GRAPH; BETA-SKELETON; GABRIEL GRAPH;
D O I：
10.1016/0925-7721(94)90018-3
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A very simple linear-time algorithm for constructing the relative neighborhood graph RNG(V) for a finite set V of points in the plane from the Delaunay triangulation of V is presented. It is extended to include the construction of the so called beta-skeletons (generalization of RNG(V)) in the spectrum 1 less-than-or-equal-to beta less-than-or-equal-to 2 in linear time from the Delaunay triangulation under the metric L(p) for 1 < p < infinity if beta = 2 or p = 2.
引用
收藏
页码：199 / 208
页数：10
相关论文
共 50 条
  • [1] A linear-time construction of the relative neighborhood graph within a histogram
    Lingas, A
    Mukhopadhyay, A
    [J]. ALGORITHMS AND DATA STRUCTURES, 1995, 955 : 228 - 238
  • [2] Incremental Construction of the Delaunay Triangulation and the Delaunay Graph in Medium Dimension
    Boissonnat, Jean-Daniel
    Devillers, Olivier
    Hornus, Samuel
    [J]. PROCEEDINGS OF THE TWENTY-FIFTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SCG'09), 2009, : 208 - 216
  • [3] The greedy triangulation can be computed from the Delaunay triangulation in linear time
    Levcopoulos, C
    Krznaric, D
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1999, 14 (04): : 197 - 220
  • [4] Splitting a Delaunay Triangulation in Linear Time
    [J]. Algorithmica, 2002, 34 : 39 - 46
  • [5] Splitting a Delaunay triangulation in linear time
    Chazelle, B
    Devillers, O
    Hurtado, F
    Mora, M
    Sacristán, V
    Teillaud, M
    [J]. ALGORITHMICA, 2002, 34 (01) : 39 - 46
  • [6] A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance
    Aksoy, Sinan G.
    Nowak, Kathleen
    Young, Stephen J.
    [J]. SIAM JOURNAL ON MATHEMATICS OF DATA SCIENCE, 2019, 1 (04): : 647 - 666
  • [7] A Linear-time Graph Kernel
    Hido, Shohei
    Kashima, Hisashi
    [J]. 2009 9TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, 2009, : 179 - 188
  • [8] DELAUNAY TRIANGULATIONS IN TIN CREATION - AN OVERVIEW AND A LINEAR-TIME ALGORITHM
    TSAI, VJD
    [J]. INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SYSTEMS, 1993, 7 (06): : 501 - 524
  • [9] Delaunay triangulation of imprecise points in linear time after preprocessing
    Loffler, Maarten
    Snoeyink, Jack
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2010, 43 (03): : 234 - 242
  • [10] AN ALMOST LINEAR-TIME ALGORITHM FOR GRAPH REALIZATION
    BIXBY, RE
    WAGNER, DK
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1988, 13 (01) : 99 - 123
12345