Results 1 
6 of
6
An Approach to Improve StripBased Multiresolution Schemes
, 2004
"... Triangle strips have been widely used for static mesh representation because they are optimal for rendering. This primitive reduces the number of vertices sent to the graphics pipeline and the storage costs. We present an approach to improve multiresolution models that takes this connectivity proper ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Triangle strips have been widely used for static mesh representation because they are optimal for rendering. This primitive reduces the number of vertices sent to the graphics pipeline and the storage costs. We present an approach to improve multiresolution models that takes this connectivity property into account. Our model uses strips both in the data structure and in the rendering stage. It also offers the following features: it is easily implemented, and is efficient and fast.
and R.Trueba. Octreebased viewdependent triangle meshes
 Proc. of WSCG’07, 15th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision
, 2007
"... In this paper we present a new technique for viewdependent LOD rendering, where the scene is represented through an octree model from which we can obtain a triangle mesh corresponding to a viewdependent LOD. We present the construction of this octree model and the visualization algorithm that gene ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
In this paper we present a new technique for viewdependent LOD rendering, where the scene is represented through an octree model from which we can obtain a triangle mesh corresponding to a viewdependent LOD. We present the construction of this octree model and the visualization algorithm that generates onthefly a closed and valid triangle mesh for each frame of the visualization. This visualization algorithm is a depthfirst traversal algorithm which also allows to reuse triangles from one frame to another.
Iterative Stripification of a Triangle Mesh: Focus on Data Structures
, 2004
"... In this paper we describe the data structure and some implementation details of the tunneling algorithm for generating a set of triangle strips from a mesh of triangles. The algorithm uses a simple topological operation on the dual graph of the mesh, to generate an initial stripification and iterati ..."
Abstract
 Add to MetaCart
In this paper we describe the data structure and some implementation details of the tunneling algorithm for generating a set of triangle strips from a mesh of triangles. The algorithm uses a simple topological operation on the dual graph of the mesh, to generate an initial stripification and iteratively rearrange and decrease the number of strips. Our method is a major improvement of a proposed one originally devised for both static and continuous levelofdetail (CLOD) meshes and retains this feature. The usage of a dynamical identification strategy for the strips allows us to drastically reduce the length of the searching paths in the graph needed for the rearrangement and produce loopfree triangle strips without any further controls and postprocessing, while requiring a more sophisticated implementation to manage the search and undo operations.
Partitioning Meshes into Strips using the Enhanced
"... Triangle meshes are the most used representations for threedimensional objects, and triangle strips are the organization of triangles mostly used for efficient rendering. Since the problem of optimal strip decomposition of a given mesh is NPcomplete, many different heuristics have been proposed; t ..."
Abstract
 Add to MetaCart
(Show Context)
Triangle meshes are the most used representations for threedimensional objects, and triangle strips are the organization of triangles mostly used for efficient rendering. Since the problem of optimal strip decomposition of a given mesh is NPcomplete, many different heuristics have been proposed; the quality of the stripification is usually evaluated using standard indicators as the total number of strips, the number of isolated triangles, the cache coherence, the number of swap vertices. In this paper we present the Enhanced Tunnelling Algorithm (ETA), a stripification method working on the dual graph of a mesh. The method uses a sophisticated mechanism of dynamical update of identifiers, guided by a localization procedure. The algorithm adopts a modified search approach in the dual graph that accelerated the convergence speed of the algorithm. The ETA results efficient and robust, able to deal with datasets of any dimension. The quality of the stripification is remarkable: very few strips (not seldom just one), no isolated triangles, good cache coherence (ACMR value), good number of vertex per triangle. 1.
Rewriting rules for the dual graph of a stripified CLOD mesh
"... A triangular mesh is the piecewise linear approximation of a sampled or analytical surface, when each patch is a triangle. The connectivity of the mesh can be easily represented using its dual graph. Each node of such a graph has at most three incident edges; if the surface is homeomorphic to a sphe ..."
Abstract
 Add to MetaCart
A triangular mesh is the piecewise linear approximation of a sampled or analytical surface, when each patch is a triangle. The connectivity of the mesh can be easily represented using its dual graph. Each node of such a graph has at most three incident edges; if the surface is homeomorphic to a sphere, each node has exactly three incident edges. Several triangular meshes, representing the same surface, with an increasing number of triangles are a representation of the surface at different levels of detail (LOD). When the number of triangles from one LOD to another varies continuously we call such a structure a continuous level of detail (CLOD) approximation of the surface. Given a CLOD data structure we can extract, at each level, the mesh representing the surface and derive its dual graph. If we group the triangles forming each mesh in strips, to accelerate their rendering, we should use two colors for the dual graph’s edges to distinguish between the edges linking nodes belonging to the same strip or not. The main goal of this paper is to present a set of rules to recolor the dual graph of the mesh when passing from one LOD to the next and back. The operations used to change the mesh are a Vertex Split (VS) when the resolution increases, and an Edge Collapse (EC) when the resolution decreases. We can, then, use a local topological analysis to derive the rules allowing to recolor the graph, and to show that, under certain conditions, the recoloring is optimal. This allows to keep effectively an optimal triangle strip structure over the mesh, while changing its resolution. 1.