Parallelisation with Space-Filling Curves

Applications for the fastest and largest supercomputers nowadays originate to a large extent from scientific computing – in particular, from numerical simulations of phenomena and processes in science and engineering. Examples can be found in many diverse areas, such as the computation of aerodynamic properties of vehicles or aircraft, the prediction of weather or climate phenomena, in molecular physics and chemistry, but also in astrophysics and geoscience.

[1]  Sei-ichiro Kamata,et al.  An address generator, for an N-dimensional pseudo-Hilbert scan in a hyper-rectangular, parallelepiped region , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).

[2]  Juan J. Navarro,et al.  Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking , 2007, Applicable Algebra in Engineering, Communication and Computing.

[3]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[4]  A. Liu,et al.  On the shape of tetrahedra from bisection , 1994 .

[5]  Hermann Tropf,et al.  Multimensional Range Search in Dynamically Balanced Trees , 1981, Angew. Inform..

[6]  Guohua Jin,et al.  SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion , 2005, TOMS.

[7]  H. V. Jagadish,et al.  Analysis of the Hilbert Curve for Representing Two-Dimensional Space , 1997, Inf. Process. Lett..

[8]  M. Elshafei-Ahmed.  Fast methods for split codebooks , 2000, Signal Process..

[9]  Gerhard Zumbusch.  Load Balancing for Adaptively Refined Grids , 2002 .

[10]  Johannes Schwaiger,et al.  Dynamically Adaptive Simulations with Minimal Memory Requirement---Solving the Shallow Water Equations Using Sierpinski Curves , 2010, SIAM J. Sci. Comput..

[11]  Mithuna Thottethodi,et al.  Nonlinear array layouts for hierarchical memory systems , 1999, ICS '99.

[12]  Abraham Lempel,et al.  Compression of two-dimensional data , 1986, IEEE Trans. Inf. Theory.

[13]  V. Springel.  The Cosmological simulation code GADGET-2 , 2005, astro-ph/0505010.

[14]  Yi Li,et al.  Data exploration of turbulence simulations using a database cluster , 2007, Proceedings of the 2007 ACM/IEEE Conference on Supercomputing (SC '07).

[15]  Michael Bader.  Exploiting the Locality Properties of Peano Curves for Parallel Matrix Multiplication , 2008, Euro-Par.

[16]  Christos Kaklamanis,et al.  Branch-and-bound and backtrack search on mesh-connected arrays of processors , 1992, SPAA '92.

[17]  John J. Bartholdi,et al.  Multiresolution indexing of triangulated irregular networks , 2004, IEEE Transactions on Visualization and Computer Graphics.

[18]  Jack Snoeyink,et al.  A Comparison of Five Implementations of 3D Delaunay Tessellation , 2005 .

[19]  Ken Kennedy,et al.  Improving Memory Hierarchy Performance for Irregular Applications Using Data and Computation Reorderings , 2001, International Journal of Parallel Programming.

[20]  John M. Dennis.  Inverse Space-Filling Curve Partitioning of a Global Ocean Model , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[21]  Jörn Behrens.  Multilevel optimization by space-filling curves in adaptive atmospheric modeling , 2005 .

[22]  Xian Liu,et al.  A New Ordering Strategy Applied to Spatial Data Processing , 1998, Int. J. Geogr. Inf. Sci..

[23]  Geoffrey C. Fox,et al.  Fast and parallel mapping algorithms for irregular problems , 1996, The Journal of Supercomputing.

[24]  Barry Joe,et al.  Quality Local Refinement of Tetrahedral Meshes Based on Bisection , 1995, SIAM J. Sci. Comput..

[25]  Jml Maubach,et al.  Space-filling curves for 2-simplicial meshes created with bisections and reflections , 2005 .

[26]  Joshua A. Anderson,et al.  General purpose molecular dynamics simulations fully implemented on graphics processing units , 2008, J. Comput. Phys..

[27]  Doug Lea,et al.  Digital and Hilbert k-d Trees , 1988, Inf. Process. Lett..

[28]  William F. Mitchell,et al.  A refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids , 2007, J. Parallel Distributed Comput..

[29]  Kenneth Steiglitz,et al.  Operations on Images Using Quad Trees , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[30]  Moustafa Elshafei,et al.  Fuzzification Using Space-Filling Curves , 2001, Intell. Autom. Soft Comput..

[31]  Jens-Michael Wierum,et al.  On the Quality of Partitions Based on Space-Filling Curves , 2002, International Conference on Computational Science.

[32]  Christos Faloutsos,et al.  Analytical results on the quadtree decomposition of arbitrary rectangles , 1992, Pattern Recognit. Lett..

[33]  E. H. Moore.  On certain crinkly curves , 1900 .

[34]  David S. Wise,et al.  Generic support of algorithmic and structural recursion for scientific computing , 2009, Int. J. Parallel Emergent Distributed Syst..

[35]  M. Goodchild,et al.  The Fractal Nature of Geographic Phenomena , 1987 .

[36]  Herman J. Haverkort,et al.  Four-dimensional hilbert curves for R-trees , 2009, JEAL.

[37]  Yuefan Deng,et al.  New trends in high performance computing , 2001, Parallel Computing.

[38]  D. Hilbert.  Ueber die stetige Abbildung einer Line auf ein Flächenstück , 1891 .

[39]  W. W. Rogosinski,et al.  Eléments de la théorie des ensembles , 1949 .

[40]  Ye-In Chang,et al.  Neighbor-finding based on space-filling curves , 2005, Inf. Syst..

[41]  Hanan Samet,et al.  Navigating through triangle meshes implemented as linear quadtrees , 2000, TOGS.

[42]  W. Mitchell.  Adaptive refinement for arbitrary finite-element spaces with hierarchical bases , 1991 .

[43]  Arthur R. Butz,et al.  Alternative Algorithm for Hilbert's Space-Filling Curve , 1971, IEEE Transactions on Computers.

[44]  Scott B. Baden,et al.  Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves , 1996, IEEE Trans. Parallel Distributed Syst..

[45]  R. J. Stevens,et al.  Manipulation and Presentation of Multidimensional Image Data Using the Peano Scan , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[46]  Scott M. Murman,et al.  Applications of Space-Filling-Curves to Cartesian Methods for CFD , 2004 .

[47]  Juan Carlos Pérez-Cortes,et al.  Approximate Nearest Neighbor Search using a Single Space-filling Curve and Multiple Representations of the Data Points , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[48]  Arthur R. Butz,et al.  Convergence with Hilbert's Space Filling Curve , 1969, J. Comput. Syst. Sci..

[49]  G. Peano.  Sur une courbe, qui remplit toute une aire plane , 1890 .

[50]  Theodore Bially,et al.  Space-filling curves: Their generation and their application to bandwidth reduction , 1969, IEEE Trans. Inf. Theory.

[51]  Alexander Heinecke,et al.  Parallel matrix multiplication based on space-filling curves on shared memory multicore platforms , 2008, MAW '08.

[52]  Aristid Lindenmayer,et al.  Mathematical Models for Cellular Interactions in Development , 1968 .

[53]  Natalja Rakowsky,et al.  amatos: Parallel adaptive mesh generator for atmospheric and oceanic simulation , 2005 .

[54]  J. D. Teresco,et al.  New challanges in dynamic load balancing , 2005 .

[55]  Valerio Pascucci,et al.  Terrain Simplification Simplified: A General Framework for View-Dependent Out-of-Core Visualization , 2002, IEEE Trans. Vis. Comput. Graph..

[56]  John J. Bartholdi,et al.  Spacefilling curves and the planar travelling salesman problem , 1989, JACM.

[57]  Pangfeng Liu,et al.  Experiences with Parallel N-Body Simulation , 2000, IEEE Trans. Parallel Distributed Syst..

[58]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[59]  Kevin Buchin.  Constructing Delaunay Triangulations along Space-Filling Curves , 2009, ESA.

[60]  Theodosios Pavlidis,et al.  A hierarchical data structure for picture processing , 1975 .

[61]  T. Neckel,et al.  Navier–Stokes and Lattice–Boltzmann on octree‐like grids in the Peano framework , 2011 .

[62]  Mark S. Shephard,et al.  Automatic three‐dimensional mesh generation by the finite octree technique , 1984 .

[63]  A. J. Cole,et al.  A note on space filling curves , 1983, Softw. Pract. Exp..

[64]  M. S. Warren,et al.  A parallel hashed Oct-Tree N-body algorithm , 1993, Supercomputing '93.

[65]  Julien Langou,et al.  A Class of Parallel Tiled Linear Algebra Algorithms for Multicore Architectures , 2007, Parallel Comput..

[66]  Xian Liu.  Four alternative patterns of the Hilbert curve , 2004, Appl. Math. Comput..

[67]  Jeremy D. Frens,et al.  Auto-blocking matrix-multiplication or tracking BLAS3 performance from source code , 1997, PPOPP '97.

[68]  Srinivas Aluru,et al.  A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition , 2006, 2006 International Conference on Parallel Processing (ICPP'06).

[69]  A. Perez,et al.  Peano scanning of arbitrary size images , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,.

[70]  Loren K. Platzman,et al.  An O(N log N) planar travelling salesman heuristic based on spacefilling curves , 1982, Oper. Res. Lett..

[71]  J. L. Smith,et al.  A data structure and algorithm based on a linear key for a rectangle retrieval problem , 1983, Comput. Vis. Graph. Image Process..

[72]  Volker Markl,et al.  Integrating the UB-Tree into a Database System Kernel , 2000, VLDB.

[73]  Michael Bader,et al.  Efficiency considerations in triangular adaptive mesh refinement , 2009, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[74]  Hari Sundar,et al.  Bottom-Up Construction and 2: 1 Balance Refinement of Linear Octrees in Parallel , 2008, SIAM J. Sci. Comput..

[75]  Hiroshi Fukuda,et al.  Infinite Series of Generalized Gosper Space Filling Curves , 2005, CJCDGCGT.

[76]  Peter Sanders,et al.  Efficient Massively Parallel Quicksort , 1997, IRREGULAR.

[77]  J.C. Browne,et al.  A Common Data Management Infrastructure for Adaptive Algorithms for PDE Solutions , 1997, ACM/IEEE SC 1997 Conference (SC'97).

[78]  Keshav Pingali,et al.  Is Cache-Oblivious DGEMM Viable? , 2006, PARA.

[79]  Michael Bader,et al.  Efficient Storage and Processing of Adaptive Triangular Grids Using Sierpinski Curves , 2006, International Conference on Computational Science.

[80]  Michael S. Warren,et al.  Fast Parallel Tree Codes for Gravitational and Fluid Dynamical N-Body Problems , 1994, Int. J. High Perform. Comput. Appl..

[81]  Stefan Schamberger,et al.  A Locality Preserving Graph Ordering Approach for Implicit Partitioning: Graph-Filing Curves , 2004, PDCS.

[82]  Thomas Gerstner.  Multiresolution Compression and Visualization of Global Topographic Data , 2003, GeoInformatica.

[83]  Peter J. H. King,et al.  Using state diagrams for hilbert curve mappings , 2001, Int. J. Comput. Math..

[84]  Lars Karlsson,et al.  Parallel and Cache-Efficient In-Place Matrix Storage Format Conversion , 2012, TOMS.

[85]  Yossi Matias,et al.  A Video Scrambling Technique Based On Space Filling Curves , 1987, CRYPTO.

[86]  H. Bungartz,et al.  An Eulerian approach for partitioned fluid–structure simulations on Cartesian grids , 2008 .

[87]  Miriam Mehl,et al.  A cache‐oblivious self‐adaptive full multigrid method , 2006, Numer. Linear Algebra Appl..

[88]  Rani Siromoney,et al.  Space-filling curves and infinite graphs , 1982, Graph-Grammars and Their Application to Computer Science.

[89]  Andrew Rau-Chaplin,et al.  Compact Hilbert indices: Space-filling curves for domains with unequal side lengths , 2008, Inf. Process. Lett..

[90]  Robert A. van de Geijn,et al.  FLAME: Formal Linear Algebra Methods Environment , 2001, TOMS.

[91]  Carsten Burstedde,et al.  p4est: Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees , 2011, SIAM J. Sci. Comput..

[92]  Rolf Niedermeier,et al.  Towards optimal locality in mesh-indexings , 2002, Discret. Appl. Math..

[93]  H. Tufo,et al.  Computational aspects of a scalable high-order discontinuous Galerkin atmospheric dynamical core , 2009 .

[94]  Allen Klinger,et al.  Data Structures and Pattern Recognition , 1978 .

[95]  Sei-ichiro Kamata,et al.  A new algorithm for N-dimensional Hilbert scanning , 1999, IEEE Trans. Image Process..

[96]  Srinivas Aluru,et al.  Parallel domain decomposition and load balancing using space-filling curves , 1997, Proceedings Fourth International Conference on High-Performance Computing.

[97]  James C. Browne,et al.  On partitioning dynamic adaptive grid hierarchies , 1996, Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences.

[98]  David M. Mark,et al.  A Comparative Analysis of some 2-Dimensional Orderings , 1990, Int. J. Geogr. Inf. Sci..

[99]  Jack J. Dongarra,et al.  A set of level 3 basic linear algebra subprograms , 1990, TOMS.

[100]  William F. Mitchell,et al.  Hamiltonian Paths Through Two- and Three-Dimensional Grids , 2005, Journal of research of the National Institute of Standards and Technology.

[101]  Neil E. Wiseman,et al.  Operations on Quadtree Encoded Images , 1983, Comput. J..

[102]  Milan Ruzic,et al.  Uniform deterministic dictionaries , 2008, TALG.

[103]  Miriam Mehl,et al.  A Cache-Aware Algorithm for PDEs on Hierarchical Data Structures Based on Space-Filling Curves , 2006, SIAM J. Sci. Comput..

[104]  Anoop Gupta,et al.  Load Balancing and Data locality in Adaptive Hierarchical N-Body Methods: Barnes-Hut, Fast Multipole, and Rasiosity , 1995, J. Parallel Distributed Comput..

[105]  Igor Kossaczký.  A recursive approach to local mesh refinement in two and three dimensions , 1994 .

[106]  Alan H. Barr,et al.  Accurate triangulations of deformed, intersecting surfaces , 1987, SIGGRAPH.

[107]  Roger Wattenhofer,et al.  Space Filling Curves versus Random Walks , 1996, Algorithmic Foundations of Geographic Information Systems.

[108]  William J. Gilbert,et al.  A cube-filling Hilbert Curve , 1984 .

[109]  David R. O'Hallaron,et al.  Scalable Parallel Octree Meshing for TeraScale Applications , 2005, ACM/IEEE SC 2005 Conference (SC'05).

[110]  Julien Langou,et al.  The Impact of Multicore on Math Software , 2006, PARA.

[111]  A. Lindenmayer.  Mathematical models for cellular interactions in development. I. Filaments with one-sided inputs. , 1968, Journal of theoretical biology.

[112]  Ronald Kriemann,et al.  Parallel -Matrix Arithmetics on Shared Memory Systems , 2005, Computing.

[113]  Rainer Grauer,et al.  Racoon: A parallel mesh-adaptive framework for hyperbolic conservation laws , 2005, Parallel Comput..

[114]  Jon Louis Bentley,et al.  Analysis of Range Searches in Quad Trees , 1975, Inf. Process. Lett..

[115]  Chris L. Jackins,et al.  Oct-trees and their use in representing three-dimensional objects , 1980 .

[116]  Michael Bader,et al.  Hardware-Oriented Implementation of Cache Oblivious Matrix Operations Based on Space-Filling Curves , 2007, PPAM.

[117]  R. Durbin,et al.  Optimal numberings of an N N array , 1986 .

[118]  Chau-Wen Tseng,et al.  Exploiting locality for irregular scientific codes , 2006, IEEE Transactions on Parallel and Distributed Systems.

[119]  Georg Stadler,et al.  Scalable adaptive mantle convection simulation on petascale supercomputers , 2008, HiPC 2008.

[120]  Neal,et al.  Using Peano Curves for Bilevel Display of Continuous-Tone Images , 1982, IEEE Computer Graphics and Applications.

[121]  M. Rivara,et al.  A 3-D refinement algorithm suitable for adaptive and multi-grid techniques , 1992 .

[122]  Sanjay Ranka,et al.  Memory hierarchy management for iterative graph structures , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[123]  P. Moscato,et al.  The euclidean traveling salesman problem and a space-filling curve , 1995 .

[124]  Kenneth I. Joy,et al.  Adaptive 4-8 texture hierarchies , 2004, IEEE Visualization 2004.

[125]  Piet Hut,et al.  A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.

[126]  P. M. Finnigan,et al.  Octree-based automatic mesh generation for non-manifold domains , 2005, Engineering with Computers.

[127]  Michael Griebel,et al.  Parallel multigrid in an adaptive PDE solver based on hashing and space-filling curves , 1999, Parallel Comput..

[128]  Vipin Kumar,et al.  Graph partitioning for high-performance scientific simulations , 2003 .

[129]  Delma J. Hebert.  Symbolic Local Refinement of Tetrahedral Grids , 1994, J. Symb. Comput..

[130]  Michael Mills,et al.  Fractal based image coding scheme using Peano scan , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[131]  Keshav Pingali,et al.  An experimental comparison of cache-oblivious and cache-conscious programs , 2007, SPAA '07.

[132]  Benoit B. Mandelbrot,et al.  Fractal Geometry of Nature , 1984 .

[133]  Bernd Mohr,et al.  Performance Analysis and Visualization of the N-Body Tree Code PEPC on Massively Parallel Computers , 2005, PARCO.

[134]  J. Gips.  Shape grammars and their uses , 1974 .

[135]  Craig Gotsman,et al.  Universal Rendering Sequences for Transparent Vertex Caching of Progressive Meshes , 2002, Comput. Graph. Forum.

[136]  J. Hudson.  A DIAMOND ANNIVERSARY , 1979 .

[137]  Christos Davatzikos,et al.  Low-constant parallel algorithms for finite element simulations using linear octrees , 2007, Proceedings of the 2007 ACM/IEEE Conference on Supercomputing (SC '07).

[138]  Jia-Hong Lee,et al.  Texture classification method using multiple space filling curves , 1994, Pattern Recognit. Lett..

[139]  Justin Luitjens,et al.  Parallel space‐filling curve generation through sorting , 2007, Concurr. Comput. Pract. Exp..

[140]  D R Bowler,et al.  Automatic data distribution and load balancing with space-filling curves: implementation in CONQUEST , 2008, Journal of physics. Condensed matter : an Institute of Physics journal.

[141]  Joseph M. Maubach,et al.  Local bisection refinement for $n$-simplicial grids generated by reflection , 2017 .

[142]  H. T. Kung,et al.  I/O complexity: The red-blue pebble game , 1981, STOC '81.

[143]  Gerd Heber,et al.  Efficient query processing on unstructured tetrahedral meshes , 2006, SIGMOD Conference.

[144]  John Edward Warnock,et al.  A hidden surface algorithm for computer generated halftone pictures , 1969 .

[145]  K. Powell,et al.  Solution-Adaptive Cartesian Cell Approach for Viscous and Inviscid Flows , 1996 .

[146]  Justin Luitjens,et al.  Parallel space-filling curve generation through sorting: Research Articles , 2007 .

[147]  Michael Lindenbaum,et al.  On the metric properties of discrete space-filling curves , 1996, IEEE Trans. Image Process..

[148]  Delma J. Hebert.  Cyclic Interlaced Quadtree Algorithms for Quincunx Multiresolution , 1998, J. Algorithms.

[149]  John M. Dennis,et al.  Partitioning with space-filling curves on the cubed-sphere , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[150]  J. Tinsley Oden,et al.  Problem decomposition for adaptive hp finite element methods , 1995 .

[151]  Hans-Joachim Bungartz,et al.  The PDE framework Peano applied to fluid dynamics: an efficient implementation of a parallel multiscale fluid dynamics solver on octree-like adaptive Cartesian grids , 2010 .

[152]  Abani K. Patra,et al.  Robust and efficient domain decomposition preconditioners for adaptive hp finite element approximations of linear elasticity with and without discontinuous coefficients , 2004 .

[153]  Miriam Mehl,et al.  Peano - A Traversal and Storage Scheme for Octree-Like Adaptive Cartesian Multiscale Grids , 2011, SIAM J. Sci. Comput..

[154]  Paul H. J. Kelly,et al.  Is Morton layout competitive for large two‐dimensional arrays yet? , 2006, Concurr. Comput. Pract. Exp..

[155]  David S. Wise,et al.  Costs of Quadtree Representation of Nondense Matrices , 1990, J. Parallel Distributed Comput..

[156]  Christoph Schierz,et al.  Algorithm 781: generating Hilbert's space-filling curve by recursion , 1998, TOMS.

[157]  Stefan Schamberger,et al.  Partitioning finite element meshes using space-filling curves , 2005, Future Gener. Comput. Syst..

[158]  Michael Griebel,et al.  A Particle-Partition of Unity Method-Part IV: Parallelization , 2003 .

[159]  Xiaolin Cao,et al.  A New Scalable Parallel Method for Molecular Dynamics Based on Cell-Block Data Structure , 2004, ISPA.

[160]  Hans Sagan.  On the Geometrization of the Peano Curve and the Arithmetization of the Hilbert Curve , 1992 .

[161]  Russ Miller,et al.  Mesh Computer Algorithms for Computational Geometry , 1989, IEEE Trans. Computers.

[162]  Manish Parashar,et al.  An Application-Centric Characterization of Domain-Based SFC Partitioners for Parallel SAMR , 2002, IEEE Trans. Parallel Distributed Syst..

[163]  Gerhard Zumbusch,et al.  Parallel Multilevel Methods , 2003 .

[164]  Rudolf Bayer.  The Universal B-Tree for multidimensional Indexing , 1996 .

[165]  Leslie M. Goldschlager.  Short algorithms for space‐filling curves , 1981, Softw. Pract. Exp..

[166]  Hans-Joachim Bungartz,et al.  A Parallel Adaptive Cartesian PDE Solver Using Space-Filling Curves , 2006, Euro-Par.

[167]  Niklaus Wirth,et al.  Algorithms + Data Structures = Programs , 1976 .

[168]  M. Shephard,et al.  A combined octree/delaunay method for fully automatic 3‐D mesh generation , 1990 .

[169]  Hans Sagan,et al.  Some reflections on the emergence of space- filling curves: the way it could have happened and should have happened, but did not happen , 1991 .

[170]  Hans-Joachim Bungartz,et al.  Numerical Simulation of Particle Transport in a Drift Ratchet , 2008, SIAM J. Sci. Comput..

[171]  Francisco Argüello,et al.  A Data-Parallel Formulation for Divide and Conquer Algorithms , 2001, Comput. J..

[172]  Jens Zimmermann,et al.  Parallelizing an Unstructured Grid Generator with a Space-Filling Curve Approach , 2000, Euro-Par.

[173]  H. Lebesgue,et al.  Lecons Sur L'Integration Et LA Recherche Des Fonctions Primitives , 1973 .

[174]  Erik Elmroth,et al.  SIAM REVIEW c ○ 2004 Society for Industrial and Applied Mathematics Vol. 46, No. 1, pp. 3–45 Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software ∗ , 2022 .

[175]  Günther F. Schrack,et al.  Encoding and decoding the Hilbert order , 1996 .

[176]  Ahmad C. Ansari,et al.  Image Data Ordering And Compression Using Peano Scan And LOT , 1992 .

[177]  Christos Faloutsos,et al.  Fractals for secondary key retrieval , 1989, PODS.

[178]  D. Hilbert.  Über die stetige Abbildung einer Linie auf ein Flächenstück , 1935 .

[179]  Brian Wyvill,et al.  On the generation and use of space‐filling curves , 1983, Softw. Pract. Exp..

[180]  Leila De Floriani,et al.  Hierarchical triangulation for multiresolution surface description , 1995, TOGS.

[181]  A. K. Patra,et al.  Data structures and load balancing for parallel adaptive hp finite-element methods☆ , 2003 .

[182]  Sheng Zhou,et al.  HCPO: an efficient insertion order for incremental Delaunay triangulation , 2005, Inf. Process. Lett..

[183]  Lexing Ying,et al.  A New Parallel Kernel-Independent Fast Multipole Method , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[184]  Alan L. Cox,et al.  Improving Fine-Grained Irregular Shared-Memory Benchmarks by Data Reordering , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[185]  Rolf Niedermeier,et al.  On Multidimensional Curves with Hilbert Property , 2000, Theory of Computing Systems.

[186]  Barry F. Smith,et al.  Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations , 1996 .

[187]  Michael Bader,et al.  Memory efficient adaptive mesh generation and implementation of multigrid algorithms using Sierpinski curves , 2008, Int. J. Comput. Sci. Eng..

[188]  H. V. Jagadish,et al.  Linear clustering of objects with multiple attributes , 1990, SIGMOD '90.

[189]  Luiz Velho,et al.  Digital halftoning with space filling curves , 1991, SIGGRAPH.

[190]  Richard W. Vuduc,et al.  Petascale Direct Numerical Simulation of Blood Flow on 200K Cores and Heterogeneous Architectures , 2010, 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis.

[191]  Charles R. Dyer,et al.  Experiments on Picture Representation Using Regular Decomposition , 1976 .

[192]  David G. Kirkpatrick,et al.  Right-Triangulated Irregular Networks , 2001, Algorithmica.

[193]  H. Sagan.  Space-filling curves , 1994 .

[194]  Christos Faloutsos,et al.  On packing R-trees , 1993, CIKM '93.

[195]  Boleslaw K. Szymanski,et al.  Adaptive Local Refinement with Octree Load Balancing for the Parallel Solution of Three-Dimensional Conservation Laws , 1997, J. Parallel Distributed Comput..

[196]  Christoph Zenger,et al.  Cache efficient data structures and algorithms for adaptive multidimensional multilevel finite element solvers , 2008 .

[197]  J. Griffiths,et al.  Table-driven algorithms for generating space-filling curves , 1985 .

[198]  Herman J. Haverkort,et al.  Locality and bounding-box quality of two-dimensional space-filling curves , 2010, Comput. Geom..

[199]  Donald Meagher,et al.  Geometric modeling using octree encoding , 1982, Comput. Graph. Image Process..

[200]  William N. Dawes,et al.  A practical demonstration of scalable, parallel mesh generation , 2009 .

[201]  Renato Pajarola.  Large scale terrain visualization using the restricted quadtree triangulation , 1998 .

[202]  Günter Rote,et al.  Incremental constructions con BRIO , 2003, SCG '03.

[203]  John G. Keating,et al.  A detailed study of the generation of optically detectable watermarks using the logistic map , 2006 .

[204]  Bruce Hendrickson,et al.  Dynamic load balancing in computational mechanics , 2000 .

[205]  Douglas N. Arnold,et al.  Locally Adapted Tetrahedral Meshes Using Bisection , 2000, SIAM J. Sci. Comput..

[206]  D. Bertsimas,et al.  Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem , 1989 .

[207]  Sargur N. Srihari,et al.  A hierarchical data structure for multidimensional digital images , 1983, CACM.

[208]  Kolja Brix,et al.  Parallelisation of Multiscale-Based Grid Adaptation using Space-Filling Curves , 2009 .

[209]  Avelino J. Gonzalez,et al.  Data-partitioning using the Hilbert space filling curves: Effect on the speed of convergence of Fuzzy ARTMAP for large database problems , 2005, Neural Networks.

[210]  H. Sagan.  A three-dimensional Hilbert curve , 1993 .

[211]  Peter J. H. King,et al.  Querying multi-dimensional data indexed using the Hilbert space-filling curve , 2001, SGMD.

[212]  Joël Quinqueton,et al.  A Locally Adaptive Peano Scanning Algorithm , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[213]  U. Ziegler,et al.  The NIRVANA code: Parallel computational MHD with adaptive mesh refinement , 2008, Comput. Phys. Commun..

[214]  L. Platzman,et al.  Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space , 1988 .

[215]  Frank Manola,et al.  PROBE Spatial Data Modeling and Query Processing in an Image Database Application , 1988, IEEE Trans. Software Eng..

[216]  M. Aurada,et al.  Convergence of adaptive BEM for some mixed boundary value problem , 2012, Applied numerical mathematics : transactions of IMACS.

[217]  Matteo Frigo,et al.  Cache-oblivious algorithms , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[218]  Michael J. Aftosmis,et al.  Robust and efficient Cartesian mesh generation for component-based geometry , 1997 .

[219]  Mark A. Duchaineau,et al.  ROAMing terrain: real-time optimally adapting meshes , 1997 .

[220]  Laveen N. Kanal,et al.  Classification of binary random patterns , 1965, IEEE Trans. Inf. Theory.

[221]  Jack Dongarra,et al.  LAPACK: a portable linear algebra library for high-performance computers , 1990, SC.

[222]  Quentin F. Stout.  Topological matching , 1983, STOC '83.

[223]  Frédéric Alauzet,et al.  On the Use of Space Filling Curves for Parallel Anisotropic Mesh Adaptation , 2009, IMR.

[224]  T. H. Merrett,et al.  A class of data structures for associative searching , 1984, PODS.

[225]  Michael Zingale,et al.  High-Performance Reactive Fluid Flow Simulations Using Adaptive Mesh Refinement on Thousands of Processors , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[226]  John F. Muth,et al.  The Solution of Travelling Salesman Problems Based on Industrial Data , 1995 .

[227]  Eiji Kawaguchi,et al.  On a Method of Binary-Picture Representation and Its Application to Data Compression , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[228]  Luiz Velho,et al.  Variable Resolution 4‐k Meshes: Concepts and Applications , 2000, Comput. Graph. Forum.

[229]  Daniel Cohen-Or,et al.  Context‐based Space Filling Curves , 2000, Comput. Graph. Forum.

[230]  Robert A. van de Geijn,et al.  Anatomy of high-performance matrix multiplication , 2008, TOMS.

[231]  J. Michael Steele,et al.  General Spacefilling Curve Heuristics and Limit Theory for the Traveling Salesman Problem , 1994, J. Complex..

[232]  Konstantin Bauman.  The dilation factor of the Peano-Hilbert curve , 2006 .

[233]  Irene Gargantini,et al.  An effective way to represent quadtrees , 1982, CACM.

[234]  Robert E. Webber,et al.  Space diffusion: an improved parallel halftoning technique using space-filling curves , 1993, SIGGRAPH.

[235]  William Ribarsky,et al.  Real-time, continuous level of detail rendering of height fields , 1996, SIGGRAPH.

[236]  David M. Mark,et al.  Two-dimensional run-encoding for quadtree representation , 1985, Comput. Vis. Graph. Image Process..

[237]  Przemyslaw Prusinkiewicz,et al.  Graphical applications of L-systems , 1986 .

[238]  Michael Griebel,et al.  Hash based adaptive parallel multilevel methods with space-filling curves , 2002 .

[239]  V. Pascucci,et al.  Isosurface computation made simple: hardware acceleration, adaptive refinement and tetrahedral stripping , 2004, VISSYM'04.

[240]  Jörn Behrens,et al.  Adaptive Atmospheric Modeling - Key Techniques in Grid Generation, Data Structures, and Numerical Operations with Applications , 2006, Lecture Notes in Computational Science and Engineering.

[241]  Przemyslaw Prusinkiewicz,et al.  The Algorithmic Beauty of Plants , 1990, The Virtual Laboratory.

[242]  David S. Wise.  Representing Matrices as Quadtrees for Parallel Processors , 1985, Inf. Process. Lett..

[243]  Reuven Bar-Yehuda,et al.  Time/space tradeoffs for polygon mesh rendering , 1996, TOGS.

[244]  Michael Bader,et al.  Cache oblivious matrix multiplication using an element ordering based on the Peano curve , 2006 .

[245]  Fred G. Gustavson,et al.  Recursion leads to automatic variable blocking for dense linear-algebra algorithms , 1997, IBM J. Res. Dev..

[246]  J. G. Griffiths.  An algorithm for displaying a class of space‐filling curves , 1986, Softw. Pract. Exp..

[247]  Desh Ranjan,et al.  Space-Filling Curves and Their Use in the Design of Geometric Data Structures , 1997, Theor. Comput. Sci..

[248]  Bruce Hendrickson,et al.  Load balancing fictions, falsehoods and fallacies☆ , 2000 .

[249]  Gerd Heber,et al.  Self‐avoiding walks over adaptive unstructured grids , 2000 .

[250]  Walter Wunderlich.  Über Peano-Kurven. , 1973 .

[251]  John J. Bartholdi,et al.  Vertex‐labeling algorithms for the Hilbert spacefilling curve , 2001, Softw. Pract. Exp..

[252]  Frank Manola,et al.  PROBE Spatial Data Modeling in an Image Database and Query Processing Application , 1988 .

[253]  Manfred Liebmann,et al.  A Hilbert-order multiplication scheme for unstructured sparse matrices , 2007, Int. J. Parallel Emergent Distributed Syst..

[254]  Hugues Hoppe,et al.  Optimization of mesh locality for transparent vertex caching , 1999, SIGGRAPH.

[255]  Tobias Weinzierl,et al.  A Framework for Parallel PDE Solvers on Multiscale Adaptive Cartesian Grids , 2009 .

[256]  Murray Cole,et al.  Implementing the hierarchical PRAM on the 2D mesh: analyses and experiments , 1995, Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing.

[257]  Christos Faloutsos,et al.  Analysis of the Clustering Properties of the Hilbert Space-Filling Curve , 2001, IEEE Trans. Knowl. Data Eng..

[258]  Nasir D. Memon,et al.  An analysis of some common scanning techniques for lossless image coding , 1997, Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136).

[259]  Jack A. Orenstein.  Spatial query processing in an object-oriented database system , 1986, SIGMOD '86.

[260]  Mario A. López,et al.  High dimensional similarity search with space filling curves , 2001, Proceedings 17th International Conference on Data Engineering.

[261]  Sanjay Ranka,et al.  Partitioning unstructured computational graphs for nonunifor , 1995, IEEE Parallel & Distributed Technology: Systems & Applications.

[262]  Jeremy D. Frens,et al.  QR factorization with Morton-ordered quadtree matrices for memory re-use and parallelism , 2003, PPoPP '03.

[263]  Sanjay Ranka,et al.  Architecture-independent locality-improving transformations of computational graphs embedded in k-dimensions , 1995, ICS '95.

[264]  Daniel Kressner,et al.  Block variants of Hammarling's method for solving Lyapunov equations , 2008, TOMS.

[265]  Eberhard Bänsch,et al.  Local mesh refinement in 2 and 3 dimensions , 1991, IMPACT Comput. Sci. Eng..