A novel numerical method is explored and named as mesh-free poly-cell Galerkin method. An improved moving least-square （MLS） scheme is presented, which can avoid the matrix inversion in standard MLS and can be used ...A novel numerical method is explored and named as mesh-free poly-cell Galerkin method. An improved moving least-square （MLS） scheme is presented, which can avoid the matrix inversion in standard MLS and can be used to construct shape functions possessing delta Kronecher property. A new type of local support is introduced to ensure the alignment of integral domains with the cells of the back-ground mesh, which will reduce the difficult in integration. An intensive numerical study is conducted to test the accuracy of the present method. It is observed that solutions with good accuracy can be obtained with the present method.展开更多
Centroidal Voronoi tessellations(CVTs) have become a useful tool in many applications ranging from geometric modeling,image and data analysis,and numerical partial differential equations,to problems in physics,astroph...Centroidal Voronoi tessellations(CVTs) have become a useful tool in many applications ranging from geometric modeling,image and data analysis,and numerical partial differential equations,to problems in physics,astrophysics,chemistry,and biology. In this paper,we briefly review the CVT concept and a few of its generalizations and well-known properties.We then present an overview of recent advances in both mathematical and computational studies and in practical applications of CVTs.Whenever possible,we point out some outstanding issues that still need investigating.展开更多
为保证虚拟手术系统中的网格质量,提出一种基于Loose r sample理论的快速表面网格重建算法。记录满足Loose r sample采样定理的点集,用以描述物体的轮廓。通过约束Delaunay方法对该点集进行三角化,标记顶点和Delaunay单元,重构新的网格...为保证虚拟手术系统中的网格质量,提出一种基于Loose r sample理论的快速表面网格重建算法。记录满足Loose r sample采样定理的点集,用以描述物体的轮廓。通过约束Delaunay方法对该点集进行三角化,标记顶点和Delaunay单元,重构新的网格。实验结果表明,该算法能够保证生成网格的质量,简化仿真复杂度。展开更多
Voronoi diagrams on triangulated surfaces based on the geodesic metric play a key role in many applications of computer graphics.Previous methods of constructing such Voronoi diagrams generally depended on having an e...Voronoi diagrams on triangulated surfaces based on the geodesic metric play a key role in many applications of computer graphics.Previous methods of constructing such Voronoi diagrams generally depended on having an exact geodesic metric.However,exact geodesic computation is time-consuming and has high memory usage,limiting wider application of geodesic Voronoi diagrams(GVDs).In order to overcome this issue,instead of using exact methods,we reformulate a graph method based on Steiner point insertion,as an effective way to obtain geodesic distances.Further,since a bisector comprises hyperbolic and line segments,we utilize Apollonius diagrams to encode complicated structures,enabling Voronoi diagrams to encode a medial-axis surface for a dense set of boundary samples.Based on these strategies,we present an approximation algorithm for efficient Voronoi diagram construction on triangulated surfaces.We also suggest a measure for evaluating similarity of our results to the exact GVD.Although our GVD results are constructed using approximate geodesic distances,we can get GVD results similar to exact results by inserting Steiner points on triangle edges.Experimental results on many 3D models indicate the improved speed and memory requirements compared to previous leading methods.展开更多
A novel construction algorithm is presented to generate a conforming Voronoi mesh for any planar straight line graph (PSLG). It is also extended to tesselate multiple-intersected PSLGs. All the algorithms are guarante...A novel construction algorithm is presented to generate a conforming Voronoi mesh for any planar straight line graph (PSLG). It is also extended to tesselate multiple-intersected PSLGs. All the algorithms are guaranteed to converge. Examples are given to illustrate its efficiency.展开更多
文摘A novel numerical method is explored and named as mesh-free poly-cell Galerkin method. An improved moving least-square （MLS） scheme is presented, which can avoid the matrix inversion in standard MLS and can be used to construct shape functions possessing delta Kronecher property. A new type of local support is introduced to ensure the alignment of integral domains with the cells of the back-ground mesh, which will reduce the difficult in integration. An intensive numerical study is conducted to test the accuracy of the present method. It is observed that solutions with good accuracy can be obtained with the present method.
基金supported by the US Department of Energy Office of Science Climate Change Prediction Program through grant numbers DE-FG02-07ER64431 and DE-FG02-07ER64432the US National Science Foundation under grant numbers DMS-0609575 and DMS-0913491
文摘Centroidal Voronoi tessellations(CVTs) have become a useful tool in many applications ranging from geometric modeling,image and data analysis,and numerical partial differential equations,to problems in physics,astrophysics,chemistry,and biology. In this paper,we briefly review the CVT concept and a few of its generalizations and well-known properties.We then present an overview of recent advances in both mathematical and computational studies and in practical applications of CVTs.Whenever possible,we point out some outstanding issues that still need investigating.
文摘为保证虚拟手术系统中的网格质量,提出一种基于Loose r sample理论的快速表面网格重建算法。记录满足Loose r sample采样定理的点集,用以描述物体的轮廓。通过约束Delaunay方法对该点集进行三角化,标记顶点和Delaunay单元,重构新的网格。实验结果表明,该算法能够保证生成网格的质量,简化仿真复杂度。
基金supported in part by the Youth Teacher Development Foundation of Harbin Institute of Technology(IDGA10002143)the National Natural Science Foundation of China(62072139,62272277,62072284)+1 种基金the National Key R&D Program of China(2021YFB1715900)the Joint Funds of the National Natural Science Foundation of China(U22A2033).
文摘Voronoi diagrams on triangulated surfaces based on the geodesic metric play a key role in many applications of computer graphics.Previous methods of constructing such Voronoi diagrams generally depended on having an exact geodesic metric.However,exact geodesic computation is time-consuming and has high memory usage,limiting wider application of geodesic Voronoi diagrams(GVDs).In order to overcome this issue,instead of using exact methods,we reformulate a graph method based on Steiner point insertion,as an effective way to obtain geodesic distances.Further,since a bisector comprises hyperbolic and line segments,we utilize Apollonius diagrams to encode complicated structures,enabling Voronoi diagrams to encode a medial-axis surface for a dense set of boundary samples.Based on these strategies,we present an approximation algorithm for efficient Voronoi diagram construction on triangulated surfaces.We also suggest a measure for evaluating similarity of our results to the exact GVD.Although our GVD results are constructed using approximate geodesic distances,we can get GVD results similar to exact results by inserting Steiner points on triangle edges.Experimental results on many 3D models indicate the improved speed and memory requirements compared to previous leading methods.
基金Supported by the Science Technology Development Program of Beijing Municipal Education Commission (KM200510011004)
文摘A novel construction algorithm is presented to generate a conforming Voronoi mesh for any planar straight line graph (PSLG). It is also extended to tesselate multiple-intersected PSLGs. All the algorithms are guaranteed to converge. Examples are given to illustrate its efficiency.
