Parallel ODETLAP for terrain compression and reconstruction

We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data used for Geographical Information Systems (GIS). ODETLAP can be used to reconstruct a compressed elevation map, or to generate a dense regular grid from airborne Light Detection and Ranging (LIDAR) point cloud data. With previous methods, the time to execute ODETLAP does not scale well with the size of the input elevation map, resulting in running times that are prohibitively long for large data sets. Our algorithm divides the data set into patches, runs ODETLAP on each patch, and then merges the patches together. This method gives two distinct speed improvements. First, we provide scalability by reducing the complexity such that the execution time grows almost linearly with the size of the input, even when run on a single processor. Second, we are able to calculate ODETLAP on the patches concurrently in a parallel or distributed environment. Our new patch-based implementation takes 2 seconds to run ODETLAP on an 800 x 800 elevation map using 128 processors, while the original version of ODETLAP takes nearly 10 minutes on a single processor (271 times longer). We demonstrate the effectiveness of the new algorithm by running it on data sets as large as 16000 x 16000 on a cluster of computers. We also discuss our preliminary results from running on an IBM Blue Gene/L system with 32,768 processors.

[1]  Michael Griebel,et al.  Parallel multigrid in an adaptive PDE solver based on hashing and space-filling curves , 1999, Parallel Comput..

[2]  Richard Healey,et al.  Parallel Processing Algorithms for GIS , 1997 .

[3]  Jian Wang,et al.  Research On Cluster-Based Parallel GIS with the Example of Parallelization on GRASS GIS , 2007, Sixth International Conference on Grid and Cooperative Computing (GCC 2007).

[4]  Andrea Clematis,et al.  Parallel Processing on Heterogeneous Networks for GIS Applications , 1995, Int. J. Geogr. Inf. Sci..

[5]  Barbara Cutler,et al.  Surface compression using over-determined Laplacian approximation , 2007, SPIE Optical Engineering + Applications.

[6]  Barbara Cutler,et al.  Smugglers and border guards: the GeoStar project at RPI , 2007, GIS.

[7]  Michael M. Kazhdan,et al.  Streaming multigrid for gradient-domain operations on large images , 2008, ACM Trans. Graph..

[8]  Michael J. Mineter.  A software framework to create vector-topology in parallel GIS operations , 2003, Int. J. Geogr. Inf. Sci..

[9]  Bruce M. Gittings,et al.  Parallel Polygon Line Shading: The Quest for More Computational Power from an Existing GIS Algorithm , 1996, Int. J. Geogr. Inf. Sci..

[10]  Ben J Hicks,et al.  SPIE - The International Society for Optical Engineering , 2001 .

[11]  James E. Mower.  Developing Parallel Procedures for Line Simplification , 1996, Int. J. Geogr. Inf. Sci..

[12]  Andrea Clematis,et al.  High performance computing with geographical data , 2003, Parallel Comput..

[13]  Timothy A. Davis,et al.  Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2) , 2006 .

[14]  Shuichi Ichikawa,et al.  ITERATIVE DATA PARTITIONING SCHEME OF PARALLEL PDE SOLVER FOR HETEROGENEOUS COMPUTING CLUSTER , 2001 .