Improved 2D mass-spring-damper model with unstructured triangular meshes

In this paper, we investigate both the visual realism and the physical accuracy of the 2D mass-spring-damper (MSD) model with general unstructured triangular meshes for the simulation of rigid cloth. For visual realism, the model should, at a minimum, bend smoothly under pure bending load conditions. For physical accuracy, it should bend approximately the same amount and shape as dictated by continuum mechanics. By matching the 2D MSD model with an elastic plate, we obtain a series of constraints on the parameters of the model. We find that for a 2D unstructured MSD model, it is necessary to apply preloads on the springs for accurate modeling of bending resistance. By simultaneously applying the constraints for both visual realism and physical accuracy, we can optimize the parameters of the model to enhance its fidelity. The simulation shows that the deformation of the optimized MSD model with preload is very close to the result obtained by the finite element method (FEM) under either point load condition or pressure load condition. With a much smaller computational burden compared with FEM, the optimized MSD model is especially suitable for real time haptic applications.     

Shape exploration of 3D heterogeneous models based on cages

Shape exploration of 3D heterogeneous models is essential for special effects in 3D animation and games. As heterogeneous models have different numbers of vertices and different topological structures,the mapping between source and target model may be ambiguous for deformation transfer. We propose a new framework for heterogeneous model shape exploration based on cages, which provides a feasible and fast solution to this open problem. Using a public cage as an intermediate medium, the deformation of the source models can be denoted as the position changing of the cage. When applying the cage change to the target model, rough deformation transfer can be achieved. After an optimization and interpolation to generate the explored shape of the heterogeneous target model, animation can be acquired. Our method is not only suitable for triangle meshes, but also for quadrilateral meshes or any other type of meshes. We demonstrate the validity of our scheme by a series of shape exploration experiments with different models.     

基于二维轮廓序列的膝关节三维重建

提出了一个基于二维轮廓序列的四面体网格生成方法,用于医学图像三维几何模型重构.该方法首先对各选定的断层图像提取目标轮廓并做分支匹配等处理,然后生成各轮廓内部平面域的三角网格,最后在相邻断层之间根据三角网格连接四面体单元.该方法被应用于人体膝关节虚拟手术系统的三维几何建模,得到的膝部股骨模型包含494个节点和2 046个四面体单元,膝部脂肪模型包含2 854个节点和14011个四面体单元,这些模型被成功地应用于膝关节手术仿真,从而证明了该三维模型重建方法的可行性和有效性.     

A novel progressive modelling algorithm for 3D models

This paper presents a novel progressive modelling algorithm for 3D models to generate progressive meshes. We propose a forest clustering simplification method to generate a progressive mesh of a model with the efficient and smooth transitions between meshes at different resolutions. Our approach can also integrate and balance the appearance attributes to preserve features of a model in the simplification process. We have applied our progressive modelling technique to several different kinds of input models and results show that our approach only generates efficient and smooth progressive meshes of a given model, but also preserves the features. The proposed method is very suitable for progressive transmission and real‐time rendering of 3D models in networked virtual environments. Copyright © 2002 John Wiley & Sons, Ltd.     

3D textured model encryption via 3D Lu chaotic mapping

In the emerging Virtual/Augmented Reality (VR/AR) era, three dimensional (3D) content will be popularized just as images and videos today. The security and privacy of these 3D contents should be taken into consideration. 3D contents contain surface models and solid models. Surface models include point clouds, meshes and textured models. Previous work mainly focused on the encryption of solid models, point clouds and meshes. This work focuses on the most complicated 3D textured model. We propose a 3D Lu chaotic mapping based encryption method for 3D textured models. We encrypt the vertices, polygons, and textures of 3D models separately using the 3D Lu chaotic mapping. Then the encrypted vertices, polygons and textures are composited together to form the final encrypted 3D textured model. The experimental results reveal that our method can encrypt and decrypt 3D textured models correctly. Furthermore, typical statistic and brute-force attacks can be resisted by the proposed method.     

一种3维模型的网格盲水印算法

3维模型的数字水印是数字水印研究的热点之一,鲁棒性、嵌入可读性水印和盲检测是3维模型数字水印的难点所在。从增强3维模型数字水印的鲁棒性出发,提出一种基于局部几何空间的3维模型数字水印算法,它以模型三角网格顶点在其一环邻居顶点为所确定的局部几何空间;通过改变顶点在局部几何空间中的位置来嵌入水印,并以调整其间的夹角来嵌入水印序列的索引,而调整顶点与圆心的距离来嵌入较高比特的二进制数值。本文算法在水印检测时,无需原始模型,且可抵抗平移、旋转、均匀缩放、顶点乱序、剪切及网格简化等攻击。实验结果表明, 该水印算法具有很好的鲁棒性、可读水印的不可感知性和盲水印检测的优势。     

3D CAD model matching from 2D local invariant features

The matching of particular types of CAD models to existing physical models can provide invaluable support to the process of CAD design and reuse. To meet the demand for fast and robust algorithms to detect predefined models in database, an local invariant model matching approach is proposed in this paper. It first maps the 3D CAD model to 2D principal image plane by its first two principal components, and then finds affine invariant key points in the 2D image. The CAD model matching problem is implemented as key points matching. Experimental results show the proposed 3D model retrieval method performs fairly well in retrieving similar models from a database of 3D CAD models.     

STL rapid prototyping bio-CAD model for CT medical image segmentation

This paper presents a simple process to construct 3D rapid prototyping (RP) physical models for computer tomography (CT) medical images segmentation. The use of stereolithography (STL) triangular meshes as a basis for RP construction facilitates the simplification of the process of converting CT images to an RP model. This is achieved by constructing the STL triangular meshes directly from data points without having to draw the curve model first. The grey prediction algorithm is used to sort contour point data in each layer of the medical image. The contour difference detection operation is used to sequence the points for each layer. The 3D STL meshes are then constructed by this proposed layer-by-layer sequence meshes algorithm to build the STL file. Once this STL file is saved, a 3D physical model of the medical image can be fabricated by RP manufacturing, and its virtual reality model can also be presented for visualization. CT images of a human skull and femur bone were used as the case studies for the construction of the 3D solid model with medical images. The STL models generated using this new methodology were compared to commercial computer-aided design (CAD) models. The results of this comparative analysis show that this new methodology is statistically comparable to that of the CAD software. The results of this research are therefore clinically reliable in reconstructing 3D bio-CAD models for CT medical images.     

复杂表面物体3D模型的获取方法

提出了一种从真实物体中获得其3D模型的方法.该方法通过TOF- Camera获得原始的点云数据,在对点云数据进行三角化、分割、滤波去噪等处理后得到部分物体模型,然后再应用ICP(迭代最近点)算法对其进行配准.配准过程中为了节省内存,删掉重叠的冗余数据.最后对生成的数据进行网格重建,得到完整的网格模型.实验表明该方法能较为快速地获取真实物体的3D模型,显著提高TOF相机获取数据的质量.     

基于图像的树类物体的三维重建

树类物体的三维重建一直是人们很感兴趣的一个研究内容。该文利用基于图像的建模技术，实现了一个从双视点图像重建树木三维模型的系统，提出了一个自动获取树木二维主干骨架的方案，实现了二维骨架点的对应关系求解，三维骨架点的重建、简化及树表面网格的生成。实验结果表明该文提出的方法确实可行、有效。     

基于多尺度CNN-RNN的单图三维重建网络

现有基于深度学习的三维重建算法主要从深度网络的单一层进行特征获取,二维图像特征提取不完整,造成三维重建效果不理想。为提高三维重建模型的精度及准确度,充分利用二维图像细节特征,有效转换为三维网络,提出一种基于多尺度CNN-RNN的单图三维重建网络。模型网络主要由三部分组成：二维编码器、转换器及三维编码器。模型借鉴高斯金字塔模型,构建多尺度网络,保留二维图像不同尺度上的特征值,通过RNN将其转换为三维特征。模型使用公共的ShapeNet数据集进行训练和测试,通过前后对比,发现使用多尺度特征提取的方法,模型具有更好的鲁棒性。与现有方法进行对比,本模型在飞机、柜子、汽车、显示器、灯、音响、沙发等模型的三维重建中拥有更好的重建效果。     

Towards locally and globally shape-aware reverse 3D modeling

The process of re-creating CAD models from actual physical parts, formally known as digital shape reconstruction (DSR) is an integral part of product development, especially in re-design. While, the majority of current methods used in DSR are surface-based, our overarching goal is to obtain direct parameterization of 3D meshes, by avoiding the actual segmentation of the mesh into different surfaces. As a first step towards reverse modeling physical parts, we extract (1) locally prominent cross-sections (PCS) from triangular meshes, and (2) organize and cluster them into sweep components, which form the basic building blocks of the re-created CAD model. In this paper, we introduce two new algorithms derived from Locally Linear Embedding (LLE) (Roweis and Sauk, 2000 [3]) and Affinity Propagation (AP) (Frey and Dueck, 2007 [4]) for organizing and clustering PCS. The LLE algorithm analyzes the cross-sections (PCS) using their geometric properties to build a global manifold in an embedded space. The AP algorithm, then clusters the local cross sections by propagating affinities among them in the embedded space to form different sweep components. We demonstrate the robustness and efficiency of the algorithms through many examples including actual laser-scanned (point cloud) mechanical parts.     

Customizing 3D garments based on volumetric deformation

Improving the reusability of design results is very important for garment design industry, since designing an elegant garment is usually labor-intensive and time-consuming. In this paper, we present a new approach for customizing 3D garment models. Our approach can transfer garment models initially dressed on a reference human model onto a target human model. To achieve this goal, firstly a spatial mapping between the two human models is established with the shape constraints of cross-sections. Secondly, the space around the clothed reference human model is tetrahedralized into five tetrahedral meshes each of which either can be worked dependently with its adjacent ones or can be worked independently. The clothed reference human model is parametrically encoded in the tetrahedral meshes. Thirdly, these tetrahedral meshes are deformed by fitting the reference human model onto the target human model by using constrained volumetric graph Laplacian deformation. The updated garment models are finally decoded from the deformed tetrahedral meshes. As a result, the updated garment models are fitted onto the target human model. Experiments show that our approach performs very well and has the potential to be used in the garment design industry.     

从表面重构的体数据实现3维网格剖分

目的 针对有限元分析中网格最优化问题,提出一种改进的生成四面体网格的自组织算法。方法 该算法首先应用几何方法将三角形表面模型重新构造成规定大小的分类体数据,同时由该表面模型建立平衡八叉树,计算用以控制网格尺寸的3维数组;然后将体数据转换成邻域内不同等值面的形态一致的边界指示数组;结合改进的自组织算法和相关3维数据的插值函数,达到生成四面体网格的目的。结果 实验结果对比表明,该方法能够生成更高比例的优质四面体,增强了对扁平面体的抑制能力,同时很好地保证了边界的一致。结论 在对封闭的3维表面网格进行有限元建模时,本文算法为其提供了一种有效、可靠的途径。     

一种保留特征的网格简化和压缩递进传输方法

针对数字博物馆中三维藏品网络传输及传输过程中藏品特征保留的需要,提出了一种保留拓扑及纹理特征的网格简化方法,在三角形折叠简化算法的基础之上,通过引入边界三角形和色异三角形等概念,对误差矩阵的计算和误差控制方法进行了改进,保留了原始模型的几何边界和纹理属性等特征信息;并结合递进网格和压缩编码,构造了基于八叉树编码的递进网格文件,从而实现了基于网络的三维模型递进传输系统.     

3D optimization of average torque of electrostatic micromotors

The paper presents a technique to optimize electrostatic micromotors. The finite element technique is combined with different types of optimization strategies, one of them, a version of the evolution strategy is discussed. It further involves an automated generation of 3D meshes where the dimensions and rotor positions of the motor models can be chosen arbitrarily. It also involves constructing equivalent circuit models for the electrostatic motors. Both, the automated 3D mesh generation and the construction of the equivalent circuit model are treated in detail in this paper. The possibilities of producing powerful tools in the field of optimization are described, but also some warnings and limitations concerning the automated optimization are mentioned.     

Automatic Cage Building with Quadric Error Metrics

Modern computer graphics applications usually require high resolution object models for realistic rendering.However,it is expensive and difficult to deform such models in real time.In order to reduce the computational cost during deformations,a dense model is often manipulated through a simplified structure,called cage,which envelops the model.However,cages are usually built interactively by users,which is tedious and time-consuming.In this paper,we introduce a novel method that can build cages automatically for both 2D polygons and 3D triangular meshes.The method consists of two steps:1) simplifying the input model with quadric error metrics and quadratic programming to build a coarse cage;2) removing the self-intersections of the coarse cage with Delaunay partitions.With this new method,a user can build a cage to envelop an input model either entirely or partially with the approximate vertex number the user specifies.Experimental results show that,compared to other cage building methods with the same number of vertex,cages built by our method are more similar to the input models.Thus,the dense models can be manipulated with higher accuracy through our cages.     

Computer graphics techniques for modeling page turning

Turning the page is a mechanical part of the cognitive act of reading that we do literally unthinkingly. Interest in realistic book models for digital libraries and other online documents is growing. Yet, actually producing a computer graphics implementation for modeling page turning is a challenging undertaking. There are many possible foundations: two-dimensional models that use reflection and rotation; geometrical models using cylinders or cones; mass-spring models that simulate the mechanical properties of paper at varying degrees of fidelity; and finite-element models that directly compute the actual forces within a piece of paper. Even the simplest methods are not trivial, and the more sophisticated ones involve detailed physical and mathematical models. The variety, intricacy, and complexity of possible ways of simulating this fundamental act of reading is virtually unknown. This article surveys computer graphics models for page turning. It combines a tutorial introduction that covers the range of possibilities and complexities with a mathematical synopsis of each model in sufficient detail to serve as a basis for implementation. Illustrations are included, which are generated through our implementations of each model. The techniques presented include geometric methods (both two- and three-dimensional), mass-spring models with varying degrees of accuracy and complexity, and finite-element models. We include a detailed comparison of experimentally determined computation time and subjective visual fidelity for all the methods discussed. The simpler techniques support convincing real-time implementations on ordinary workstations. We also address the question of whether such techniques are worthwhile in practice by describing results from a user study that compared the performance of a page-turning book model with HTML and PDF presentations of the same material—and with physical books. This demonstrates that the book model has many advantages over conventional document formats.     

Review of coupling methods for non-matching meshes

Domain decomposition is nowadays a common way to speed up complex computations. However, the discrete meshes used in the different domains do not have to match at their common interface, especially when different physical fields are involved such as in fluid-structure interaction computations. Exchange of information over this interface is therefore no longer trivial. In this paper six methods that can deal with the information transfer between non-matching meshes in fluid-structure interaction computations are compared for different criteria. This is done for analytical test cases as well as a quasi-1D fluid-structure interaction problem. Two methods based on radial basis functions, one with compact support and one using thin plate splines, are favoured over the other methods because of their high accuracy and efficiency.     

基于边折叠和质点-弹簧模型的网格简化优化算法

通过边折叠实现网格曲面简化,提出了保持曲面特征的边折叠基本规则,引入边折叠顺序控制因子λ,给出了折叠点坐标获取方法,简化过程中网格边长度趋于均匀．在曲面简化基础上,利用质点-弹簧模型优化网格形状．将网格顶点邻域参数化到二维域上,在质点-弹簧模型中引入约束弹簧,约束调整网格顶点,并逆映射到三维原始曲面上,局部优化网格顶点的相邻网格;调整曲面上所有网格顶点,在全局上优化网格形状．在曲面简化优化过程中,建立原始模型曲面和简化优化后曲面之间的双向映射关系;曲面的网格顶点始终在原始模型表面上滑动,并以双向Hausdorff距离衡量、控制曲面间的形状误差．应用实例表明：文中算法稳定、高效,适合于任意复杂的二维流形网格．