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

From MaRDI portal
Revision as of 02:39, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4029986

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




Related Items (67)

Zonal Flow Solver (ZFS): a highly efficient multi-physics simulation frameworkNumerical simulation of fracking in shale rocks: current state and future approachesOverset structured grids assembly method for numerical simulations of multi-bodies and moving objectsDevelopment of an overset grid computational fluid dynamics solver on graphical processing unitsRobust cut-cell algorithms for DSMC implementations employing multi-level Cartesian gridsFinite element multigrid solution of Euler flows past installed aero- enginesA hardware accelerated unstructured overset method to simulate turbulent fluid flowAccurate interface normal and curvature estimates on three-dimensional unstructured non-convex polyhedral meshesNumerical aspects and implementation of a two-layer zonal wall model for LES of compressible turbulent flows on unstructured meshesA simple unstructured tetrahedral mesh generation algorithm for complex geometriesSemi-meshless stencil selection for anisotropic point distributionsSPH Method with Space-Based Variable Smoothing Length and Its Applications to Free Surface FlowAlgorithm 995Robust and efficient overset grid assembly for partitioned unstructured meshesUnnamed Item3D mesh adaptation. Optimization of tetrahedral meshes by advancing front techniqueMassively parallel grid generation on HPC systemsGuaranteed-quality parallel Delaunay refinement for restricted polyhedral domainsBoundary layer mesh generation with fast collision detectionA fast algorithm for point-location in a finite element meshAn efficient data structure for the advancing‐front triangular mesh generation techniqueUnstructured mesh procedures for the simulation of three-dimensional transient compressible inviscid flows with moving boundary componentsPrismatic mesh generation using minimum distance fieldsRobust moving mesh algorithms for hybrid stretched meshes: application to moving boundaries problemsFracture and fragmentation of thin shells using the combined finite-discrete element methodDevelopment of contact algorithm for three-dimensional numerical manifold methodA dynamic mesh strategy applied to the simulation of flapping wingsMoving meshes in complex configurations using the composite sliding grid methodAn efficient Cartesian mesh generation strategy for complex geometriesFully resolved viscoelastic particulate simulations using unstructured gridsDual-solver research based on the coupling of flux reconstruction and finite volume methodsA lattice type model for particulate mediaAn algorithm for the intersection of quadrilateral surfaces by tracing of neighbours.Improved ALE mesh velocities for moving bodiesA strictly conservative Cartesian cut-cell method for compressible viscous flows on adaptive gridsExtensions and improvements of the advancing front grid generation techniqueUnnamed ItemUnnamed ItemAdaptive unstructured grid generation for engineering computation of aerodynamic flowsA highly automated parallel Chimera method for overset grids based on the implicit hole cutting techniqueNonnested multigrid methods for linear problemsLocally refined tetrahedral mesh generation based on advancing front technique with optimization and smoothing schemeUnnamed ItemThe computation of three-dimensional flows using unstructured gridsAdaptive remeshing for three-dimensional compressible flow computationsAn integrated Davidson and multigrid solution approach for very large scale symmetric eigenvalue problemsThe empty bin: A data structure for spatial search of time‐varying dataCoarse mesh evolution strategies in the Galerkin multigrid method with adaptive remeshing for geometrically non-linear problemsA hybrid building-block and gridless method for compressible flowsPerformance comparisons of tree‐based and cell‐based contact detection algorithmsParallelised finite/discrete element simulation of multi‐fracturing solids and discrete systemsParallelised finite/discrete element simulation of multi‐fracturing solids and discrete systemsAutomatic adaptive mesh generation using metric advancing front approachA full 3D finite element analysis using adaptive refinement and PCG solver with back interpolationSearch algorithm, and simulation of elastodynamic crack propagation by modified smoothed particle hydrodynamics (MSPH) methodA 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 triangulationA massively-parallel, unstructured overset method for mesh connectivityA parallel direct cut algorithm for high-order overset methods with application to a spinning golf ballFlows around moving bodies using a dynamic unstructured overset-grid methodDiscontinuous Galerkin finite element method with anisotropic local grid refinement for inviscid compressible flowsA parallel viscous flow solver on multi-block overset gridsA ridge tracking algorithm and error estimate for efficient computation of Lagrangian coherent structuresFinite element simulation of three-dimensional free-surface flow problemsAn Unfitted Formulation for the Interaction of an Incompressible Fluid with a Thick Structure via an XFEM/DG ApproachGeneration of Boundary Layer Meshes by the Enhanced Jump-and-Walk Method with a Fast Collision Detecting AlgorithmA Robust Implementation for Three-Dimensional Delaunay Triangulations



Cites Work




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