Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer  Home/Search
Context Related
| informatik.unifreibur...report36.ps.gz 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 From: informatik.unifreibur...complete (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We look at the problem: Given a set M of n d-dimensional intervals, find two d- dimensional intervals S, T , such that all intervals in M are enclosed by S or by T , the distribution is balanced and the intervals S and T fulfill a geometric criterion, e.g. like minimum area sum. Up to now no polynomial time algorithm was known for that problem. We present an O(dn log n + d 2 n 2d\Gamma1 ) algorithm for finding an optimal solution. 1 Introduction Throughout the years, ... (Update)
Context of citations to this paper: More
...a given query region. A significant body of literature dealing with improving dynamic and static Rtrees exits [1, 2, 4, 8, 9, 7, 10, 13, 14, 17, 16, 22, 24, 26, 27]. For large data sets a single R tree may prove insufficient at providing interactive response times....
...a given query region. A significant body of literature dealing with improving dynamic and static Rtrees exits [1, 2, 4, 8, 7, 9, 12, 13, 16, 15, 20, 22, 25, 26]. For large data sets a single Rtree may prove insufficient at providing interactive response times. Parallelism...
Cited by: More
Trajectory Queries and Octagons - In Moving Object (Correct)
On R-trees with low query complexity - de Berg, Gudmundsson, Hammar.. (2001) (Correct)
An Image Compression Method for Spatial Search - Pajarola, Widmayer (2000) (Correct)
Active bibliography (related documents): More All
0.5: Layered Environment-Map Impostors for Arbitrary Scenes - Stefan Jeschke Institute (2002) (Correct)
0.0: Closest-Point Problems in Computational Geometry - Smid (1997) (Correct)
0.0: Computing the Smallest k-Enclosing Circle and Related Problems - Efrat, Sharir, Ziv (1994) (Correct)
Similar documents based on text: More All
0.4: An Optimal Algorithm for Approximating a Set of.. - Becker.. (1991) (Correct)
0.3: An Asymptotically Optimal Multiversion B-Tree - Widmayer, Becker, al. (Correct)
0.2: Virtual Reality and Geoinformation Systems - Pajarola, al. (1997) (Correct)
Related documents from co-citation: More All
7: tree: an efficient and Robust Access Method for Points and Rectangles (context) - Beckmann, Kriegel et al. - 1990
7: Toward an Analysis of Range Query Performance in Spatial Data Structures - Pagel, Six et al. - 1993
5: Fractals for Secondary Key Retrieval - Faloutsos, Roseman - 1989
BibTeX entry: (Update)
B. Becker, P. Franciosa, S. Gschwind, T. Ohler, G. Thiemt, and P. Widmayer. Enclosing many boxes by an optimal pair of boxes. In Proc. of the 9th Annual Symposium on Theoretical Aspects of Computer Science STACS, volume 577, pages 475--486, Cachan, 1992. Springer-Verlag. Lecture Nores in Computer Science. http://citeseer.ist.psu.edu/becker92enclosing.html More
@inproceedings{ becker92enclosing,
author = "Bruno Becker and Paolo Giulio Franciosa and Stephan Gschwind and Thomas Ohler and Gerald Thiemt and Peter Widmayer",
title = "Enclosing Many Boxes by an Optimal Pair of Boxes",
booktitle = "Symposium on Theoretical Aspects of Computer Science",
pages = "475-486",
year = "1992",
url = "citeseer.ist.psu.edu/becker92enclosing.html" }
Citations (may not include all citations):765 trees: A dynamic index structure for spatial searching (context) - Guttman - 1984
516 tree: An efficient and robust access method for points and r.. (context) - Beckmann, Kriegel et al. - 1990
508 Computational Geometry (context) - Preparata, Shamos - 1985
38 An implementation and performance analysis of spatial access.. (context) - Greene - 1989
27 points with minimum diameter and related problems (context) - Aggarwal, Imai et al. - 1989
2 An optimal algorithm for approximating a set of rectangles b.. - Becker, Franciosa et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.uni-freiburg.de/tr/complete.html): More
Approximation and Existential Second-Order Logic - Ihler (1990) (Correct)
New Methodes for Sequential Hashing with Supertrace - Eckerle, Lais (Correct)
Parallel Searching on m Rays - Hammar, Nilsson, Schuierer (2001) (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