Automatic generation of octree-based three-dimensional discretizations for partition of unity methods (Q1570323): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s004660050478 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s004660050478 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973470968 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S004660050478 / rank | |||
Normal rank | |||
Latest revision as of 21:34, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Automatic generation of octree-based three-dimensional discretizations for partition of unity methods |
scientific article |
Statements
Automatic generation of octree-based three-dimensional discretizations for partition of unity methods (English)
0 references
27 February 2001
0 references
The presented octree-based discretization for partition of unity methods (PUM) allows the efficient determination of patch interactions to provide easy access during runtime of the program. In comparison with well-known implementations, namely the discretization based only on an arbitrary set of points and the use of a finite element mesh, the developed approach is more efficient with respect to processor and memory resources. The authors demonstrate the partition of unity discretization for complex three dimensional geometries on two examples.
0 references
octree-based three-dimensional discretization
0 references
automatic mesh generation
0 references
finite element mesh
0 references
partition of unity methods
0 references
