Algorithms for recursive spatial domain decomposition of arbitrary dimensionality. Each level of an N-dimension hyper cube tree is decomposed into an arbitrary regular structured grid of dimension N.
-
Notifications
You must be signed in to change notification settings - Fork 1
Algorithms for recursive spatial domain decomposition of arbitrary dimensionality. Each level of an N-dimension hyper cube tree is decomposed into an arbitrary regular structured grid of dimension N.
carrardt/HyperCubeTree
About
Algorithms for recursive spatial domain decomposition of arbitrary dimensionality. Each level of an N-dimension hyper cube tree is decomposed into an arbitrary regular structured grid of dimension N.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published