Proceedings. Visualization '97 (Cat. No. 97CB36155)
DOI: 10.1109/visual.1997.663907
|View full text |Cite
|
Sign up to set email alerts
|

The multilevel finite element method for adaptive mesh optimization and visualization of volume data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
29
0
1

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 50 publications
(30 citation statements)
references
References 24 publications
0
29
0
1
Order By: Relevance
“…The discussion of the different adaptivity strategies is beyond the scope of the present paper. Different refinement strategies can be integrated [48,1,35,21,36]. The focus here is on the construction of an appropriate data-structure that allows on-line construction of an hierarchical multi-resolution representation of the output isosurfaces.…”
Section: Discussionmentioning
confidence: 99%
“…The discussion of the different adaptivity strategies is beyond the scope of the present paper. Different refinement strategies can be integrated [48,1,35,21,36]. The focus here is on the construction of an appropriate data-structure that allows on-line construction of an hierarchical multi-resolution representation of the output isosurfaces.…”
Section: Discussionmentioning
confidence: 99%
“…not uniformly) it can happen that the extracted isosurface contains holes (cracks) at transition zones where the mesh resolution changes. Different solutions have been devised for this problem, including remeshing [4,8], point insertion [20], filling, adaptive projection [17], and saturation of the error indicator [6,7].…”
Section: Related Workmentioning
confidence: 99%
“…Through suitable approximations of the data, they are also able to extract approximate isosurfaces with varying complexity. The various methods mainly differ in the type of hierarchy and interpolation, such as octrees [24], red tetrahedral refinement [8,10,29], tetrahedral bisection [5-7, 20, 32], hierarchical Delaunay triangulations [2], or wavelet techniques [25]. With the help of bounds for the minimum and maximum data value inside each subdomain, the scanning of empty regions is also avoided.…”
Section: Related Workmentioning
confidence: 99%
“…For this problem, different solutions have been devised such as remeshing [8], point insertion [24], projection [19], blending [10], and saturation [5][6][7]32]. …”
Section: Related Workmentioning
confidence: 99%