Prosenjit Gupta, Ravi Janardan, Michiel Smid  Home/Search
Context
Related
| scs.carleton.ca/~mi...dshandbook.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: scs.carleton.ca/~michi...research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: e updates more eciently than simply recomputing the data structure from scratch after each update, while simultaneously maintaining fast query response times. We call these problems standard intersection searching problems in order to distinguish them from the generalized intersection searching problems that are the focus of this chapter. Due to their numerous applications, standard intersection searching problems have been the subject of much study and ecient solutions have been devised for... (Update)
Active bibliography (related documents): More All
1.0: Geometric Range Searching and Its Relatives - Agarwal, Erickson (1999) (Correct)
0.8: Significant-Presence Range Queries in Categorical Data - de Berg, Haverkort (2004) (Correct)
0.7: Algorithms for Some Intersection Searching Problems.. - Gupta, Janardan, Smid (1998) (Correct)
Similar documents based on text: More All
1.1: Algorithms for Some Intersection Searching Problems.. - Gupta, Janardan, Smid (1995) (Correct)
0.7: A Technique for Adding Range Restrictions to Generalized.. - Gupta, Janardan, Smid (1996) (Correct)
0.6: Connected Component and Simple Polygon - Pankaj (1994) (Correct)
BibTeX entry: (Update)
@misc{ gupta-computational,
author = "Prosenjit Gupta and Ravi Janardan and Michiel Smid",
title = "Computational Geometry: Generalized Intersection Searching",
url = "citeseer.ist.psu.edu/599118.html" }
Citations (may not include all citations):481 Algorithms in Combinatorial Geometry (context) - Edelsbrunner - 1987
229 Computational Geometry: Algorithms and Applications (context) - de Berg, van Kreveld et al. - 2000
133 Geometric range searching and its relatives - Agarwal, Erickson - 1999
129 Making data structures persistent (context) - Driscoll, Sarnak et al. - 1989
106 Priority search trees (context) - McCreight - 1985
67 A data structuring technique (context) - Chazelle, Guibas - 1986
60 The power of geometric duality (context) - Chazelle, Guibas et al. - 1985
60 Decomposable searching problems I: Static-to-dynamic transfo.. (context) - Bentley, Saxe - 1980
59 External memory algorithms and data structures: dealing with.. - Vitter - 2001
38 Adding range restriction capability to dynamic data structur.. (context) - Willard, Lueker - 1985
18 Ecient partition trees (context) - Matou - 1992
17 On ray shooting in convex polytopes (context) - Matou, Schwarzkopf - 1993
14 Generalized intersection searching problems (context) - Janardan, Lopez - 1993
11 Range searching with ecient hierarchical cuttings (context) - Matou - 1993
11 Further results on generalized intersection searching proble.. (context) - Gupta, Janardan et al. - 1995
11 Algorithms for ray-shooting and intersection searching (context) - Cheng, Janardan - 1992
10 Cutting hyperplane arrangements (context) - Matou - 1991
5 New Results on Data Structures in Computational Geometry (context) - van Kreveld - 1992
5 Polygon and connected component intersection searching (context) - Agarwal, van Kreveld - 1996
5 New results on intersection query problems (context) - Bozanis, Kitsios et al. - 1997
4 Ecient algorithms for counting and reporting pairwise inters.. (context) - Gupta, Janardan et al. - 1999
3 New upper bounds for generalized intersection searching prob.. (context) - Bozanis, Kitsios et al. - 1995
3 Algorithms for generalized halfspace range searching and oth.. (context) - Gupta, Janardan et al. - 1996
2 Range searching in categorical data: Colored range searching.. (context) - Agarwal, Govindarajan et al. - 2002
1 Red-blue intersection reporting for objects of non-constant .. (context) - Bozanis, Kitsios et al. - 1996
1 Two-dimensional substring indexing - Ferragina, Koudas et al. - 2001
1 Ecient algorithms and data structures for geometric intersec.. (context) - Gupta - 1995
1 Ecient dynamic algorithms for some geometric intersection pr.. (context) - Cheng, Janardan - 1990
1 Reporting intersecting pairs of convex polytopes in two and .. (context) - Agarwal, de Berg et al. - 2002
1 Algorithms for some intersection searching problems involvin.. - Gupta, Janardan et al. - 1999
1 A technique for adding range restrictions to generalized sea.. - Gupta, Janardan et al. - 1997
1 Ecient algorithms for document retrieval problems (context) - Muthukrishnan - 2002
Documents on the same site (http://www.scs.carleton.ca/~michiel/research.html): More
Multi-criteria geometric optimization problems in.. - Majhi, Janardan.. (2000) (Correct)
Approximating the stretch factor of Euclidean paths, cycles.. - Narasimhan, Smid (1999) (Correct)
Geometric Algorithms for Layered Manufacturing - Smid (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