An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems

DOI10.1002/nme.1620310102zbMath0825.73958OpenAlexW2001045671MaRDI QIDQ4029986

Javier Bonet, Jaime Peraire

Publication date: 1 April 1993

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.1620310102

Mathematics Subject Classification ID

Related Items (67)

Zonal Flow Solver (ZFS): a highly efficient multi-physics simulation framework ⋮ Numerical simulation of fracking in shale rocks: current state and future approaches ⋮ Overset structured grids assembly method for numerical simulations of multi-bodies and moving objects ⋮ Development of an overset grid computational fluid dynamics solver on graphical processing units ⋮ Robust cut-cell algorithms for DSMC implementations employing multi-level Cartesian grids ⋮ Finite element multigrid solution of Euler flows past installed aero- engines ⋮ A hardware accelerated unstructured overset method to simulate turbulent fluid flow ⋮ Accurate interface normal and curvature estimates on three-dimensional unstructured non-convex polyhedral meshes ⋮ Numerical aspects and implementation of a two-layer zonal wall model for LES of compressible turbulent flows on unstructured meshes ⋮ A simple unstructured tetrahedral mesh generation algorithm for complex geometries ⋮ Semi-meshless stencil selection for anisotropic point distributions ⋮ SPH Method with Space-Based Variable Smoothing Length and Its Applications to Free Surface Flow ⋮ Algorithm 995 ⋮ Robust and efficient overset grid assembly for partitioned unstructured meshes ⋮ Unnamed Item ⋮ 3D mesh adaptation. Optimization of tetrahedral meshes by advancing front technique ⋮ Massively parallel grid generation on HPC systems ⋮ Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains ⋮ Boundary layer mesh generation with fast collision detection ⋮ A fast algorithm for point-location in a finite element mesh ⋮ An efficient data structure for the advancing‐front triangular mesh generation technique ⋮ Unstructured mesh procedures for the simulation of three-dimensional transient compressible inviscid flows with moving boundary components ⋮ Prismatic mesh generation using minimum distance fields ⋮ Robust moving mesh algorithms for hybrid stretched meshes: application to moving boundaries problems ⋮ Fracture and fragmentation of thin shells using the combined finite-discrete element method ⋮ Development of contact algorithm for three-dimensional numerical manifold method ⋮ A dynamic mesh strategy applied to the simulation of flapping wings ⋮ Moving meshes in complex configurations using the composite sliding grid method ⋮ An efficient Cartesian mesh generation strategy for complex geometries ⋮ Fully resolved viscoelastic particulate simulations using unstructured grids ⋮ Dual-solver research based on the coupling of flux reconstruction and finite volume methods ⋮ A lattice type model for particulate media ⋮ An algorithm for the intersection of quadrilateral surfaces by tracing of neighbours. ⋮ Improved ALE mesh velocities for moving bodies ⋮ A strictly conservative Cartesian cut-cell method for compressible viscous flows on adaptive grids ⋮ Extensions and improvements of the advancing front grid generation technique ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Adaptive unstructured grid generation for engineering computation of aerodynamic flows ⋮ A highly automated parallel Chimera method for overset grids based on the implicit hole cutting technique ⋮ Nonnested multigrid methods for linear problems ⋮ Locally refined tetrahedral mesh generation based on advancing front technique with optimization and smoothing scheme ⋮ Unnamed Item ⋮ The computation of three-dimensional flows using unstructured grids ⋮ Adaptive remeshing for three-dimensional compressible flow computations ⋮ An integrated Davidson and multigrid solution approach for very large scale symmetric eigenvalue problems ⋮ The empty bin: A data structure for spatial search of time‐varying data ⋮ Coarse mesh evolution strategies in the Galerkin multigrid method with adaptive remeshing for geometrically non-linear problems ⋮ A hybrid building-block and gridless method for compressible flows ⋮ Performance comparisons of tree‐based and cell‐based contact detection algorithms ⋮ Parallelised finite/discrete element simulation of multi‐fracturing solids and discrete systems ⋮ Parallelised finite/discrete element simulation of multi‐fracturing solids and discrete systems ⋮ Automatic adaptive mesh generation using metric advancing front approach ⋮ A full 3D finite element analysis using adaptive refinement and PCG solver with back interpolation ⋮ Search algorithm, and simulation of elastodynamic crack propagation by modified smoothed particle hydrodynamics (MSPH) method ⋮ A review and comparative study of upwind biased schemes for compressible flow computation. III: Multidimensional extension on unstructured grids. ⋮ Adjacency for grid generation and grid adaptation in Delaunay triangulation ⋮ A massively-parallel, unstructured overset method for mesh connectivity ⋮ A parallel direct cut algorithm for high-order overset methods with application to a spinning golf ball ⋮ Flows around moving bodies using a dynamic unstructured overset-grid method ⋮ Discontinuous Galerkin finite element method with anisotropic local grid refinement for inviscid compressible flows ⋮ A parallel viscous flow solver on multi-block overset grids ⋮ A ridge tracking algorithm and error estimate for efficient computation of Lagrangian coherent structures ⋮ Finite element simulation of three-dimensional free-surface flow problems ⋮ An Unfitted Formulation for the Interaction of an Incompressible Fluid with a Thick Structure via an XFEM/DG Approach ⋮ Generation of Boundary Layer Meshes by the Enhanced Jump-and-Walk Method with a Fast Collision Detecting Algorithm ⋮ A Robust Implementation for Three-Dimensional Delaunay Triangulations

Cites Work

• Unnamed Item

This page was built for publication: An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems