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

Longest-edge algorithms for size-optimal refinement of triangulations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(1 citation statement)
references
References 11 publications
0
0
0
Order By: Relevance
“…The user specifies the minimum, maximum or average edge lengths desired for the re-sampled target mesh. The re-sampling algorithm then uses iterative edge-bisection [17] and edge collapsing algorithms [18] to change mesh resolution to the targeted range.…”
Section: Mesh Re-samplingmentioning
confidence: 99%
“…The user specifies the minimum, maximum or average edge lengths desired for the re-sampled target mesh. The re-sampling algorithm then uses iterative edge-bisection [17] and edge collapsing algorithms [18] to change mesh resolution to the targeted range.…”
Section: Mesh Re-samplingmentioning
confidence: 99%