Generation of constrained Voronoi grid in a plane

作者: Larisa V. Branets , Stephen L. Lyons , Xiao-Hui Wu , Santosh K. Verma

DOI:

关键词:

摘要: A method for generating constrained Voronoi grids in a plane with internal features and boundaries is disclosed. The disclosed generally includes approximation of polylines based on geometry. Protected polygons or points are generated around the polylines, Delaunay triangulation protected polygon vertices constructed. that honors rest gridding domain. grid then from triangulation, which resolves all approximated edges cells. Constrained may be adaptive cell sizes specified density criterion.

参考文章(52)
Chris Gold, Maciej Dakowicz, Kinetic Voronoi/Delaunay Drawing Tools international symposium on voronoi diagrams in science and engineering. pp. 76- 84 ,(2006) , 10.1109/ISVD.2006.24
Aaron G. Dawson, Sameer A. Khan, Method of upscaling permeability for unstructured grids ,(2000)
Qiang Du, Desheng Wang, Constrained boundary recovery for three dimensional Delaunay triangulations International Journal for Numerical Methods in Engineering. ,vol. 61, pp. 1471- 1500 ,(2004) , 10.1002/NME.1120
Qiang Du, Desheng Wang, Anisotropic Centroidal Voronoi Tessellations and Their Applications SIAM Journal on Scientific Computing. ,vol. 26, pp. 737- 761 ,(2005) , 10.1137/S1064827503428527
Philippe TARDY, Ali FADILI, John PEARSON, Anthony Richard, John CRAWSHAW, Method and system for predicting the apparent flow conductivity of a heterogeneous medium ,(2004)
Horacio Flórez Guzmán, Raúl Manzanilla Morillo, Automatic Unstructured Mesh Generation Around Two-Dimensional Domains Described by B-Spline Curves Volume 1: 21st Computers and Information in Engineering Conference. ,(2001) , 10.1115/DETC2001/CIE-21269
Gary L. Miller, Noel Walkington, Steven E. Pav, When and Why Ruppert's Algorithm Works. IMR. pp. 91- 102 ,(2003)