## Average Case Quality of Partitions Induced by the Lebesgue Indexing (2001)

Citations: | 2 - 2 self |

### BibTeX

@TECHREPORT{Wierum01averagecase,

author = {Jens-michael Wierum},

title = {Average Case Quality of Partitions Induced by the Lebesgue Indexing},

institution = {},

year = {2001}

}

### OpenURL

### Abstract

This paper presents the quality of partitions induced by the Lebesgue curve in average case. The surface that surrounds an arbitrary index range is compared with the optimal partition in the grid, i. e. the square. The upper bound on the surface is asymptotically 3 times the optimal size.

### Citations

258 | Geometric range searching and its relatives
- Agarwal, Erickson
- 1998
(Show Context)
Citation Context ...ge compression and browsing [10, 4], databases [2], and contact search insnite element analysis [5]. An overview on this and other techniques for range searching in computational geometry is given in =-=[-=-1]. Space-lling curves have other locality properties which are e. g. useful in parallelsnite element simulations [3, 7]. Space-lling curves are geometric representations of bijective mappings M : f1;... |

150 | Analysis of the clustering properties of the hilbert space-filling curve
- Moon, Jagadish, et al.
(Show Context)
Citation Context ... of index intervals which have to be determined for a given request region. Sharp results are given in [2] for squares in two-dimensional space. The costs for arbitrary shaped regions is discussed in =-=[8-=-]. Here we examine the surface of a partition which is induced by an interval of a space-lling curve. Practical results of this relationship for uniform grids and unstructured meshes can be found in [... |

50 |
Space Filling Curves
- Sagan
- 1994
(Show Context)
Citation Context ...ns of bijective mappings M : f1; : : : ; N m g ! f1; : : : ; Ng m . The curve M traverses all N m cells in the m-dimensional grid of size N . An (historic) overview on space-lling curves is given in [=-=1-=-1]. Experimental work and theoretical analysis have shown, that algorithms based on space-lling curves behave well on most inputs, while they are untted for some special situations. Therefore, an anal... |

43 | Parallel multigrid in an adaptive PDE solver based on hashing and space-filling curves, Parallel Computing
- Griebel, Zumbusch
- 1999
(Show Context)
Citation Context ...this and other techniques for range searching in computational geometry is given in [1]. Space-lling curves have other locality properties which are e. g. useful in parallelsnite element simulations [=-=3, 7-=-]. Space-lling curves are geometric representations of bijective mappings M : f1; : : : ; N m g ! f1; : : : ; Ng m . The curve M traverses all N m cells in the m-dimensional grid of size N . An (histo... |

34 |
Space-filling curves and their use in the design of geometric data structures
- Asano, Ranjan, et al.
- 1997
(Show Context)
Citation Context ...is tosnd all points located in such multidimensional intervals. Those types of requests are needed in many applications like N-body simulations [12], image compression and browsing [10, 4], databases =-=[2-=-], and contact search insnite element analysis [5]. An overview on this and other techniques for range searching in computational geometry is given in [1]. Space-lling curves have other locality prope... |

31 | Towards optimal locality in mesh-indexings
- Niedermeier, Reinhardt, et al.
- 1997
(Show Context)
Citation Context ...rval to maximum distance within this index range. Results are published for dierent indexing schemes like Hilbert, Lebesgue, and H-indexing for Manhattan metric, Euclidean metric, and maximum metric [=-=6, 9]-=-. Other examinations concentrate on the number of index intervals which have to be determined for a given request region. Sharp results are given in [2] for squares in two-dimensional space. The costs... |

29 |
Provably good partitioning and load balancing algorithms for parallel adaptive n-body simulation
- Teng
- 1998
(Show Context)
Citation Context ...igned bodies of arbitrary size. The aim of the requests is tosnd all points located in such multidimensional intervals. Those types of requests are needed in many applications like N-body simulations =-=[12]-=-, image compression and browsing [10, 4], databases [2], and contact search insnite element analysis [5]. An overview on this and other techniques for range searching in computational geometry is give... |

15 | Parallelizing an unstructured grid generator with a space-filling curve approach
- Behrens, Zimmermann
- 1900
(Show Context)
Citation Context ...this and other techniques for range searching in computational geometry is given in [1]. Space-lling curves have other locality properties which are e. g. useful in parallelsnite element simulations [=-=3, 7-=-]. Space-lling curves are geometric representations of bijective mappings M : f1; : : : ; N m g ! f1; : : : ; Ng m . The curve M traverses all N m cells in the m-dimensional grid of size N . An (histo... |

11 | Multi-Linearization data structure for image browsing. Storage and Retrieval for Image and Video Databases VII
- Yeo, Craver, et al.
- 1999
(Show Context)
Citation Context ...im of the requests is tosnd all points located in such multidimensional intervals. Those types of requests are needed in many applications like N-body simulations [12], image compression and browsing =-=[10, 4-=-], databases [2], and contact search insnite element analysis [5]. An overview on this and other techniques for range searching in computational geometry is given in [1]. Space-lling curves have other... |

8 | An image compression method for spatial search
- Pajarola, Widmayer
- 2000
(Show Context)
Citation Context ...im of the requests is tosnd all points located in such multidimensional intervals. Those types of requests are needed in many applications like N-body simulations [12], image compression and browsing =-=[10, 4-=-], databases [2], and contact search insnite element analysis [5]. An overview on this and other techniques for range searching in computational geometry is given in [1]. Space-lling curves have other... |

6 |
On the quality of space- curve induced partitions. Zeitschrift fur Angewandte Mathematik und Mechanik
- Zumbusch
- 2001
(Show Context)
Citation Context ...]. Here we examine the surface of a partition which is induced by an interval of a space-lling curve. Practical results of this relationship for uniform grids and unstructured meshes can be found in [=-=1-=-3]. We dene a quality coecient which represents a normed value for the quality of the induced partition in an uniform grid of size N N . We use the shape of an optimal partition, the square, as a refe... |

5 |
On the metric properties of discrete space- curves
- Gotsman, Lindenbaum
- 1996
(Show Context)
Citation Context ...rval to maximum distance within this index range. Results are published for dierent indexing schemes like Hilbert, Lebesgue, and H-indexing for Manhattan metric, Euclidean metric, and maximum metric [=-=6, 9]-=-. Other examinations concentrate on the number of index intervals which have to be determined for a given request region. Sharp results are given in [2] for squares in two-dimensional space. The costs... |

4 |
Using space curves for ecient contact searching
- Diekmann, Hungershofer, et al.
- 2000
(Show Context)
Citation Context ...nal intervals. Those types of requests are needed in many applications like N-body simulations [12], image compression and browsing [10, 4], databases [2], and contact search insnite element analysis =-=[5-=-]. An overview on this and other techniques for range searching in computational geometry is given in [1]. Space-lling curves have other locality properties which are e. g. useful in parallelsnite ele... |