|
[Sponsors] |
March 8, 2003, 01:43 |
domain decompostion
|
#1 |
Guest
Posts: n/a
|
hello all, does anyone know domain decomposition algorithms which generate arbitrary convex polyhedra given the boundary? For example, in 2D, if I was given the Brep for inner and outer boundary, i would want the domain to be decomposed into arbitrary polygons which could be any combination of triangles, quads, pentagons etc. I would want to know the 3D counterpart rather than 2d. For 2d, I am doing the delaunay triangulation and generating the voronoi polygons. What can I do for 3D? Delaunay triangulation is very very complex in 3d. Any suggestions? Thanks
|
|
|
|
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Domain Imbalance | HMR | CFX | 5 | October 10, 2016 05:57 |
Domain format problem on airfoil flow simulation | andrenonaka | CFX | 14 | December 7, 2015 00:42 |
Vertical Axis Wind Turbine Rotating Domain Problems | TWaung | CFX | 4 | May 1, 2012 03:14 |
CFX domain comparison | Kiat110616 | CFX | 4 | April 3, 2011 22:43 |
CFX Solver Memory Error | mike | CFX | 1 | March 19, 2008 07:22 |