【摘要】 分析了约束面(点、线段、凸多边形)在三维Voronoi网格存在的条件,提出一种构造三维约束Voronoi剖分的算法.该算法的基本思想是在限定线的球覆盖基础上,借助限定面的约束Regular三角化生成关于限定面对称分布的生长点.理论上,对任意的分段线性复合形约束,该算法可以生成满足此约束的Voronoi网格.最后,给出了实例验证以说明文中算法的有效性.更多还原

【Abstract】 In this paper, the conditions guaranteeing the existence of constrained facets in conforming Voronoi tessellation(CVT) in 3D are derived. An algorithm is presented to build a Voronoi tessellation conforming to a piecewise linear complex (PLC) in 3D. To build CVT, a set of balls are constructed covering the 0- and 1-dimension faces of PLC, then Voronoi sites aligned alongside 2D faces of PLC are generated by the conforming regular triangulation of 2D faces of PLC. The algorithm has been implemented to validate its efficiency. It is to our knowledge, the first practical algorithm devoted to solving this problem.更多还原