Batched Multi Triangulation

Abstract

The Multi Triangulation framework (MT) is a very general approach for managing adaptive resolution in triangle meshes. The key idea is arranging mesh fragments at different resolution in a Directed Acyclic Graph (DAG) which encodes the dependencies between fragments, thereby encompassing a wide class of multiresolution approaches that use hierarchies or DAGs with predefined topology. On current architectures, the classic MT is however unfit for real-time rendering, since DAG traversal costs vastly dominate raw rendering costs. In this paper, we redesign the MT framework in a GPU friendly fashion, moving its granularity from triangles to precomputed optimized triangle patches. The patches can be conveniently tri-stripped and stored in secondary memory to be loaded on demand, ready to be sent to the GPU using preferential paths. In this manner, central memory only contains the DAG structure and CPU workload becomes negligible. The major contributions of this work are: a new out-of-core multiresolution framework, that, just like the MT, encompasses a wide class of multiresolution structures; a robust and elegant way to build a well conditioned MT DAG by introducing the concept of V -partitions, that can encompass various state of the art multiresolution algorithms; an efficient multithreaded rendering engine and a general subsystem for the external memory processing and simplification of huge meshes.

Reality-based 3D documentation of natural and cultural heritage sites—techniques, problems, and examples

“…Indeed, model sizes (both in geometry and texture) are increasing at faster rate than computer hardware and software advances, and this limits the possibilities for interactive and real-time visualization of the 3D results. Due to the generally large amount of data and its complexity, the rendering of large 3D models is done with a multi-resolution approach displaying large textured meshes with different levels of detail and simplification approaches (Luebke et al 2002;Cignoni et al 2005;Dietrich et al 2007). …”

3DHOP: 3D Heritage Online Presenter

“…Following this work, a number of so-called multi-resolution and multitriangulation solutions have been proposed. They mainly differ on the multiresolution representation [33,34], on the support of color encoding [35], or on other aspects (a survey on these method was provided by Zhang et al [36]). Alternative research tracks are devoted to other types of data, like point clouds [37].…”

“…We implemented one of those multiresolution schemes, called Nexus [34] (http://www.vcg.isti.cnr.it/nexus/), on top of the SpiderGL library [1] (http://www.vcg.isti.cnr.it/spidergl/), obtaining very good performance. Nexus is a multiresolution visualization library supporting interactive rendering of very large surface models.…”

Segment-based tetrahedral meshing and rendering

“…Recently, several algorithms have been published that use segment-based hierarchies to render huge polygonal models interactively [Cignoni et al 2004c;Yoon et al 2004;Cignoni et al 2005]. They can be further optimized by taking special vertex orderings into account that consider the cache behaviour of modern memory hierarchies [Yoon et al 2005].…”

“…One of the fastest algorithms exploits the concepts of multi triangulations [Cignoni et al 2005] which is described detailled in the following section because our multi resolution data structure is basically a multi triangulation.…”