TerraNNI: Natural Neighbor Interpolation on 2D and 3D Grids Using a GPU

被引:7
作者
Agarwal, Pankaj K. [1 ]
Beutel, Alex [2 ]
Molhave, Thomas [3 ]
机构
[1] Duke Univ, Box 90129, Durham, NC 27708 USA
[2] Carnegie Mellon Univ, 5000 Forbes Ave, Pittsburgh, PA 15232 USA
[3] SCALGO, Aabogade 40, DK-8200 Aarhus N, Denmark
关键词
Performance; Algorithms; LIDAR; massive data; GIS; natural neighbor interpolation; GPU;
D O I
10.1145/2786757
中图分类号
TP7 [遥感技术];
学科分类号
081102 ; 0816 ; 081602 ; 083002 ; 1404 ;
摘要
With modern focus on remote sensing technology, such as LiDAR, the amount of spatial data, in the form of massive point clouds, has increased dramatically. Furthermore, repeated surveys of the same areas are becoming more common. This trend will only increase as topographic changes prompt surveys over already scanned areas, in which case we obtain large spatiotemporal datasets. An initial step in the analysis of such spatial data is to create a digital elevation model representing the terrain, possibly over time. In the case of spatial (spatiotemporal, respectively) datasets, these models often represent elevation on a 2D (3D, respectively) grid. This involves interpolating the elevation of LiDAR points on these grid points. In this article, we show how to efficiently perform natural neighbor interpolation over a 2D and 3D grid. Using a graphics processing unit (GPU), we describe different algorithms to attain speed and GPU-memory tradeoffs. Our experimental results demonstrate that our algorithms not only are significantly faster than earlier ones but also scale to much bigger datasets that previous algorithms were unable to handle.
引用
收藏
页数:31
相关论文
共 37 条
  • [1] Agarwal PK, 2005, LECT NOTES COMPUT SC, V3669, P355
  • [2] THE INPUT OUTPUT COMPLEXITY OF SORTING AND RELATED PROBLEMS
    AGGARWAL, A
    VITTER, JS
    [J]. COMMUNICATIONS OF THE ACM, 1988, 31 (09) : 1116 - 1127
  • [3] A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces
    Attali, D
    Boissonnat, JD
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2004, 31 (03) : 369 - 384
  • [4] The Quickhull algorithm for convex hulls
    Barber, CB
    Dobkin, DP
    Huhdanpaa, H
    [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1996, 22 (04): : 469 - 483
  • [5] Boissonnat J.-D., 2000, P 16 ANN S COMP GEOM, P223
  • [6] CGAL Development Team, 2014, CGAL COMP GEOM ALG L
  • [7] Danner A., 2007, GIS 07 P 15 ANN ACM, P1, DOI DOI 10.1145/1341012.1341049
  • [8] Danner Andrew, 2012, 20 INT C ADV GEOGR I, P299, DOI [10.1145/2424321.2424360, DOI 10.1145/2424321.2424360]
  • [9] De Berg Mark, 1997, COMPUTATIONAL GEOMET
  • [10] 3-DIMENSIONAL ALPHA-SHAPES
    EDELSBRUNNER, H
    MUCKE, EP
    [J]. ACM TRANSACTIONS ON GRAPHICS, 1994, 13 (01): : 43 - 72