Ali R. Boroujerdi Naval Research Laboratory 4555 Overlook Avenue S.W....  Home/Search
Context Related
| unm.edu/~moret/persistency.ps 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: unm.edu/~moret/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show how persistence can be used to solve a number of geometric problems where preprocessing is required to facilitate query answering. Efficient solutions for most of the problems discussed already exist in the literature; however, persistence provides an efficient and conceptually simpler alternative to existing solutions. 1 Introduction Suppose we have a collection of geometric objects and are asked to report those satisfying a given property with respect to a query object (not... (Update)
Cited by: More
Persistent data structures Haim Kaplan - Tel Aviv University (Correct)
Active bibliography (related documents): More All
0.3: Dynamic Algorithms in Computational Geometry - Chiang, Tamassia (1992) (Correct)
0.2: IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED.. - Jason Cong Fellow (Correct)
0.2: An Implicit Connection Graph Maze Routing Algorithm for ECO.. - Cong, Fang, Khoo (1999) (Correct)
Similar documents based on text: More All
0.1: Several geometric data structures for objects in the plane .. - Describe And Analyze (Correct)
0.1: Network Routing Models Applied To Aircraft Routing.. - Chen, Holle, Moret.. (1995) (Correct)
0.1: Spatial Data Structures in Simulation and Planning - Ali Boroujerdi (Correct)
BibTeX entry: (Update)
A. Boroujerdi and B. Moret. Persistence in computational geometry. In Proc. 7th Canadian Conf. Comp. Geometry (CCCG 95), pages 241-246, 1995. http://citeseer.ist.psu.edu/boroujerdi95persistence.html More
@misc{ boroujerdi95persistence,
author = "A. Boroujerdi and B. Moret",
title = "Persistence in computational geometry",
text = "A. Boroujerdi and B. Moret. Persistence in computational geometry. In Proc.
7th Canadian Conf. Comp. Geometry (CCCG 95), pages 241-246, 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/boroujerdi95persistence.html" }
Citations (may not include all citations):129 Making data structures persistent (context) - Driscoll, Sarnak et al. - 1989
116 Planar point location using persistent search trees (context) - Sarnak, Tarjan - 1986
106 Priority search trees (context) - McCreight - 1985
69 Filtering search: A new approach to query answering (context) - Chazelle - 1986
46 Decomposable searching problems (context) - Bentley - 1979
39 A data structure for orthogonal range queries (context) - Lueker - 1978
25 An optimal worst-case algorithm for reporting intersections .. (context) - Bentley, Wood - 1980
20 Dynamic data structures for orthogonal intersection queries (context) - Edelsbrunner - 1980
17 New data structures for orthogonal range queries (context) - Willard - 1985
16 Algorithms from P to NP (context) - Moret, Shapiro - 1991
4 Computing point enclosures (context) - Vaishnavi - 1982
Documents on the same site (http://www.cs.unm.edu/~moret/papers.html): More
Joint Routing in Networks - Boroujerdi, Dong, Ma, Moret (1993) (Correct)
Network Routing Models Applied To Aircraft Routing.. - Chen, Holle, Moret.. (1995) (Correct)
Improved Lower Bounds for the Link Length of Rectilinear.. - Collins, Moret (1997) (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