2017
DOI: 10.1145/3104989
|View full text |Cite
|
Sign up to set email alerts
|

Geometric Reconstruction of Implicitly Defined Surfaces and Domains with Topological Guarantees

Abstract: Implicitly described domains are a well established tool in the simulation of time dependent problems, e.g. using level-set methods. In order to solve partial differential equations on such domains, a range of numerical methods was developed, e.g. the Immersed Boundary method, Unfitted Finite Element or Unfitted discontinuous Galerkin methods, eXtended or Generalised Finite Element methods, just to name a few. Many of these methods involve integration over cut-cells or their boundaries, as they are described b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
2

Relationship

3
5

Authors

Journals

citations
Cited by 18 publications
(11 citation statements)
references
References 21 publications
0
11
0
Order By: Relevance
“…We use an extended marching cubes algorithm [36]. The domain of a cut cell is approximated by a first order subtriangulation into simple elements.…”
Section: Theory a A Discontinuous Galerkin (Dg-fem) Methods For Smentioning
confidence: 99%
See 1 more Smart Citation
“…We use an extended marching cubes algorithm [36]. The domain of a cut cell is approximated by a first order subtriangulation into simple elements.…”
Section: Theory a A Discontinuous Galerkin (Dg-fem) Methods For Smentioning
confidence: 99%
“…1 (the subtriangulation of the green subdomain is marked by the dashed lines). For a detailed description of the extended marching cubes algorithm, we refer to [36]. When an element is cut by multiple level set functions, we apply the marching cubes algorithm recursively on the elements of the subtriangulation.…”
Section: Theory a A Discontinuous Galerkin (Dg-fem) Methods For Smentioning
confidence: 99%
“…Like the levels-sets for white and gray matter, the resulting level-set for the source space is then given as a three-dimensional array of signed-distance values. This level-set function was discretized using the marching cubes algorithm presented in [ 72 ], which resulted in 256 134 source locations. For each location, we computed the dipole orientation normal to the surface of the source space.…”
Section: Example: Source Analysis Of Somatosensory Evoked Potentialsmentioning
confidence: 99%
“…Let us recall that all the comparisons were performed on the surface meshes (simplicial surfaces) extracted using the marching cubes methods, which can ensure topological consistency [53] but do not always generate regular meshes. And that the goal of this section is to evaluate method robustness to poor-quality triangulations.…”
Section: A Implementation Tools and Computational Assessmentmentioning
confidence: 99%