Fast Algorithms Using Minimal Data Structures for Common Topological Relationships in Large, Irregularly-spaced Topographic Data Sets

Digital terrain models (DTM) typically contain large numbers of postings, from hundreds of thousands to billions. Many algorithms that run on DTMs require topological knowledge of the postings, such as finding nearest neighbors, finding the posting closest to a chosen location, etc. If the postings are arranged irregu- larly, topological information is costly to compute and to store. This paper offers a practical approach to organizing and searching irregularly-space data sets by presenting a collection of efficient algorithms (O(N),O(lgN)) that compute important topological relationships with only a simple supporting data structure. These relationships include finding the postings within a window, locating the posting nearest a point of interest, finding the neighborhood of postings nearest a point of interest, and ordering the neighborhood counter-clockwise. These algorithms depend only on two sorted arrays of two-element tuples, holding a planimetric coordinate and an integer identification number indicating which posting the coordinate belongs to. There is one array for each planimetric coordinate (eastings and northings). These two arrays cost minimal overhead to create and store but permit the data to remain arranged irregularly.

Creating Useful Products From Connecticut's 2000 LIDAR Data Set JHR 08-314 Project 07-2

The State of Connecticut owns a LIght Detection and Ranging (LIDAR) data set that was collected in 2000 as part of the State’s periodic aerial reconnaissance missions. Although collected eight years ago, these data are just now becoming ready to be made available to the public. These data constitute a massive “point cloud”, being a long list of east-north-up triplets in the State Plane Coordinate System Zone 0600 (SPCS83 0600), orthometric heights (NAVD 88) in US Survey feet. Unfortunately, point clouds have no structure or organization, and consequently they are not as useful as Triangulated Irregular Networks (TINs), digital elevation models (DEMs), contour maps, slope and aspect layers, curvature layers, among others. The goal of this project was to provide the computational infrastructure to create a first cut of these products and to serve them to the public via the World Wide Web. The products are available at http://clear.uconn.edu/data/ct_lidar/index.htm.