Mark H. Overmars, Michiel H.M. Smid, Mark T. de Berg, Marc L. van Kreveld  Home/Search
Context Related
| archive.cs.uu.nl/pub/RUU/...198720.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: cs.uu.nl/resear...EAR=&AUTH=&GRP= (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Range trees can be used for solving the orthogonal range searching problem, a problem that has applications in e.g. databases and computer graphics. (Update)
Context of citations to this paper: More
...two techniques derived from B trees and a generalized version of red black trees. Smid [151] Overmars, Smid, de Berg and van Kreveld [128] and Smid and Overmars [157] consider the problem of maintaining range trees in secondary memory. They give a number of schemes to...
...in core algorithms do not map to secondary storage in as smooth a fashion as balanced binary trees map to B trees. For example, [27,34] examine mappings which maintain the logarithmic overheads and make the logarithms base B; however, their algorithms do not compact the...
Cited by: More
Reconstruction Problem - Smid, Torenvliet (1987) (Correct)
Path Caching: A Technique for Optimal External Searching.. - Ramaswamy, Subramanian (1994) (Correct)
Indexing for Data Models with Classes and Constraints - Ramaswamy (1994) (Correct)
Active bibliography (related documents): More All
0.0: Revised version of "Efficient Cross-Trees for External Memory" - Grossi, Italiano (2000) (Correct)
0.0: Maintaining range .trees in secondary memory Part II.. - Ruu-Cs-.. (1987) (Correct)
0.0: Persistence in Computational Geometry - Ali Boroujerdi Naval (1995) (Correct)
Similar documents based on text: More All
0.8: The P-range tree: A new data structure for range searching.. - Subramanian, al. (1995) (Correct)
0.4: A Technique for Adding Range Restrictions to Generalized.. - Gupta, Janardan, Smid (1996) (Correct)
0.3: Selected Topics in Data Structures - Smid (1998) (Correct)
Related documents from co-citation: More All
7: H-trees: A Dynamic Associative Search Index for OODB (context) - Low, Ooi et al. - 1992
7: The Ubiquitous B-tree (context) - Comer - 1979
7: Dynamic Algorithms in Computational Geometry - Chiang, Tamassia - 1992
BibTeX entry: (Update)
M. H. Overmars, M. H. M. Smid, M. T. de Berg, and M. J. van Kreveld, "Maintaining Range Trees in Secondary Memory: Part I: Partitions," Acta Informatica 27 (1990), 423--452. http://citeseer.ist.psu.edu/overmars87maintaining.html More
@misc{ overmars90maintaining,
author = "M. Overmars and M. Smid and M. de Berg and M. van Kreveld",
title = "Maintaining Range Trees in Secondary Memory: Part I: Partitions",
text = "M. H. Overmars, M. H. M. Smid, M. T. de Berg, and M. J. van Kreveld, Maintaining
Range Trees in Secondary Memory: Part I: Partitions, Acta Informatica 27
(1990), 423--452.",
year = "1990",
url = "citeseer.ist.psu.edu/overmars87maintaining.html" }
Citations (may not include all citations):46 Decomposable Searching Problems (context) - Bentley - 1979 DBLP
1 Organisation and Maintenance of Large Or- dereel Indezes (context) - Bayer, McCreight - 1972
1 Average Number oRebalancing Operation Weight Balanced Tree (context) - Mehlhorn, Average et al. - 1980
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uu.nl/research/techreps/techreps.php?submit=show+reports&YEAR=&AUTH=&GRP=): More
On the Two-Level Uncapacitated Facility Location Problem - Aardal, Labbé (1995) (Correct)
A Tourist Guide through Treewidth - Bodlaender (1993) (Correct)
Predictive Probabilistic Models for Treatment Planning in.. - Peek (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC