Progressive TINs: Algorithms and Applications (1997)
Cached
Download Links
- [cg.scs.carleton.ca]
- [cg.scs.carleton.ca]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings 5th ACM workshop on Advances in geographic information systems, Las Vegas |
| Citations: | 8 - 2 self |
BibTeX
@INPROCEEDINGS{Maheshwari97progressivetins:,
author = {Anil Maheshwari and Pat Morin and Jörg-Rüdiger Sack},
title = {Progressive TINs: Algorithms and Applications},
booktitle = {In Proceedings 5th ACM workshop on Advances in geographic information systems, Las Vegas},
year = {1997},
pages = {24--29}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Transmission of geographic data over the Internet, rendering at different resolutions /levels of detail, or processing at unnecessarily fine detail pose interesting challenges and opportunities. In this paper we explore the applicability to GIS of the notion of progressive meshes, introduced by Hoppe [13] to the field of computer graphics. In particular, we describe progressive TINs as an alternative to hierarchical TINs, design algorithms for solving GIS tasks such as selective refinement, point location, visibility or line of sight queries, isoline/contour line extraction and provide empirical results which show that our algorithms are of considerable practical relevance. Moreover, the selective refinement data structure and refinement algorithm solves a question posed by Hoppe.
