De Floriani, L and Puppo, E., 1995. Hierarchical Triangulation for Multiresolution Surface Description. ACM Transactions on Graphics, 14(4), pp.363-411. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
NEXUS - Distributed Data Management Concepts for Location.. - Volz, Sester (2000) (Correct)
....as by computer graphics and computer vision specialists. Depending on the data type, different generalization operators are possible. In image processing, raster maps are transferred to image pyramids simply by smoothing operations [1] 3D surfaces are tackled with mesh simplification algorithms [4], 15] Such approaches mainly take geometry into account, assuming that the biggest objects are also the important ones. In order to include also semantics, other approaches have to be used. Here, model based or knowledge based techniques can reflect the importance and the behaviour of the ....
De Floriani, L., Puppo, E.: Hierarchical Triangulation for Multiresolution Surface Description. ACM Transactions on Graphics 14(4) (1995) 363-411
From Polyline to Polygon via XOR tree - Baldazzi, Paoluzzi (1996) (Correct)
....applications of computer graphics (e.g. in GIS systems and architecturalCAD) it is necessary to transform a closed and possibly unconnected polyline into the plane polygon it is boundary of. This transformation is often accomplished by computing a (possiblyconstrained) Delaunay s triangulation [2, 4, 3]. Boolean operations over BSP trees strongly resemble to CSG trees, so that the Naylor s approach to Booleans [5] can certainly be considered a mixed BSP CSG. So, the transformation discussed here can also be considered a boundary to CSG mapping. In [7, 8] Shapiro and Vossler discusses several ....
De Floriani, L., and Puppo, E. Hierarchical triangulation for multiresolution surface description. Computer Graphics, 14(4) 363-411, Oct. 1995. Proc. of ACM Siggraph'95.
Dimension-Independent BSP (2): Boundary to Interior Mapping - Claudio Baldazzi Alberto (1997) (Correct)
....applications of computer graphics(e.h in GIS and architectural CAD) it is often necessary to transform a closed and possibly unconnected polyline into the plane polygon it is boundaryof. This transformation is often accomplished by 1 computing a (possibly constrained) Delaunay triangulation [3, 7, 6]. A boundary to CSG local XOR formula for generating a Boolean expression of a simple, i. non self intersecting, 2D polygon was given by Guibas et al. in[5] Such approach only works with simple polygons because it is necessary to decide if any vertex is either convex or concave. Dobkin et al. ....
De Floriani, L., and Puppo, E. Hierarchical triangulation for multiresolution
Real-Time Terrain Surface Extraction at Variable Resolution - Guedes (1997) (Correct)
....much higher accuracy, what makes the problem of interactive three dimensional visualization very hard. When displaying a terrain model, it is easy to observe that regions far from the observer need not to be rendered with the same level of detail as the closer ones. Henceforth, many researchers [DeFPup95] [CiPuSc95] deBDob95] Bert 95] have proposed polygonal models that offer efficient storage of terrain data at different levels of detail and linear time extraction of the surface. Those models are called multiresolution. A multiresolution terrain model may support extraction of the terrain ....
....are given. 2. Related work Several multiresolution models have been proposed on the literature, see [DeFlo 96a] for an interesting survey. Most of them only support extraction at a constant resolution. Here we will focus on the models that are suitable for variable resolution extraction. In [DefPup95], the Hierarchical Delaunay Triangulation (HDT) is proposed. An Hierarchical Delaunay Triangulation is a matching tree structure that supports an explicit multiresolution representation of irregularly distributed terrain data. Each level, except the root, is built from the previous level by ....
- De Floriani, L., Puppo,E., "Hierarchical Triangulation for Multiresolution Surface Description", ACM Transactions on Graphics 14, 4:363-411.
A Prototype System for Light Propagation in Terrains - Stamm, Eidenbenz, Beck.. (1998) (Correct)
....while high resolution can be used close to the point of interest. A multiresolution surface model is effective if its storage cost does not introduce a serious overhead with respect to a simple surface model at the maximum precision, and if its access and manipulation algorithms are kept efficient [2]. A hierarchical triangulation (HT) is a data structure containing different triangulations of the same terrain, where from top to bottom of the hierarchy the resolution increases. We call these triangulations hierarchical because one triangle or a small set of adjacent triangles is subdivided ....
L. de Floriani and E. Puppo. Hierarchical triangulation for multiresolution surface description. ACM Transactions on Graphics, 14(4):363--411, Oct. 1995.
Reconstruction of Topologically Correct and.. - Cignoni.. (2000) (10 citations) (Correct)
....applications by simply adopting a ray casting solution together with a more sophisticated reconstruction filter. The technique proposed in the paper adopts a regular mesh refinement approach. The idea of improving the quality of a mesh by [recursively] applying a sequence of local refinements [6] is not new. Many approaches based on the refinement of triangle meshes have been proposed: to construct adaptive piecewise linear representations of implicit surfaces [11, 32] to reconstruct adaptively the surface of three dimensional objects from multiple range images, by starting from an ....
....based on edge midpoint and center point evaluation (rule B) ideal iso surface on a discrete number of sampling points. There are many different criteria to select the set of sampling points. A possible choice may be to select the midpoints of the edges (which leads to quaternary subdivision [6]) For each of these points p i , we evaluate the distance between p i and a corresponding point p 0 i on the ideal iso surface SK . If this distance is greater than the selected accuracy threshold , we classify point p i as a splitting point. The current face is then refined by inserting the ....
[Article contains additional citation context not shown here]
L. De Floriani and E. Puppo. Hierarchical triangulation for multiresolution surface description. ACM Transactions on Graphics, 14(4):363--411, October 1995.
A Unified Approach for Hierarchical Adaptive Tesselation .. - Velho, de Figueiredo.. (2000) (2 citations) (Correct)
....necessary information for sorting the transformations into a progressive sequence within two levels of refinement. 7. 2 Exploiting the Hierarchical Structure The hierarchical structure generated by the algorithm is suitable for virtually all applications of multiresolution and progressive meshes [De Floriani and Puppo 1995; Certain et al. 1996; Hoppe 1996] Moreover, it is more powerful and flexible because it combines the advantages of both these data structures into a single representation. Examples of modeling and visualization applications that can use our hierarchical mesh structure are: tolerance ....
De Floriani, L. and Puppo, E. 1995. Hierarchical triangulation for multiresolution surface description geometric design. ACM Transactions on Graphics 14, 4 (Oct.), 363--411.
Interpolation of Triangle Hierarchies - Friedrich, Polthier, Schmies (1998) (1 citation) (Correct)
....combinatorially the two children are considered as subsets of its parent, but in the geometric realization the children need not be part of its parent triangle. There exist different types of hierarchical triangulations, and a good overview and formal concept are given in DeFloriani and Puppo [6]. The concept of vertex based hierarchies is described in detail in Hoppe s papers [8] and [9] In numerics, it is essential to ensure stability of a sequence of triangulations or a hierarchical triangulation, i.e. to bound the angles inside all triangles uniformly from below. In visualization, ....
L. DeFloriani and E. Puppo. Hierarchical triangulation for multiresolution surface description. ACM Transactions on Graphics, 14(4), 1995.
Interpolation of Triangle Hierarchies - Friedrich, Polthier, Schmies (1998) (1 citation) (Correct)
....combinatorially the two children are considered as subsets of its parent, but in the geometric realization the children need not be part of its parent triangle. There exist different types of hierarchical triangulations, and a good overview and formal concept are given in DeFloriani and Puppo [6]. The concept of vertex based hierarchies is described in detail in Hoppe s papers [8] and [9] In numerics, it is essential to ensure stability of a sequence of triangulations or a hierarchical triangulation, i.e. to bound the angles inside all triangles uniformly from below. In visualization, ....
L. DeFloriani and E. Puppo. Hierarchical triangulation for multiresolution surface description. ACM Transactions on Graphics, 14(4), 1995.
Compression And Progressive Transmission Of Three-Dimensional.. - Zhuang (1998) (2 citations) (Correct)
....representation implicitly provides LOD which allows automatic switching among different resolutions. ffl View dependent display. Areas of interest can be rendered with high resolution while others use low resolution. The performance of a multiresolution model depends on its storage cost [FP95] it is effective if there is no serious overhead compared to the storage cost of the original single resolution surface in the sense of compressed data stream. Mesh decomposition represents any given mesh by a coarse level mesh along with a series of details. Its reverse procedure, mesh ....
L. D. Floriani and E. Puppo. Hierarchical triangulation for multiresolution surface description. ACM Transactions on Graphics, 14(4):363--411, 1995.
Progressive Compression and Transmission of Arbitrary.. - Category Research (Correct)
....and details are recorded in some compact way; the second phase provides flexible resolution degree and may change the mesh topology while the details are still expressed in some economical way. De Floriani et al. propose a general framework for multiresolution hierarchical representation [7] where the refinement step is the replacement of a portion of the mesh. Due to the high storage cost they experiment a variation of the data structure that improves storage efficiency and allows progressive transmission [8] 2.1 Review of the Layering Scheme The Layering Scheme proposed in [2, ....
L. D. Floriani and E. Puppo. Hierarchical triangulation for multiresolution surface description. ACM Transactions on Graphics, 14(4):363--411, 1995.
Triangle-based Multi-Resolution Models for Height Fields - De Floriani, Magillo (2002) Self-citation (De floriani) (Correct)
No context found.
De Floriani, L., and E. Puppo. Hierarchical triangulation for multiresolution surface description. ACM Trans. on Computers, 14(4):363{ 411, 1995.
Selective Refinement of Surface Meshes: Data Structures .. - De Floriani, Magillo.. Self-citation (De floriani Puppo) (Correct)
No context found.
De Floriani, L., Puppo, E., 1995, Hierarchical Triangulation for Multiresolution Surface Description, ACM Transactions on Graphics, 14, 4, pp. 363-411.
Multiresolution Mesh Representation: Models and Data Structures - De Floriani, Magillo (2002) Self-citation (De floriani) (Correct)
No context found.
L. De Floriani and E. Puppo. Hierarchical triangulation for multiresolution surface description. ACM Trans. on Graphics 14(4), 1995, 363--411.
Triangle-based Multi-Resolution Models for Height Fields - De Floriani, Magillo (2002) Self-citation (De floriani) (Correct)
No context found.
De Floriani, L., and E. Puppo. Hierarchical triangulation for multiresolution surface description. ACM Trans. on Computers, 14(4):363{ 411, 1995.
Regular and Irregular Multi-Resolution Terrain Models: a.. - De Floriani, Magillo (2002) Self-citation (De floriani) (Correct)
No context found.
L. De Floriani and E. Puppo. Hierarchical triangulation for multiresolution surface description. ACM Transactions on Computers, 14(4):363--411, 1995.
Multiresolution Mesh Representation: Models and Data Structures - De Floriani, Magillo (2002) Self-citation (De floriani) (Correct)
....in [72] for triangle meshes uses a subdivision rule which re nes a triangle by inserting up to four vertices: one in the interior of and one on each of the three edges of . A triangulation re ning is generated according to prede ned subdivision patterns (see Figure 21) The model in [21] re nes a triangle by inserting an arbitrary number of vertices lying either inside or on its edges, and by then computing a Delaunay triangulation. An extension to three dimensions, using a Delaunay tetrahedralizazion, has also been proposed [3] e) c) d) a) b) Fig. 21. Prede ned ....
L. De Floriani and E. Puppo. Hierarchical triangulation for multiresolution surface description. ACM Trans. on Graphics 14, 1995, 363-411.
VARIANT: A System for Terrain Modeling at Variable.. - De Floriani, Magillo, Puppo (2000) (2 citations) Self-citation (De floriani Puppo) (Correct)
....nested regular grids (Duchaineau et al. 1997; Evans et al. 2000; Gomez and Guzman, 1979; variant.tex; 14 09 2000; 10:46; p. 4 VARIANT 5 Lindstrom et al. 1996; Lounsbery et al. 1997; Samet, 1990; Samet, 1990) or through TINs (Cignoni et al. 1997; de Berg and Dobrindt, 1995; De Floriani, 1989; De Floriani and Puppo, 1995; Hamann, 1994; Klein and Stra er, 1996; Hoppe, 1998; Maheshwari et al. 1997; Taubin et al. 1998; Xia et al. 1997) Regular multiresolution models have the main advantage of requiring simple data structures, since geometry and connectivity can be represented implicitly. On the other hand, ....
L. De Floriani and E. Puppo. Hierarchical triangulation for multiresolution surface description. ACM Transactions on Computers, 14(4):363-411, 1995.
Implementation Of Progressive Transmission Algorithms For - Vector Map Data (2004) (Correct)
No context found.
De Floriani, L and Puppo, E., 1995. Hierarchical Triangulation for Multiresolution Surface Description. ACM Transactions on Graphics, 14(4), pp.363-411.
Voxel Column Culling: - Occlusion Culling For (Correct)
No context found.
DeFloriani, L. and E. Puppo.: Hierarchical Triangulation for Multiresolution Surface Descriptions. ACM Transactions on Graphics, vol. 14, October, 1995.
Terrain Decimation through Quadtree Morphing - Cline, Egbert (2001) (1 citation) (Correct)
No context found.
L. DeFloriani and E. Puppo. Hierarchical Triangulation for Multiresolution Surface Description. ACM Transactions on Graphics, 14(4), October, 1995.
Hierarchical Representation and Coding of Surfaces.. - Kompatsiaris.. (2001) (Correct)
No context found.
L. De Floriani and E. Puppo, "Hierarchical triangulation for multiresolution surface description," ACM Trans. Graph., vol. 14, no. 4, pp. 363--411, 1995.
DStrips: Dynamic Triangle Strips for Real-Time Mesh.. - Shafae, Pajarola (2003) (2 citations) (Correct)
No context found.
L. De Floriani and E. Puppo. Hierarchical triangulation for multiresolution surface description. ACM Transactions on Graphics, 14(4):363--411, 1995.
Efficient Implementation of Real-Time View-Dependent.. - Pajarola, DeCoro (2004) (Correct)
No context found.
L. De Floriani and E. Puppo, "Hierarchical Triangulation for Multiresolution Surface Description," ACM Trans. Graphics, vol. 14, no. 4, pp. 363-411, 1995.
Polyhedral Surfaces of Constant Mean Curvature - Polthier (2002) (Correct)
No context found.
L. DeFloriani and E. Puppo. Hierarchical triangulation for multiresolution surface description. ACM Transactions on Graphics, 14(4):363411, October 1995.
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