Hierarchical morse complexes for piecewise linear 2-manifolds
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Geometry and topology for mesh generation
Geometry and topology for mesh generation
Topological persistence and simplification
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Streaming computation of Delaunay triangulations
ACM SIGGRAPH 2006 Papers
A fast all nearest neighbor algorithm for applications involving large point-clouds
Computers and Graphics
TerraStream: from elevation data to watershed hierarchies
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
I/O-efficient construction of constrained delaunay triangulations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Generating raster DEM from mass points via TIN streaming
GIScience'06 Proceedings of the 4th international conference on Geographic Information Science
TerraNNI: natural neighbor interpolation on a 3D grid using a GPU
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
In this paper we demonstrate that the technology required to perform typical GIS computations on very large high-resolution terrain models has matured enough to be ready for use by practitioners. We also demonstrate the impact that high-resolution data has on common problems. To our knowledge, some of the computations we present have never before been carried out by standard desktop computers on data sets of comparable size.