Andrews, D. Simplifying terrain models and measuring terrain model accuracy. Tech. rep., University of British Columbia Computer Science Department, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Computational Geometry of Hydrology Data in Geographic.. - McAllister (1999) (Correct)
....according to their vertical distance from the TIN since it is a convenient and easily computed value. As vith the polyline simplification of Section 2. 4, ve could apply other criteria, such as changes in terrain curvature or the change in volume belov the terrain vith the addition of a point [3]. Hovever, these other criteria are often more expensive to compute after each insertion to the TIN. Most TINs use a Delaunay triangulation to define the triangular faces since the triangulation avoids small angles in its triangles. Since the triangulation is indepen dent of the actual ....
D. S. Andrews. Simplifying terrain models and measuring terrain model accuracy. Technical Report TR-96-05, University of British Columbia, 1996.
Selecting Independent Vertices for Terrain Simplification - Jünger, Snoeyink (Correct)
....information and choses vertices of low degree, is included in the experiments for reference. Oblivious heuristics consider only the present triangulation and not the triangulation that will result from deletion of a vertex. We considered ve variations: The Average Normal heuristic (ANH) [And96] computes the negative of the length of the average of unit normal vectors to the faces surrounding a vertex. This value lies between Gamma1 and 0, with Gamma1 indicating a AEat neighborhood. SZL92] also weights each normal by the area of its face to minimize the importance of small ridges. We ....
....an independent set from an assignment of importance values, it is natural to use a greedy strategy go through the vertices in order of importance and take a vertex if none of its neighbors have been taken. As described, this would involve sorting vertices by importance or using a priority queue [And96]. In fact, we can compute the result of this greedy strategy in linear time without sorting. The only data structure needed is a mark bit for each vertex; initially all vertices are unmarked. Using, say, depth rst search, visit every vertex of the triangulation. If a vertex v is unmarked, then ....
[Article contains additional citation context not shown here]
D. S. Andrews. Simplifying terrain models and measuring terrain model accuracy Msc. Thesis. Tech. Report 9605, Dept. of CS, UBC, 1996.
Progressive TINs: Algorithms and Applications - Maheshwari, Morin, Sack (1997) (10 citations) (Correct)
No context found.
Andrews, D. Simplifying terrain models and measuring terrain model accuracy. Tech. rep., University of British Columbia Computer Science Department, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC