Simple and Efficient Traversal Methods for Quadtrees and Octrees
From MaRDI portal
Publication:4457687
DOI10.1080/10867651.2002.10487560zbMATH Open1098.68940OpenAlexW2010662231MaRDI QIDQ4457687FDOQ4457687
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
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)
Cited In (14)
- Cost-driven octree construction schemes
- Fast distance transformation on irregular two-dimensional grids
- Advanced parallelization strategies using hybrid MPI-CUDA octree DSMC method for modeling flow through porous media
- An Asymptotic-Preserving All-Speed Scheme for Fluid Dynamics and Nonlinear Elasticity
- Application of adaptively refined unstructured grids in DSMC to shock wave simulations
- Accelerated robust Boolean operations based on hybrid representations
- Essentially non-oscillatory adaptive tree methods
- Finding neighbors of equal size in linear quadtrees and octrees in constant time
- Simplex free adaptive tree fast sweeping and evolution methods for solving level set equations in arbitrary dimension
- A high order discontinuous Galerkin Nitsche method for elliptic problems with fictitious boundary
- Dynamic tubular grid: an efficient data structure and algorithms for high resolution level sets
- Adaptive finite element solution of multiscale PDE-ODE systems
- A descent scheme for thick elastic curves with self-contact and container constraints
- A finite-difference method for the variable coefficient Poisson equation on hierarchical Cartesian meshes
This page was built for publication: Simple and Efficient Traversal Methods for Quadtrees and Octrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4457687)
