#17# Michael Garland and Paul Heckbert. Fast polygonal approximation terrains and height #elds. Technical Report CMU-CS-95-181, School Computer Sci- ence, Carnegie Mellon University, Sept  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Visibility Preserving Terrain Simplification - An.. - Ben-Moshe, Mitchell.. (2002) (Correct)
....with the corresponding original terrains. In Section 5 we report on some of our experiments with VPTS, as well as with three other software packages implementing simplification methods that were developed for the standard maximum vertical di#erence measure. These other packages are Terra ([10]) GcTin ( 15, 14] and QSlim ( 9] Our choice of packages is based on what has been readily available for download; we plan to extend our experiments to include other packages as well. In our experiments we consider several di#erent input scenes, each a detailed terrain representing a ....
....above) our method gives better results than the other methods for small terrain sizes. This of course is not surprising since the other methods were designed for a di#erent measure. Related work There has been extensive work on many aspects of terrain approximation; see Heckbert and Garland [10] for a survey. Visibility on terrains has also been studied extensively. Cohen Or and Shaked [4] give a simple linear time method to compute visibility from a point on a digital elevation map (DEM) De Floriani and Magillo [5] give methods to compute, in O(n log n) time, the horizon map from a ....
[Article contains additional citation context not shown here]
P. S. Heckbert and M. Garland. Fast polygonal approximation of terrains and height fields. Report CMU-CS-95-181, Carnegie Mellon University, 1995.
A Fast and Efficient Projection-Based Approach for Surface.. - Gopi, Krishnan (4 citations) (Correct)
....respect to a unique ( OE) projection plane. Since the perturbations in the data set due to noise are usually orthogonal to the projection plane, our algorithm is not affected by it. Traditional 3D reconstruction algorithms are not wellsuited to handle terrain data. So specialized algorithms [GH95] have been developed to exploit the simplicity of the input. However, in our algorithm, terrains are a special case that has a fixed projection plane. Further, in this case, we gain performance by avoiding the estimation of projection plane at each point. Specializing our algorithm: The 2D dexel ....
Michael Garland and Paul S. Heckbert. Fast polygonal approximation of terrains and height fields. Tech. report, CS Dept., Carnegie Mellon U., Sept. 1995.
Efficient Algorithms for Geometric Optimization - Agarwal, Sharir (1998) (9 citations) (Correct)
....the running time of their algorithm is O(n 8 ) which is rather high. Agarwal and Desiken [6] have shown that Clarkson s randomized algorithm can be extended to compute a polyhedral terrain of size O(k kOPT ) in expected time 2 ffi k kOPT ) The survey paper by Heckbert and Garland [144] summarizes most of the known results on terrain simplification. Instead of fixing and minimizing the size of the approximating surface, we can fix the size and ask for the best approximation. That is, given a polyhedral surface P and an integer k, compute an approximating surface Q that has at ....
P. S. Heckbert and M. Garland, Fast polygonal approximation of terrains and height fields, Report CMU-CS-95-181, Carnegie Mellon University, 1995.
Visibility Preserving Terrain Simplification - An.. - Ben-Moshe, Katz.. (Correct)
....with the corresponding original terrains. In Section 5 we report on some of our experiments with VPTS, as well as with three other software packages implementing simpli cation methods that were developed for the standard maximum vertical di erence measure. These other packages are Terra ([13]) GcTin ( 18, 17] and QSlim ( 12] In our experiments we consider several di erent input scenes, each a detailed terrain representing a geographic region. For each of the scenes T , we apply our new method, together with the three other methods for comparison, with various degrees of ....
....above) our method gives better results than the other methods for small terrain sizes. This of course is not surprising since the other methods were designed for a di erent measure. Related work There has been extensive work on many aspects of terrain approximation; see Heckbert and Garland [13] for a survey. Visibility on terrains has also been studied extensively. Cohen Or and Shaked [4] give a simple linear time method to compute visibility from a point on a digital elevation map (DEM) De Floriani and Magillo [6] give methods to compute, in O(n log n) time, the horizon map from a ....
[Article contains additional citation context not shown here]
P. S. Heckbert and M. Garland. Fast polygonal approximation of terrains and height elds. Report CMU-CS-95-181, Carnegie Mellon University, 1995.
Ordering points for incremental TIN construction from - James Little And (Correct)
.... height field by iteratively adding the farthest point from each face in a recursively constructed triangulated surface (Figure 1(b) Many techniques for approximating a surface, usually a terrain height field, begin by selecting points that are expected to be critical in the final approximation[GH95, PM92, HG97, Kum94, Hel90, CG87, DR93, JS98]. The approximation to the surface is improved by adding points to this initial triangulation. One particular method, FL79] finds in each triangle the point that is most poorly fit by the current triangulation and adds that point to the Delaunay triangulation[Lis94] of the points. Iteratively ....
Michael Garland and Paul S. Heckbert. Fast polygonal approximation of terrains and height fields. Technical Report CMU-CS-95-181, Carnegie Mellon U., September 1995.
Unknown - (Correct)
No context found.
#17# Michael Garland and Paul Heckbert. Fast polygonal approximation terrains and height #elds. Technical Report CMU-CS-95-181, School Computer Sci- ence, Carnegie Mellon University, Sept
Unknown - (Correct)
No context found.
#17# Michael Garland and Paul Heckbert. Fast polygonal approximation terrains and height #elds. Technical Report CMU-CS-95-181, School Computer Sci- ence, Carnegie Mellon University, Sept
Unknown - (Correct)
No context found.
#17# Michael Garland and Paul Heckbert. Fast polygonal approximation terrains and height #elds. Technical Report CMU-CS-95-181, School Computer Sci- ence, Carnegie Mellon University, Sept
Unknown - (Correct)
No context found.
#17# Michael Garland and Paul Heckbert. Fast polygonal approximation terrains and height #elds. Technical Report CMU-CS-95-181, School Computer Sci- ence, Carnegie Mellon University, Sept
Unknown - (Correct)
No context found.
#17# Michael Garland and Paul Heckbert. Fast polygonal approximation terrains and height #elds. Technical Report CMU-CS-95-181, School Computer Sci- ence, Carnegie Mellon University, Sept
Unknown - (Correct)
No context found.
#17# Michael Garland and Paul Heckbert. Fast polygonal approximation terrains and height #elds. Technical Report CMU-CS-95-181, School Computer Sci- ence, Carnegie Mellon University, Sept
Unknown - (Correct)
No context found.
#17# Michael Garland and Paul Heckbert. Fast polygonal approximation terrains and height #elds. Technical Report CMU-CS-95-181, School Computer Sci- ence, Carnegie Mellon University, Sept
Unknown - (Correct)
No context found.
#17# Michael Garland and Paul Heckbert. Fast polygonal approximation terrains and height #elds. Technical Report CMU-CS-95-181, School Computer Sci- ence, Carnegie Mellon University, Sept
Unknown - (Correct)
No context found.
#17# Michael Garland and Paul Heckbert. Fast polygonal approximation terrains and height #elds. Technical Report CMU-CS-95-181, School Computer Sci- ence, Carnegie Mellon University, Sept
Unknown - (Correct)
No context found.
#17# Michael Garland and Paul Heckbert. Fast polygonal approximation terrains and height #elds. Technical Report CMU-CS-95-181, School Computer Sci- ence, Carnegie Mellon University, Sept
Unknown - (Correct)
No context found.
#17# Michael Garland and Paul Heckbert. Fast polygonal approximation terrains and height #elds. Technical Report CMU-CS-95-181, School Computer Sci- ence, Carnegie Mellon University, Sept
Unknown - (Correct)
No context found.
#17# Michael Garland and Paul Heckbert. Fast polygonal approximation terrains and height #elds. Technical Report CMU-CS-95-181, School Computer Sci- ence, Carnegie Mellon University, Sept
Unknown - (Correct)
No context found.
#17# Michael Garland and Paul Heckbert. Fast polygonal approximation terrains and height #elds. Technical Report CMU-CS-95-181, School Computer Sci- ence, Carnegie Mellon University, Sept
Unknown - (Correct)
No context found.
#17# Michael Garland and Paul Heckbert. Fast polygonal approximation terrains and height #elds. Technical Report CMU-CS-95-181, School Computer Sci- ence, Carnegie Mellon University, Sept
Simplification and Compression of 3D Scenes - Rossignac (1997) (4 citations) (Correct)
No context found.
M. Garland and P. Heckbert, Fast Polygonal Approximation of Terrains and Height Fields, Research Report from CS Dept, Carnegie Mellon U, CMU-CS-95-181. {http://www.cs.cmu.edu/~garland/scape). Sept.1995.
Under consideration for publication in J. Functional.. - Guy Blelloch Hal (Correct)
No context found.
Garland, Michael, & Heckbert, Paul. 1995 (Sept.). Fast polygonal approximation of terrains and height elds. Tech. rept. CMU-CS-95-181. CS Dept, Carnegie Mellon U.
An Improved Refinement And Decimation - Method For Adaptive (2001) (Correct)
No context found.
Michael Garland and Paul S. Heckbert. Fast polygonal approximation of terrains and height fields. Technical Report CMU-CS-95181, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, September 1995.
An Efficient and Scalable Approach to Visualizing Sensor Networks - Goldin, Gao (2004) (Correct)
No context found.
Michael Garland and Paul S. Heckbert. Fast Polygonal Approximations of Terrains and Height Fields. Tech. Rep. CMU-CS-95-181, Carnegie Mellon University, Sept 1995.
Real-time Extendible-resolution Display of On-line Dynamic.. - Yefei He National (2002) (Correct)
No context found.
M. Garland and P. S. Heckbert. Fast polygonal approximation of terrains and height fields. Technical Report CMU-CS 95-181, Department of Computer Science, Carnegie Mellon University, 1995.
A Fast and Efficient Projection-Based Approach for Surface.. - Gopi, Krishnan (2002) (4 citations) (Correct)
No context found.
Michael Garland and Paul S. Heckbert. Fast polygonal approximation of terrains and height fields. Tech. report, CS Dept., Carnegie Mellon U., Sept. 1995.
First 50 documents Next 50
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