The empty bin: A data structure for spatial search of time‐varying data

DOI10.1002/CNM.959MaRDI QIDQ5433610zbMATH OpenOpenAlexFDO

Authors Rainald Löhner

Publication date 9 January 2008

Published in Communications in Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/cnm.959

zbMATH Keywords

octreesspatial proximityvoxels

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Data structures (68P05) Numerical and other methods in solid mechanics (74S99)

Recommendations

• Efficient search algorithm on compact S-trees
• scientific article; zbMATH DE number 1424305
• A robust and efficient spatial data structure. The nested interpolation- based grid file
• Improving time and space efficiency in generalized binary search trees
• Multidimensional binary partitions: distributed data structures for spatial partitioning

Cites work

• Adaptive embedded unstructured grid methods
• An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
• Contact mechanics for analysis of fracturing and fragmenting solids in the combined finite-discrete element method
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1323177 (Why is no real title available?)
• MR linear contact detection algorithm

Cited in

(2)

• A data structure for efficiently managing a set of energy functions
• On the modeling of pedestrian motion

This page was built for publication: The empty bin: A data structure for spatial search of time‐varying data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5433610)