基于手绘线条的三维模型雕刻

为了生成复杂模型表面的几何纹理,提出一种三维模型的高效雕刻方法.首先根据用户交互方式生成手绘线条,通过曲线细化操作确定手绘曲线经过的三维模型表面边点,并去除手绘曲线经过的模型三角面片,将去除部分经三角剖分成小三角面片之后再插入到原始模型中;然后计算三维模型上的顶点到手绘线条集的距离,确定三维模型上与手绘曲线集的距离小于等于特定纹理宽度的顶点,并根据用户选取的轮廓函数计算顶点平移距离以及平移方向;最后对三维模型上手绘线条附近的顶点进行平移,得到模型的雕刻效果.实验结果表明,该方法能够方便、高效地实现三维模型表面的线条雕刻效果.     

基于单幅图像的三维对称自由形体重建

为了方便快捷地重建出输入图像中的物体,基于单幅图像,提出一种利用二维手绘线画图重建生成三维对称自由形体的方法.在以单幅图像为背景的画布上,用户首先根据图像中的物体位置为待重建模型指定一个对称面;然后为确定了对称面的物体绘制出其各个子部分的手绘线条,每个子部分通常由4条手绘曲线表示,即1对对称曲线和1对非对称的一般曲线,对称曲线的深度坐标信息可以利用物体对称面信息进行计算,一般曲线的深度坐标信息则可以由同一子部分的三维对称构造曲线计算得到;利用恢复了深度信息的三维构造曲线,自由形体的每个部分可以分别由1对对称构造曲线和1对非对称构造曲线利用旋转混合方法生成其参数曲面,并离散化为三角网格表示;根据输入图像中物体的纹理信息进一步合成自由形体每一部分的表面纹理,最终得到三维物体.实验结果表明,该方法得到的三维自由形体具有较强的真实感.     

融合手绘风格的卡通角色动画生成方法

手绘风格的卡通动画具有灵活、自然、表现力强等特点.为了快速地创作体现手绘风格的卡通角色动画,提出一种基于多视点手绘图的动画生成方法.首先利用手绘图构建角色的三维网格和骨架子空间模型;然后结合姿态重建和微分域网格变形算法,创建一组与多视点手绘图相匹配的视点相关模型,以表达手绘风格;最后通过运动标注和启发式泛化算法将手绘风格融入输入的运动序列,使生成的动画既保留运动序列的原始特征,又体现手绘图的笔画风格.实验结果表明,该方法能够有效地生成体现手绘风格的卡通角色动画.     

一种基于三角形递归切分的三维军标绘制方法

针对三维战场仿真环境中三维军标的实时绘制问题,利用Bezier曲线的任意可分性,提出了一种新的基于三角形递归切分的三维动态军标通用绘制方法.首先,通过设置军标控制点自动生成二维军标图形;然后,对二维军标模型进行三角形递归切分并动态控制递归算法调用次数;最后,对每个特征点赋予高程值,从而生成并显示三维动态军标图形.实验结果表明,该算法在不同地形条件下应用于多种基本的三维军标中都能保持良好的匹配速度和匹配效果.该方法在保证通用性前提下可以满足军标标绘系统的实时性需求.     

三维复杂曲面的手绘生成方法

为便于用户在概念设计时快速进行三维形状设计,将变分隐式曲面表示与手绘草图相结合,提出一种三维复杂曲面的交互生成方法.该方法分别采用膨胀变换、曲线交叉变换和弯曲变换,将轮廓、截面和骨架等3种交互笔画扩展生成三维约束点,支持用户以手绘草图方式来控制生成三维曲面的形状;通过对变分隐式曲面函数的局部化来实现曲面混合,保证三维复杂曲面交互生成的实时性.实验结果表明:文中方法能生成多种不同形状的三维复杂曲面,可有效地支持三维复杂形状的"分而治之"构造过程.     

三维封闭三角网格孔洞边界识别算法

针对三维封闭三角网格模型的缺失实体孔洞,提出一种边界识别算法。以手绘曲线作为输入,结合轮廓线法得到目标孔洞的近似边界点集,生成连续的孔洞轮廓线。按照曲线点集并以孔洞轮廓线辅助搜索孔洞的上边界,根据上边界向下搜索得到孔洞的下边界。该算法可用于满足二维流形、可定向及封闭的三角网格模型上孔洞边界的定位,能够简化孔洞边界的定位过程,提高设计系统的易用性。     

二维手绘草图的非均匀α-B插值样条曲线表示的方法研究*

根据非均匀α-B插值样条曲线的一般形式,结合非均匀α-B插值样条曲线的形状调配方法,产生了一种新方法来解决二维手绘草图的表示问题。在二维草图中,研究了基于非均匀αB插值样条曲线的草图表示、草图生成、草图修改以及草图缩放的算法。这种表示方法模型统一,生成插值点的算法简单,适合分布式网络环境下的实时协作。表示后的草图缩放具有向量图缩放的优点,设计人员可以在缩放后的草图上进行形状调配。     

基于径向曲线与支持向量回归的颅骨修复方法

颅骨修复技术是对有缺损的颅骨补全对应的缺损部分,进而实现颅骨形状的完整性。针对高维颅骨数据,采用径向曲线来表示颅骨几何特征,结合最小二乘支持向量回归的方法构建颅骨修复模型。提取完整的三维颅骨模型的径向曲线,将其分为已有径向曲线和缺失径向曲线两部分作为训练样本,采用最小二乘支持向量回归统计模型复原出待修复颅骨的缺失径向曲线,进而合并生成待修复颅骨的完整径向曲线,通过迭代最近点算法将合并的颅骨径向曲线与颅骨统计模型进行匹配生成完整的三维颅骨模型。实验结果表明,该方法的平均误差达到6.834×10^-3,比主成分分析方法降低2.90倍,具有更好的修复效果。     

基于手绘花瓣的花朵建模方法

针对现有花朵建模方法形成的花瓣式样与形态单一的缺陷,提出一种基于手绘花瓣的交互式花朵建模方法。该方法首先根据手绘花瓣的轮廓图提取花瓣模型的二维控制点,然后通过弯曲控制函数得到花瓣的三维控制点,继而利用三维控制点构造三维花瓣模型,最后由经过真实感渲染的单个花瓣构建花朵。实验结果表明,与其他建模方法相比,该建模方法能够方便地生成各种裂瓣状花瓣的花朵且真实感更强。     

一种基于手绘的自由形体建模方法研究

提出了一种基于手绘的自由形体建模方法。通过平滑去噪、重采样、曲线拟合等操作,将输入的手绘笔画转化为均匀间隔的点序列,根据提取到的几何信息生成三维网格模型,并通过对模型进行光照渲染和纹理贴图完成具有特定形状的自由形体的绘制。实验结果表明,该方法能够简单快速地实现符合用户输入意图的三维形体建模。     

Sketching freeform meshes using graph rotation functions

We present a new approach for sketching free form meshes with topology consistency. Firstly, we interpret the given 2D curve to be the projection of the 3D curve with the minimum curvature. Then we adopt a topology-consistent strategy based on the graph rotation system, to trace the simple faces on the interconnecting 3D curves. With the face tracing algorithm, our system can identify the 3D surfaces automatically. After obtaining the boundary curves for the faces, we apply Delaunay triangulation on these faces. Finally, the shape of the triangle mesh that follows the 3D boundary curves is computed by using harmonic interpolation. Meanwhile our system provides real-time algorithms for both control curve generation and the subsequent surface optimization. With the incorporation of topological manipulation into geometrical modeling, we show that automatically generated models are both beneficial and feasible.     

一种基于拓扑连接图的三维模型检索方法

提出了一种基于分割技术的拓扑连接图构造方法。并用于三维模型检索．首先构造多层邻域计算用于度量每个三角片平坦度的信号值。根据这些信号值采用一种改进的分水岭方法把模型分割成不同的曲面片．然后利用这些曲面片之间的连接关系构造拓扑连接图．最后通过比较不同模型的拓扑连接图相似性来得到它们的匹配度。根据匹配度进行三维模型检索．     

Boundary analysis and geometric completion for recognition of interacting machining features

Features are the basic elements which transform CAD data into instructions necessary for automatic generation of manufacturing process plans. In this paper, a hybrid of graph-based and hint-based techniques is proposed to automatically extract interacting features from solid models. The graph-based hints generated by this approach are in geometrical and topological compliance with their corresponding features. They indicate whether the feature is 2.5D, floorless or 3D. To reduce the product model complexity while extracting features, a method to remove fillets existing in the boundary of a 2.5D feature is also proposed. Finally, three geometric completion algorithms, namely, Base-Completion, Profile-Completion and 3D-volume generation algorithms are proposed to generate feature volumes. The base-completion and profile-completion algorithms generate maximal volumes for 2.5D features. The 3D volume generation algorithm extracts 3D portions of the part.     

动态人脸表情合成的模型特征驱动算法综述

分析人脸模型的动态表情合成方法并依据它们内在特点进行分类描述。尽管这个领域已经存在较多文献,但是动态人脸表情合成仍然是非常活跃的研究热点。根据输出类型的不同,分类概览二维图像平面和三维人脸曲面上的合成算法。对于二维图像平面空间合成人脸表情主要有如下几种算法：主动表情轮廓模型驱动的人脸表情合成算法,基于拉普拉斯算子迁移计算的合成方法,使用表情比率图合成框架的表情合成算法,基于面部主特征点offset驱动的人脸表情合成算法,基于通用表情映射函数的表情合成方法和近来基于深度学习的表情合成技术。对于三维空间人脸合成则主要包括：基于物理肌肉模型的合成,基于形变的表情合成,基于三维形状线性回归的表情合成,基于脸部运动图的表情合成和近来基于深度学习的三维人脸表情合成技术。对以上每一种类别讨论它们的方法论以及其主要优缺点。本工作有望帮助未来研究者更好地定位研究方向和技术突破口。     

ITERATIVE AND RECURSIVE ALGORITHMS FOR TREE SEARCH AND PARTITION SEARCH OF THE LATTICE OF STRUCTURE MODELS

An important problem in reconstructability analysis, and modelling in general, is determination of the set of simplest models, all of which acceptably represent the information contained in a given overall system. Evaluation of these models depends on acceptability (semantic) criteria and structural criteria. Structural criteria determine whether one model is simpler than another. In this paper we assume the existence of acceptability criteria and mechanisms to determine if given models meet them. The general problem we solve is how to most efficiently generate the set of all models. We use these results to determine the set of simplest models that satisfy the acceptability criteria

The main results of the paper are: a procedural definition of a recursive Boolean lattice that is based on recursive partitioning of the set of models, a definition of a spanning tree of the lattice of models, and algorithms for non-duplicating generation and search of the lattice of models. The generation and search algorithms fall into two categories: (i) iterative and recursive algorithms that implement the definition of the spanning tree and use it to determine the set of simplest models; (ii) algorithms that implement recursive partition search of the lattice of models. Two algorithms for recursive partition search are given, one that applies the procedural definition of a recursive Boolean lattice to the full set of models, and one that first partitions the full set into C-Structure equivalence classes, and then applies the definition of the recursive Boolean lattice to the equivalence classes.     

Using multiple genetic algorithms to generate radar point-scatterermodels

This paper covers the use of three different genetic algorithms applied sequentially to radar cross-section data to generate point-scatterer models. The aim is to provide automatic conversion of measured 2D/3D data of low, medium, or, high resolution into scatterer models. The resulting models are intended for use in a missile-target engagement simulator. The first genetic algorithm uses multiple species to locate the scattering centers. The second and third algorithms are for model fine tuning and optimization, respectively. Both of these algorithms use nondominated ranking to generate Pareto-optimal sets of results. The ability to choose results from the Pareto sets allows the designer some flexibility in the creation of the model. A method for constructing compound models to produce full 4 π sr coverage is detailed. Example results from the model generation process are presented     

Finite element analysis of spiral strands with different shapes subjected to axial loads

In this paper a new mathematical geometric model of spiral one or two-layered oval wire strands are proposed and an accurate computational two-layered oval strand 3D solid model, which is used for a finite element analysis, is presented. The three dimensional curve geometry of wires axes in the individual layers of the oval strand consists of straight linear and helical segments. The present geometric model fully considers the spatial configuration of individual wires in the right and left hand lay strand. Derived geometric equations were used for the generation of accurate 3D geometric and computational models for different types of strands. This study develops 3D finite element models of two-layer spiral round, triangular and oval strands subjected to axial loads using ABAQUS/Explicit software. Accurate modelling and understanding of their mechanical behaviour is complicated due to the complex contact interactions and conditions that exist between individual spirally wound wires. Comparisons of predicted responses for the strands with different shapes and constructions are presented. Resultant stress and/or deformation behaviours are discussed.     

三维数字牙颌模型分析诊断系统设计

利用三维测量技术获取含咬合信息的数字牙颌模型,建立网格包围盒层次表示结构,并在其基础上实现网格单元快速拾取框架,结合特征提取算法,实现模型分析的常用功能;参考正常合数据库中的标准值生成初步诊断报表．应用该系统有助于提高正畸临床的诊断水平。     

三维表面模型的快速切割算法

讨论了一个三维表面模型的快速切割算法.由改进的MC(marching cubes)方法抽取、构成了连续曲面的分组信息以及构成曲面的三角面片的层次包围盒信息，并利用记录了上述信息的B+树模型,完成了三维表面模型的快速切割算法.讨论的算法通过充分发掘和利用MC算法中所隐含的三角面片的包围盒信息和物体各部分间的三维相关信息，在对三维表面模型进行切割计算时,可以快速定位交点，并且根据交点信息，不必遍历模型的所有三角面片，而直接完成对整个被切割模型的分割.研究背景是髋关节整型手术中平面手术刀及球面手术刀对髋关节的切