Two data structures for building tetrahedralizations

A polyhedral decomposition can be unambiguously described as the collection of four primitive elements (i.e., polyhedra, facets, edges, and vertices) plus their mutual adjacency relations. We consider here the problem of representing a specific kind of polyhedral decomposition, i.e., a tetrahedralization. We describe two different representations for a tetrahedralization. The first one can only model polyhedral decompositions with tetrahedral cells, while the second one is suitable for describing any partition of a volume into polyhedral cells with triangular facets. We present two sets of primitive Euler operators, which build and manipulate such representations while maintaining their topological integrity. The use of such operators is demonstrated in connection with two algorithms for building a Delaunay tetrahedralization, which show the different hedralization, which show the different uses of the two representations.     

Interactive Cuts through 3-Dimensional Soft Tissue

We describe a physically based framework for interactive modeling and cutting of 3-dimensional soft tissue that can be used for surgery simulation. Unlike existing approaches which are mostly designed for tensorproduct grids our methods operate on tetrahedral decompositions giving more topological and geometric flexibility for the efficient modeling of complex anatomical structures. We start from an initial tetrahedralization such as being provided by any conventional meshing method. In order to track topological changes tetrahedra intersected by the virtual scalpel are split into substructures whose connectivity follows the trajectory of the cut, which can be arbitrary. For the efficient computation of collisions between the scalpel and individual tetrahedra we devised a local collision detection algorithm. The underlying physics is approximated through masses and springs attached to each tetrahedral vertex and edge. A hierarchical Runge-Kutta iteration computes the relaxation of the system by traversing the designed data structures in a breadth-first order. The framework includes a force-feedback interface and uses real-time texture mapping to enhance the visual realism.     

基于分类体数据的四面体网格剖分算法

虚拟内窥手术是以真实病人的CT或者MRI扫描数据为基础，首先通过组织分割，在计算机内部建立起三维模型，然后通过虚拟现实技术来模拟窥镜手术全过程的一项技术。其中，人体器官的三维网格建模是该技术中一个十分重要的部分，为了准确地进行了人体器官三维网格建模，在对三维体数据进行组织分割的基础上，提出了一种由分类体数据直接建立三维四面体网格的方法，由于Delaunay三角剖分所产生的网格质量比较高，所以该方法沿用逐点插入算法的思想，以特征点的提取和Steiner布点为基础来生成四面体网格，并通过组织边界的判定准则和利用flip操作来恢复组织边界，实践证明，该方法所生成的网格具有自适应的网格密度。     

Occluder Shadows for Fast Walkthroughs of Urban Environments

This paper describes a new algorithm that employs image-based rendering for fast occlusion culling in complex urban environments. It exploits graphics hardware to render and automatically combine a relatively large set of occluders. The algorithm is fast to calculate and therefore also useful for scenes of moderate complexity and walkthroughs with over 20 frames per second. Occlusion is calculated dynamically and does not rely on any visibility precalculation or occluder preselection. Speed-ups of one order of magnitude can be obtained.     

Creating Architectural Models from Images

We present methods for creating 3D graphical models of scenes from a limited numbers of images, i.e. one or two, in situations where no scene co-ordinate measurements are available. The methods employ constraints available from geometric relationships that are common in architectural scenes – such as parallelism and orthogonality – together with constraints available from the camera. In particular, by using the circular points of a plane simple, linear algorithms are given for computing plane rectification, plane orientation and camera calibration from a single image. Examples of image based 3D modelling are given for both single images and image pairs.     

三维限定Delaunay四面体网格划分的算法

概述了三维限定Delaunay四面体网格划分算法的基本步骤.重点研究了初始四面体网格形成的算法,此算法采用了逐点插入法的一种--局部交换法.详细讨论了此算法的基本步骤,并分析比较了此算法相对于传统初始网格生成算法的优点.该算法易于实现,并通过不同的算例对网格生成进行了验证,获得了理想的结果.     

Generalized View-Dependent Simplification

We propose a technique for performing view-dependent geometry and topology simplifications for level-of-detail-based renderings of large models. The algorithm proceeds by preprocessing the input dataset into a binary tree, the view-dependence tree of general vertex-pair collapses. A subset of the Delaunay edges is used to limit the number of vertex pairs considered for topology simplification. Dependencies to avoid mesh foldovers in manifold regions of the input object are stored in the view-dependence tree in an implicit fashion. We have observed that this not only reduces the space requirements by a factor of two, it also highly localizes the memory accesses at run time. The view-dependence tree is used at run time to generate the triangles for display. We also propose a cubic-spline-based distance metric that can be used to unify the geometry and topology simplifications by considering the vertex positions and normals in an integrated manner.     

Interactive Multiresolution Editing of Arbitrary Meshes

This paper presents a novel approach to multiresolution editing of a triangular mesh. The basic idea is to embed an editing area of a mesh onto a 2D rectangle and interpolate the user-specified editing information over the 2D rectangle. The result of the interpolation is mapped back to the editing area and then used to update the mesh. We adopt harmonic maps for the embedding and multilevel B-splines for the interpolation. The proposed mesh editing technique can handle an arbitrary mesh without any preprocessing such as remeshing. It runs fast enough to support interactive editing and produces intuitive editing results.     

Multi-layered impostors for accelerated rendering

This paper describes the successful combination of pre-generated and dynamically updated image-based representations to accelerate the visualization of complex virtual environments. We introduce a new type of impostor, which has the desirable property of limiting de-occlusion errors to a user-specified amount. This impostor, composed of multiple layers of textured meshes, replaces the distant geometry and is much faster to draw. It captures the relevant depth complexity in the model without resorting to a complete sampling of the scene. We show that layers can be dynamically updated during visualization. This guarantees bounded scene complexity in each frame and also exploits temporal coherence to improve image quality when possible. We demonstrate the strengths of this approach in the context of city walkthroughs.