1992
DOI: 10.1016/0010-4485(92)90023-4
|View full text |Cite
|
Sign up to set email alerts
|

Feature-based heuristics for finite-element meshing using quadtrees and octrees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1997
1997
2013
2013

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…There are many kinds of triangulation such as [4] [12][13][14][15][16]. Nakajima [15] adopted quadtree to process finite mesh grids and Synder [16] applied quadtree to represent hierarchy structure of surface iterative subdivision to avoid crack on the surface. Paper [4] used binary tree to divide one surface piece into two pieces.…”
Section: Triangulation For Ship Hull Nurbs Surfacementioning
confidence: 99%
“…There are many kinds of triangulation such as [4] [12][13][14][15][16]. Nakajima [15] adopted quadtree to process finite mesh grids and Synder [16] applied quadtree to represent hierarchy structure of surface iterative subdivision to avoid crack on the surface. Paper [4] used binary tree to divide one surface piece into two pieces.…”
Section: Triangulation For Ship Hull Nurbs Surfacementioning
confidence: 99%