2006
DOI: 10.1016/j.cad.2006.06.008
|View full text |Cite
|
Sign up to set email alerts
|

Robust uniform triangulation algorithm for computer aided design

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(2 citation statements)
references
References 23 publications
0
2
0
Order By: Relevance
“…First, one can generate a 3D geometrical model directly, like regular grid model which needs to specify the number of cells in x, y and z direction and sizes of each cell. Second, one can initially create an unstructured mesh in 2D, like Voronoi using the Delaunay [5,7,13,17] triangulation to create, and then one introduces topological structure to a 3D mesh generation, during which one needs to assign the number of geological layers and the elevation of each layer. The last method to generate a geometrical model is from other package's transformation, such as geologic model.…”
Section: Geometrical Modelmentioning
confidence: 99%
“…First, one can generate a 3D geometrical model directly, like regular grid model which needs to specify the number of cells in x, y and z direction and sizes of each cell. Second, one can initially create an unstructured mesh in 2D, like Voronoi using the Delaunay [5,7,13,17] triangulation to create, and then one introduces topological structure to a 3D mesh generation, during which one needs to assign the number of geological layers and the elevation of each layer. The last method to generate a geometrical model is from other package's transformation, such as geologic model.…”
Section: Geometrical Modelmentioning
confidence: 99%
“…Then, the polygonal regions are triangulated by a restricted Delaunay triangulation algorithm, [2][3][4] after which, the triangles generated are subdivided according to the specified tolerance of the surface. In addition, this approach requires a half-edge data structure to represent the mapping polygons.…”
Section: Related Workmentioning
confidence: 99%