Amitabh Varshney, Pankaj K. Agarwal, Frederick P. Brooks Jr., William V. Wright, and Hans Weber. Generating Levels of Detail for Large-Scale Polygonal Models. Technical Report CS-1995-20, Dept of Computer Science, Duke University, August 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Fast Rendering Techniques for Interactive Walkthroughs of Large .. - Lorenzetto (2001) (Correct)
....manifold topology, and use a form of merging called edge collapse or edge contraction. In these algorithms only two vertices sharing an edge are collapsed at each operation. Finally Garland describes a multiresolution technique he calls a meta method [5] simpli cation envelopes. Varshney et al. [16] use this approach to simpli cation. They provide a global error guarantee on the distance the approximated model is from the original. They do this by o setting the original surface both outwards and inwards, de ning an envelope. By producing an approximation de ned within this envelope an ....
Amitabh Varshney, Pankaj K. Agarwal, Frederick P. Brooks Jr., William V. Wright, and Hans Weber. Generating Levels of Detail for Large-Scale Polygonal Models. Technical Report CS-1995-20, Dept of Computer Science, Duke University, August 1995.
Scale-Space Events For The Generalization Of 3D-Building Data - Mayer (2000) (1 citation) (Correct)
.... like in (Popovic and Hoppe, 1997) Examples for recent approaches to simplify surfaces and to generate a LOD description which try to balance mathematical soundness, speed, and quality are (Garland and Heckbert, 1997) where short edges are contracted but also close by points are merged and (Varshney et al. 1995) where so called offset surfaces (parallel surfaces with distance ) guarantee, that the approximation is closer to the original than . In (Schmalstieg, 1996) an approach to produce LOD for VRML 1, the predecessor of VRML 97, based on octree clustering is presented. Common to all the ....
Varshney, A., Agarwal, P., Brooks, F., Wright, W. and Weber, H., 1995. Generating Levels of Detail for Large-Scale Polygonal Models. Technical Report CS-1995-20, Department of Computer Science, Duke University, USA.
Selecting Independent Chains on a Triangulated 2-Manifold - Cheng, Poon (Correct)
....and retriangulating the hole. And edge contraction [2, 3, 4, 5, 6] is by contracting an edge to a vertex recursively. The most well known algorithm is the quadric error metric edge contraction proposed by Garland and Heckbert [2] which is efficient and have high quality output. Patch decimation [12, 13] is a technique to de 240 CCCG 2000, Fredericton, New Brunswick Session C7 stroy a set of triangular faces and retriangulate or remesh the hole(s) incurred. Junger and Snoeyink [1] investigated a method of selecting an independent set of vertices to be deleted, while trying to preserve terrain . ....
A. Varshney, P.K. Agarwal, F.P. Brooks, W.V. Wright, and H. Weber. Generating Levels of Detail for Large-Scale Polygonal Models. Technical Report, Dept. of CS, Duke U., Aug. 1995. CS-1995-20. http://www.cs.duke.edu/department.html#techrept.
Survey of Polygonal Surface Simplification Algorithms - Heckbert, Garland (1997) (109 citations) (Correct)
....algorithm can simplify a model with about n=90,000 vertices to m=5,000 vertices in 3 to 5 minutes on an IBMRS6000. Varshney 94. Using visibility techniques from computational geometry, Varshney developed a patch decimation algorithm for simplifying orientable triangulated manifolds with boundary [127, 126]. The method has bounded error. Instead of simplifying in a fast, greedy manner, as most other decimation methods do, it is much more brute force, exhaustively testing to find the largest triangle to insert on each pass. First, the input surface is offset inwards and outwards by a tolerance ....
Amitabh Varshney, Pankaj K. Agarwal, Frederick P. Brooks, Jr., William V. Wright, and Hans Weber. Generating levels of detail for large-scale polygonal models. Technical report, Dept. of CS, Duke U., Aug. 1995. CS-1995-20, http://www.cs.duke.edu/ department.html#techrept.
A fast Visualization System for Adaptive Grids - Kurka (1998) (1 citation) (Correct)
....Maintaining a high interactive frame rate we mean a minimum of 7 frames per second places difficult constraints to many layers of a visualization system. A well known approach to achieve interactive visualization, even for very large data sets, are multiresolutional visualization methods [11]. These methods deal with controlling the resolution, or level of detail (LOD) at which objects are rendered. The selection of the object resolution depends to a high degree on the application field. For example, in a virtual reality environment distant objects that appear smaller on the screen ....
Amitabh Varshney, Pankaj K. Agarwal, Frederick P. Brooks Jr., William V. Wright, Hans Weber, "Generating Levels of Detail for Large-Scale Polygonal Models", Department of Computer Science, Duke University, North Carolina, CS-1995-20, 1995. 13 Reports of the SFB #Numerical and Symbolic Scienti#c
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