基于二维平行轮廓线的三维表面重建

研究了基于二维平行轮廓线的前列腺三维表现重建问题。采用Roberts边缘检测算子检测前列腺的边缘，提取其轮廓线。分析了BPL1算法在处理相信轮廓线无匹配部分时存在的缺陷。文章采用BPL1算法和相信轮廓线同步前进法相结合的方案被了前列腺表现的三维重建，给出了实验结果。实验表明重建的三维表面清晰、准确。     

Approximate development of trimmed patches for surface tessellation

This paper presents a method for constructing an auxiliary planar domain of triangulation for tessellating trimmed parametric surface patches. By minimizing a mapping error function, an approximate locally isometric mapping between a given trimmed parametric surface patch and its triangulation domain is constructed. In this way the shape of triangular elements on the triangulation domain is approximately preserved when mapped into three-dimensional space. We also provide an efficient method to achieve a good initial guess for the minimization of the mapping error function. Furthermore, our proposed method guarantees a homeomorphism between a triangulation domain and parametric space/given surface patch by robustly removing the possibility of self-intersection on the developed surface net. Practical application of the proposed algorithm can include the formation of ship hulls, ducts, shoes, clothing and automobile parts as well as the surface meshing procedure.     

基于凹凸顶点判定的简单多边形的三角剖分

本文提出了一种基于凹凸顶点判定的简单多边形的三角剖分,该算法首先计算简单多边形顶点的凹凸性,然后用环形追踪算法到一个三角剖分,最后通过局部变换得到一个较好的三角剖分。     

空间三角网格曲面的补洞方法

由三维扫描仪对文物表面进行扫描得到网格数据后，先提取出破洞的边界，利用破洞边界三角形的法矢信息将破洞边界上的点投影到一个平面上，形成一个二维多边形；然后基于该二维多边形各内角及各边长度在多边形内插入新的离散点，再将多边形内离散点三角网格化；最后用移动最小二乘近似法将破洞附近的点拟和成曲面，以此求出插入点的高度值，这样就得到了在三维空间中的网格数据。     

基于TIN的三维地质模型栅状图的可视化方法研究

三维地质模型的栅状图可视化方法研究是正确认识地质结构和构造复杂性的一种重要手段。本文提出一种栅状图生成方法:首先针对不规则散点数据,应用基于格网划分的自适应分割-合并算法进行Delaunay三角剖分,快速高效地实现了三维地层三角面片的曲面重建;在此基础上,对栅状图生成过程中需要进行的追踪三维体层剖切线、层间剖切线缝合等关键问题进行了探讨,并对其中的点定位算法进行了优化,有效提高了栅状图的生成效率。     

A new methodology to design multi-sensor networks for distributed large-volume metrology systems based on triangulation

Distributed Large-Volume Metrology (LVM) systems are mainly used for industrial applications concerning assembly and dimensional verification of large-sized objects. These systems generally consist of a set of network devices, distributed around the measurement volume, and some targets to be localized, in contact with the measured object's surface or mounted on a hand-held probe for measuring the points of interest. Target localization is carried out through several approaches, which use angular and/or distance measurements by network devices.This paper presents a new methodology to support the design of networks of devices, for distributed LVM systems based on triangulation (i.e., systems in which network devices perform angular measurements only). It is assumed that these systems use multi-sensor networks including two typologies of devices: some are accurate but expensive and other ones are less accurate but cheaper. The goal of the methodology is establishing a link between the following parameters: (i) density of network devices, (ii) mix between the two typologies of network devices, (iii) measurement uncertainty, and (iv) cost. The methodology allows to estimate the most appropriate density and mix between the two typologies of network devices, so that the distributed LVM system is conforming with the required measurement uncertainty and cost.The methodology relies on a large number of simulated experiments, defined and implemented using a dedicated routine; feasibility and practicality is tested by preliminary experiments on a multi-sensor photogrammetric system, developed at Politecnico di Torino—DIGEP.     

Embedding a triangular graph within a given boundary

Given a 3-vertex-connected triangular planar graph and an embedding of its boundary vertices, can the interior vertices be embedded to form a valid triangulation? We describe an algorithm which decides this problem and produces such an embedding if it exists.     

火炮内膛形廓在线光电检测技术

文章介绍了在火炮身管内膛加工中，应用激光准直原理和光三角测径原理对火炮内膛直线度和形廓进行实时自动检测的光电技术和设备。该设备的测量误差小于０．００５ｍｍ，实时检测结果可由计算机屏幕显示，并可由打印机记录输出。     

Efficient triangulation of simple polygons

This paper considers the topic of efficiently traingulating a simple polygon with emphasis on practical and easy-to-implement algorithms. It also describes a newadaptive algorithm for triangulating a simplen-sided polygon. The algorithm runs in timeO(n(1+t _o)) witht ₀<n. The quantityt ₀ measures theshape-complexity of thetriangulation delivered by the algorithm. More preciselyt ₀ is the number of obtained triangles contained in the triangulation that share zero edges with the input polygon and is, furthermore, related to the shape-complexity of theinput polygon. Although the worst-case complexity of the algorithm isO(n ²), for several classes of polygons it runs in linear time. The practical advantages of the algorithm are that it is simple and does not require sorting or the use of balanced tree structures. On the theoretical side, it is of interest because it is the first polygon triangulation algorithm where thecomputational complexity is a function of theoutput complexity. As a side benefit, we introduce a new measure of the complexity of a polygon triangulation that should find application in other contexts as well.