任意连通多边形的靠接算法

本文根据平面多边形的几何特性，提出了一种行之有效的平面任意连通多边形靠接算法。该算法和多边形重叠检测算法结合可广泛用于以多边形为数学模型、机器人、多媒体、ＶＬＳＩ和ＣＡＤ／ＣＡＭ等众多领域的目标设计中。     

CURVE AND SURFACE INTERPOLATIONBY SUBDIVISION ALGORITHMS

ＣＵＲＶＥＡＮＤＳＵＲＦＡＣＥＩＮＴＥＲＰＯＬＡＴＩＯＮＢＹＳＵＢＤＩＶＩＳＩＯＮＡＬＧＯＲＩＴＨＭＳＲｕｉｂｉｎＱｕＣＵＲＶＥＡＮＤＳＵＲＦＡＣＥＩＮＴＥＲＰＯＬＡＴＩＯＮＢＹＳＵＢＤＩＶＩＳＩＯＮＡＬＧＯＲＩＴＨＭＳ￥ＲｕｉｂｉｎＱｕＡｂｓｔｒａ...     

平面任意区域自适应网格逼近

平面任意区域自适应网格逼近王建华（上海交通大学）王卫中（西南电力设计院）ＡＤＡＰＴＩＶＥＭＥＳＨＡＰＰＲＯＸＩＭＡＴＩＯＮＦＯＲＡＲＢＩＴＲＡＲＹＰＬＡＮＡＲＲＥＧＩＯＮＳ￥ＷａｎｇＪｉａｎｈｕａ（ＳｈａｎｇｈａｉＪｉａｏＴｏｎｇＵｎｉｖｅｒｓｉｔｙ...     

SMOOTH SURFACE INTERPOLATION OVER ARBITRARY TRIANGULATIONS BY SUBDIVISION ALGORITHMS

ＳＭＯＯＴＨＳＵＲＦＡＣＥＩＮＴＥＲＰＯＬＡＴＩＯＮＯＶＥＲＡＲＢＩＴＲＡＲＹＴＲＩＡＮＧＵＬＡＴＩＯＮＳＢＹＳＵＢＤＩＶＩＳＩＯＮＡＬＧＯＲＩＴＨＭＳＲｕｉｂｉｎＱｕＳＭＯＯＴＨＳＵＲＦＡＣＥＩＮＴＥＲＰＯＬＡＴＩＯＮＯＶＥＲＡＲＢＩＴＲＡＲＹＴＲ...     

ICARCV＇96 FOURTH INTERNATIONAL CONFERENCE ON CONTROL，AUTOMATION，ROBOTICS AND VISION

ＩＣＡＲＣＶ＇９６ＦＯＵＲＴＨＩＮＴＥＲＮＡＴＩＯＮＡＬＣＯＮＦＥＲＥＮＣＥＯＮＣＯＮＴＲＯＬ，ＡＵＴＯＭＡＴＩＯＮ，ＲＯＢＯＴＩＣＳＡＮＤＶＩＳＩＯＮ￥／／３－６Ｄｅｃｅｍｂｅｒ１９９６ＷｅｓｔｉｎＳｔａｍｆｏｒｄ，Ｓｉｎｇａｐｏｒｅ，ＣＡＬＬＦＯ...     

冤家路窄

众所周知ＭＩＣＲＯＳＯＦＴ（微软）、ＮＥＴＳＣＡＰＥ（网景）是一对冤家对头,连他们的软件也不例外。 网民Ｂ在装有ＮＡＶＩＧＡＴＯＲ的机器上安上ＩＥ以后,只见两个软件的图标在屏幕上扭打成一团,接着ＶＢ,ＶＩ－ＳＵＡＬ　ＦＯＸＰＲＯ也加入了对ＮＡＶＩＧＡＴＯＲ的拳打脚踢。 Ｂ只得关机。重新启动后,只见ＩＥ重新安排了桌面,ＮＡＶＩ－ＧＡＴＯＲ已被赶到了回收站里。冤家路窄     

求解非线性矩阵特征值问题的一个三阶收敛的算法

求解非线性矩阵特征值问题的一个三阶收敛的算法陈广义，薛彦才（中国科学院沈阳计算所）ＡＣＵＢＩＣＡＬＬＹＣＯＮＶＥＲＧＥＮＴＡＬＧＯＲＩＴＨＭＦＯＲＳＯＬＶＩＮＧＮＯＮＬＩＮＥＡＲＥＩＧＥＮＶＡＬＵＥＰＲＯＢＬＥＭＳ￥ＣｈｅｎＧｕａｎｇ－ｙｉ；ＸｕｅＹ...     

INSTRUCTIONS TO AUTHORS

ＩＮＳＴＲＵＣＴｌＯＮＳＴＯＡＵＴＨＯＲＳＳＭＯＯＴＨＳＵＲＦＡＣＥＩＮＴＥＲＰＯＬＡＴＩＯＮＯＶＥＲＡＲＢＩＴＲＡＲＹＴＲＩＡＮＧＵＬＡＴＩＯＮＳＢＹＳＵＢＤＩＶＩＳＩＯＮＡＬＧＯＲＩＴＨＭＳ￥ＲｕｉｂｉｎＱｕＳｕｂｍｉｓｓｉｏｎｏｆＭａｎｕｓｃｒ...     

分叉函数向量化计算的改进和开拓

分叉函数向量化计算的改进和开拓黄清南，张景琳，阳述林（北京应用物理与计算数字研究所，计算物理实验室）ＴＨＥＩＭＰＲＯＶＥＭＥＮＴＡＮＤＥＸＴＥＮＳＩＯＮＯＮＴＨＥＶＥＣＴＯＲＩＺＥＤＥＶＡＬＵＡＴＩＯＮＯＦＢＲＡＮＣＨＥＤＦＵＮＣＴＩＯＮＳ￥Ｈｕａｎ...     

伪Newton－δ族算法对一般目标函数的收敛性

伪Ｎｅｗｔｏｎ－δ族算法对一般目标函数的收敛性赵云彬（中国科学院应用数学研究所）段虞荣（重庆大学系统科学与工程研究所）ＣＯＮＶＥＲＧＥＮＣＥＯＦＴＨＥＰＳＥＵＤＯ－ＮＥＷＴＯＮ－δＣＬＡＳＳＭＥＴＨＯＤＳＦＯＲＧＥＮＥＲＡＬＯＢＪＥＣＴＩＶＥＦＵＮＣ...     

Dynamical geometry for multiscale dissipative particle dynamics

In this paper, we review the computational aspects of a multiscale dissipative particle dynamics model for complex fluid simulations based on the feature-rich geometry of the Voronoi tessellation. The geometrical features of the model are critical since the mesh is directly connected to the physics by the interpretation of the Voronoi volumes of the tessellation as coarse-grained fluid clusters. The Voronoi tessellation is maintained dynamically in time to model the fluid in the Lagrangian frame of reference, including imposition of periodic boundary conditions. Several algorithms to construct and maintain the periodic Voronoi tessellation are reviewed in two and three spatial dimensions and their parallel performance discussed. The insertion of polymers and colloidal particles in the fluctuating hydrodynamic solvent is described using surface boundaries.     

基于Voronoi图和GIS的设施区位配置研究

Voronoi图是一种基本的几何构造,是解决相关几何构造问题的有效工具.它正好满足了区位配置中设施定位求解中所遇到的一些问题.在讨论Voronoi图与区位配置模型的关系基础上,从设施配置应用需求的角度,总结与分析了Voronoi图的基本性质,着重介绍了基于Voronoi图的GIS区位配置方法与模型,并指出了进一步的研究与发展方向.     

基于Voronoi图理论的自由边界型腔加工路径规划

Ｖｏｒｏｎｏｉ图是计算几何研究中的一个有力工具。给出了基于Ｖｏｒｏｎｏｉ图和单调区划分的型腔数控加工环切轨迹规划算法,并首次将其应用于边界为自由曲线的型腔,提高了Ｖｏｒｏｎｏｉ图在该领域的应用价值。     

障碍Voronoi图的结晶生成及其应用

用结晶方法来生成障碍Voronoi图.该方法的思想框架是:以生成元为生长点进行4-模板或8-模板的结晶生长,遇到障碍则将障碍边界加入生成元点集继续选择这两个模板结晶,最后得到不同结晶区域的交线图即为障碍Voronoi图.该方法可得到城区距离、棋盘距离下的两种Voronoi图,所用数据结构简单,已用VC 编程实现.并给出具体应用实例.     

基于Voronoi图的方向区域查询方法

针对空间中方向区域查询效率不高的问题,通过引入Voronoi图,利用其特性对数据空间进行划分,提出了基于Voronoi图的方向区域查询方法.该方法在基于Delaunay三角网生成的Voronoi图索引结构基础上,将首结点与查询对象连线形成有向线段,利用Voronoi图可以通过邻接生成点延展的特点确定查询对象的位置,通过...     

基于能耗均衡的WSN连通覆盖集构建算法

为提高无线传感器网络的能量利用率,提出一种基于能耗均衡的连通覆盖集构建算法EBACCS。该算法以概率覆盖模型为基础,采用Voronoi图划分目标区域,获得网络冗余节点,根据能量权值函数,从冗余节点中选出必要的连接节点建立一个优化的连通覆盖集。理论分析和仿真实验结果表明,EBACCS能够保证网络的连通性与覆盖性,均衡节点能耗,延长网络寿命。     

Restricting Voronoi diagrams to meshes using corner validation

Restricted Voronoi diagrams are a fundamental geometric structure used in many applications such as surface reconstruction from point sets or optimal transport. Given a set of sites V = { v _k}ⁿ_k=1 ? ?^d and a mesh X with vertices in ?^d connected by triangles, the restricted Voronoi diagram partitions X by computing for each site the portion of X for which the site is the nearest. The restricted Voronoi diagram is the intersection between the regular Voronoi diagram and the mesh. Depending on the site distribution or the ambient space dimension computing the regular Voronoi diagram may not be feasible using classical algorithms. In this paper, we extend Lévy and Bonneel's approach [ LB12 ] based on nearest neighbor queries. We show that their method is limited when the sites are not located on X . We propose a new algorithm for computing restricted Voronoi which reduces the number of sites considered for each triangle of the mesh and scales smoothly when the sites are far from the surface.     

Division-based analysis of symmetry and its application

A computational method, DAS, is proposed for symmetry analysis of a planar figure closed by a simply connected curve. DAS determines both the symmetric axis and the symmetric point pairs on the curve, consistently, based on the duality of two geometric plane divisions, the Delaunay triangulation and the Voronoi diagram     

弱非均匀Voronoi图细胞面积／体积的快速近似算法

本文针对弱非均匀Voronoi图,介绍一种计算细胞面积／体积的新型快速近似算法．该算法引入一组或多组“虚拟流场”,利用流体力学连续方程的差分近似,得到Voronoi细胞间的递推关系．该算法的优点是复杂度低,递推公式简单,容易在计算机上实现．通过算例研究了各种情况下的误差大小,采用单虚拟流场已经可以得到可以接受的误差范围,而采用双虚拟流场更能进一步减小此误差．本文的目的旨在提供一个全新的思路,通过连续的微分方程来近似考虑离散的图论问题．     

A fast segmentation method based on constraint optimization and its applications: Intensity inhomogeneity and texture segmentation

We propose a new constraint optimization energy and an iteration scheme for image segmentation which is connected to edge-weighted centroidal Voronoi tessellation (EWCVT). We show that the characteristic functions of the edge-weighted Voronoi regions are the minimizers (may not unique) of the proposed energy at each iteration. We propose a narrow banding algorithm to accelerate the implementation, which makes the proposed method very fast. We generalize the CVT segmentation to hand intensity inhomogeneous and texture segmentation by incorporating the global and local image information into the energy functional. Compared with other approaches such as level set method, the experimental results in this paper have shown that our approach greatly improves the calculation efficiency without losing segmentation accuracy.