Poster: parallel octree-based meshing for finite element computations

Authors:
Jose J. Camata;Alvaro L.G.A. Coutinho
Affiliations:
COPPE/Federal University of Rio de Janeiro, Rio de Janeiro, Brazil;COPPE/Federal University of Rio de Janeiro, Rio de Janeiro, Brazil
Venue:
Proceedings of the 2011 companion on High Performance Computing Networking, Storage and Analysis Companion
Year:
2011

Citing 4
Cited 0

Applications of spatial data structures: Computer graphics, image processing, and GIS

Applications of spatial data structures: Computer graphics, image processing, and GIS
Low-constant parallel algorithms for finite element simulations using linear octrees

Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Parallel Linear Octree Meshing with Immersed Surfaces

SBAC-PAD '10 Proceedings of the 2010 22nd International Symposium on Computer Architecture and High Performance Computing
p4est: Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A parallel octree-based meshing is proposed to create reasonable-quality, geometry-adapted unstructured hexahedral meshes automatically from triangulated surface models for finite element computations. Algorithms for the construction, 2:1 balancing and meshing large linear octrees on distributed memory machines are presented. For surface detection, our scheme uses efficient computer graphics algorithms such as boundary box tree and ray tracing technique. An Isogranular analysis is performed on a variety of input surfaces and demonstrates good scalability. Our implementation is able to execute the 2:1 balancing operations over 3.4 billion octants in less than 10 seconds per 1.6 million octants per CPU core.