Automatic Surface Reconstruction from Point Sets in Space

In this paper an algorithm is proposed that takes as input a generic set of unorganized points, sampled on a real object, and returns a closed interpolating surface. Specifically, this method generates a closed 2-manifold surface made of triangular faces, without limitations on the shape or genus of the original solid. The reconstruction method is based on generation of the Delaunay tetrahedralization of the point set, followed by a sculpturing process constrained to particular criteria. The main applications of this tool are in medical analysis and in reverse engineering areas. It is possible, for example, to reconstruct anatomical parts starting from surveys based on TACs or magnetic resonance.     

An Interactive Approach to Point Cloud Triangulation

We present an interactive system for the generation of high quality triangle meshes that allows us to handle hybrid geometry (point clouds, polygons,. . .) as input data. In order to be able to robustly process huge data sets, we exploit graphics hardware features like the raster manager and the z-buffer for specific sub-tasks in the overall procedure. By this we significantly accelerate the stitching of mesh patches and obtain an algorithm for sub-sampling the data points in linear time. The target resolution and the triangle alignment in sub-regions of the resulting mesh can be controlled by adjusting the screen resolution and viewing transformation. An intuitive user interface provides a flexible tool for application dependent optimization of the mesh.     

Generating Consistent Motion Transition via Decoupled Framespace Interpolation

The framespace interpolation algorithm abstracts motion sequences as 1D signals, and interpolates between them to create higher dimension signals, with weights drawn from a user specified curve in a bounded region. We reformulate the algorithm to achieve motion-state based transition via dynamic warping of framespaces and automatic transition timing via framespace frequency interpolation. Basis motions displaying diverse coordination configurations between upper and lower body-halves, cannot be consistently corresponded at a macro level. We address this problem here, through decoupled blending of these halves to achieve true consistency , and eliminate accumulated phase differences via cosine phase warp functions. This generalization enables interpolation of motions with diverse coordinations between the upper and lower bodies.     

Efficient Algorithms for Computing Conservative Portal Visibility Information

The number of polygons in realistic architectural models is many more than can be rendered at interactive frame rates. Typically, however, due to occlusion by opaque surfaces (e.g., walls), only small fractions of such models are visible from most viewpoints. This fact is used in many popular methods for preprocessing visibility information which assume a scene model subdivided into convex cells connected through convex portals. These methods need to establish which cells or parts thereof are visible to a generalized observer located within each cell. The geometry of this information is termed a 'visibility volume' and its computation is usually quite complex. Conservative approximations of viewing volumes, however, are simpler and less expensive to compute. In this paper we present techniques and algorithms which permit the computation of conservative viewing volumes incrementally. In particular, we describe an algorithm for computing the viewing volumes for a given cell through a sequence of ' m ' portals containing a total of ' n ' edges in O m n time.     

Integrating Occlusion Culling and Levels of Detail through Hardly-Visible Sets

Occlusion culling and level-of-detail rendering have become two powerful tools for accelerating the handling of very large models in real-time visualization applications. We present a framework that combines both techniques to improve rendering times. Classical occlusion culling algorithms compute potentially visible sets (PVS), which are supersets of the sets of visible polygons. The novelty of our approach is to estimate the degree of visibility of each object of the PVS using synthesized coarse occluders. This allows to arrange the objects of each PVS into several Hardly-Visible Sets (HVS) with similar occlusion degree. According to image accuracy and frame rate requirements, HVS provide a way to avoid sending to the graphics pipeline those objects whose pixel contribution is low due to partial occlusion. The image error can be bounded by the user at navigation time. On the other hand, as HVS offer a tighter estimation of the pixel contribution for each scene object, it can be used for a more convenient selection of the level-of-detail at which objects are rendered. In this paper, we describe the new framework technique, provide details of its implementation using a visibility octree as the chosen occlusion culling data structure and show some experimental results on the image quality.     

Directional Discretized Occluders for Accelerated Occlusion Culling

We present a technique for accelerating the rendering of high depth-complexity scenes. In a preprocessing stage, we approximate the input model with a hierarchical data structure and compute simple view-dependent polygonal occluders to replace the complex input geometry in subsequent visibility queries. When the user is inspecting and visualizing the input model, the computed occluders are used to avoid rendering geometry which cannot be seen. Our method has several advantages which allow it to perform conservative visibility queries efficiently and it does not require any special graphics hardware. The preprocessing step of our approach can also be used within the framework of other visibility culling methods which need to pre-select or pre-render occluders. In this paper, we describe our technique and its implementation in detail, and provide experimental evidence of its performance. In addition, we briefly discuss possible extensions of our algorithm.     

约束四面体剖分和三维物体表面重建

该文提出了约束曲面和约束最大空球凸多面体的概念,在此基础上设计了一种在空间区域上做约束Delaunay四面体剖分的算法。该算法的基本思路是首先对空间区域进行约束最大空球凸多面体剖分,然后在各个约束最大空球凸多面体内部做Delaunay四面体剖分。利用约束Delaunay四面体剖分算法,该文进一步设计了一种三维物体表面重建算法。     

基于映射法和Delaunay方法的曲面三角网格划分算法

提出一种曲面三角网格划分算法,该算法在曲面参数域中生成Delaunay类型的网格,然后将其映射到空间曲面,为了抵消映射过程中变形的影响,采用空椭圆准则代替传统的空间准则,并给出椭圆的构造算法以及椭圆圆心的定位方法,这些方法充分考虑到映射变形和求解速度,实验结果表明,该算法生成满意的曲面网格,具有一定的应用价值。     

基于光学三角几何关系的三维表面重建方法

工业图像处理作为图像处理技术的工业应用,是自动化技术的发展方向之一.传统的二维图像处理已经在视觉检测系统中广泛应用.目前利用光学方法的三维数字化具有越来越重要的意义.在工业生产中,多种获取三维数据的途径得到应用.其中最重要的方法有立体视觉,条形光相位平移法和条形光格雷编码法.本文重点介绍这三种方法在视觉检测系统中的运用.所开发的系统实现了被测工件可视化,而且更容易地将三维图像集成到生产线中.     

基于Delaunay三角剖分和高斯小波函数插值的三维表面重建算法

在稀疏数据的三维表面重建中,通过插值的方法得到更为稠密的数据点是一个很重要的环节。该文在比较其它插值算法的基础上,提出了一种三维表面重建算法。该算法在对原始数据进行Delaunay三角剖分的基础上采用二维高斯小波函数插值,它不仅能有效地处理非均匀采样的三维稀疏数据,而且能克服其它插值算法中需要定义权重或估计参数的缺点。最终的实验结果验证了该算法的有效性和实用性。