Simple and Efficient Traversal Methods for Quadtrees and Octrees

DOI10.1080/10867651.2002.10487560zbMath1098.68940OpenAlexW2010662231MaRDI QIDQ4457687

Sarah F. Frisken, Ronald N. Perry

Publication date: 25 March 2004

Published in: Journal of Graphics Tools (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10867651.2002.10487560

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (12)

Accelerated robust Boolean operations based on hybrid representations ⋮ Advanced parallelization strategies using hybrid MPI-CUDA octree DSMC method for modeling flow through porous media ⋮ Essentially non-oscillatory adaptive tree methods ⋮ A descent scheme for thick elastic curves with self-contact and container constraints ⋮ A high order discontinuous Galerkin Nitsche method for elliptic problems with fictitious boundary ⋮ A finite-difference method for the variable coefficient Poisson equation on hierarchical Cartesian meshes ⋮ Simplex free adaptive tree fast sweeping and evolution methods for solving level set equations in arbitrary dimension ⋮ Dynamic tubular grid: an efficient data structure and algorithms for high resolution level sets ⋮ Application of adaptively refined unstructured grids in DSMC to shock wave simulations ⋮ Fast distance transformation on irregular two-dimensional grids ⋮ Adaptive finite element solution of multiscale PDE-ODE systems ⋮ An Asymptotic-Preserving All-Speed Scheme for Fluid Dynamics and Nonlinear Elasticity

This page was built for publication: Simple and Efficient Traversal Methods for Quadtrees and Octrees