Output sensitive construction of the delaunay triangulation of points lying in two planes

被引：6
|
作者：
Boissonnat, JD
Cerezo, A
Devillers, O
Teillaud, M
机构：
[1] INRIA,F-06902 SOPHIA ANTIPOLIS,FRANCE
[2] UNIV NICE,F-06034 NICE,FRANCE
来源：
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | 1996年 / 6卷 / 01期
关键词：
Delaunay triangulation; output-sensitive algorithms; Voronoi diagram; hyperbolic distance; computerized tomography;
D O I：
10.1142/S0218195996000022
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we propose an algorithm to compute the Delaunay triangulation of a set S of n points in 3-dimensional space when the points lie in 2 planes. The algorithm is output-sensitive and optimal with respect to the input and the output sizes. Its time complexity is O(n log n + t), where t is the size of the output, and the extra storage is O(n).
引用
收藏
页码：1 / 14
页数：14
相关论文
共 50 条
  • [21] A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces
    Dominique Attali
    Jean-Daniel Boissonnat
    Discrete & Computational Geometry, 2004, 31 : 369 - 384
  • [22] A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces
    Attali, D
    Boissonnat, JD
    DISCRETE & COMPUTATIONAL GEOMETRY, 2004, 31 (03) : 369 - 384
  • [23] A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations
    Gary L. Miller
    Donald R. Sheehy
    Discrete & Computational Geometry, 2014, 52 : 476 - 491
  • [24] Delaunay triangulation of imprecise points in linear time after preprocessing
    Loffler, Maarten
    Snoeyink, Jack
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2010, 43 (03): : 234 - 242
  • [25] A new approach for categorizing pig lying behaviour based on a Delaunay triangulation method
    Nasirahmadi, A.
    Hensel, O.
    Edwards, S. A.
    Sturm, B.
    ANIMAL, 2017, 11 (01) : 131 - 139
  • [26] ON SIMULTANEOUS CONSTRUCTION OF VORONOI DIAGRAM AND DELAUNAY TRIANGULATION BY PHYSARUM POLYCEPHALUM
    Shirakawa, Tomohiro
    Adamatzky, Andrew
    Gunji, Yukio-Pegio
    Miyake, Yoshihiro
    INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2009, 19 (09): : 3109 - 3117
  • [27] Efficient minimum spanning tree construction without Delaunay triangulation
    Zhou, H
    Shenoy, N
    Nicholls, W
    INFORMATION PROCESSING LETTERS, 2002, 81 (05) : 271 - 276
  • [28] Efficient minimum spanning tree construction without Delaunay triangulation
    Zhou, H
    Shenoy, N
    Nicholls, W
    PROCEEDINGS OF THE ASP-DAC 2001: ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE 2001, 2001, : 192 - 197
  • [29] 3D Delaunay triangulation of 1 billion points on a PC
    Lo, S. H.
    FINITE ELEMENTS IN ANALYSIS AND DESIGN, 2015, 102-103 : 65 - 73
  • [30] AN ALGORITHM OF SEMI-DELAUNAY TRIANGULATION OF POINTS CLOUD SCATTERED ON A SURFACE
    Kucwaj, Jan
    COMPUTER SCIENCE-AGH, 2014, 15 (03): : 329 - 348
12345