Data structures and network algorithms
Data structures and network algorithms
Self-adjusting binary search trees
Journal of the ACM (JACM)
Searching and sorting similar lists
Journal of Algorithms
A linear-time algorithm for triangulating simple polygons
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Incremental Context-Dependent Analysis for Language-Based Editors
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Fractional Cascading: A Data Structuring Technique with Geometric Applications
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Proceedings of the 5th GI-Conference on Theoretical Computer Science
AVL-Trees for Localized Search
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Efficient applicative data types
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Localized search in sorted lists
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Persistent data structures
Making data structures persistent
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Hierarchical representations of collections of small rectangles
ACM Computing Surveys (CSUR)
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Access methods for multiversion data
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Implicitly representing arrangements of lines or segments
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Hidden surface removal for rectangles
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Motion planning in the presence of movable obstacles
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Triangles in space or building (and analyzing) castles in the Air
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A deterministic algorithm for partitioning arrangements of lines and its application
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
A fast planar partition algorithm, II
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Ray shooting and other applications of spanning trees with low stabbing number
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Euclidean minimum spanning trees and bichromatic closest pairs
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
A compendium of key search references
ACM SIGIR Forum
An algorithm for generalized point location and its applications
Journal of Symbolic Computation
A fast planar partition algorithm, II
Journal of the ACM (JACM)
Hidden surface removal with respect to a moving view point
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Dynamic trees and dynamic point location
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Dynamization of the trapezoid method for planar point location (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Dynamic point location in arrangements of hyperplanes
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Uncoupling updating and rebalancing in chromatic binary search trees
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Segment indexes: dynamic indexing techniques for multi-dimensional interval data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects
IEEE Transactions on Pattern Analysis and Machine Intelligence
Persistence, amortization and randomization
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Persistent structures to store moving images
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Journal of the ACM (JACM)
An interactive debugging tool for C based on dynamic slicing and dicing
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Biased finger trees and three-dimensional layers of maxima: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Optimal linear-time algorithm for the shortest illuminating line segment in a polygon
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On point location and motion planning among simplices
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The treatment of state in optimistic systems
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Persistent lists with catenation via recursive slow-down
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Checking geometric programs or verification of geometric structures
Proceedings of the twelfth annual symposium on Computational geometry
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Purely functional representations of catenable sorted lists
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Robust proximity queries: an illustration of degree-driven algorithm design
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Degenerate convex hulls on-line in any fixed dimension
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Deterministic algorithms for 2-d convex programming and 3-d online linear programming
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Methods for achieving fast query times in point location data structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient dynamic point location in monotone planar subdivisions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient algorithms for contour-line extraction and planar graph blocking
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the exact worst case query complexity of planar point location
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Purely functional, real-time deques with catenation
Journal of the ACM (JACM)
I/O-efficient dynamic planar point location (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Linear-time triangulation of a simple polygon made easier via randomization
Proceedings of the sixteenth annual symposium on Computational geometry
Entropy-preserving cuttings and space-efficient planar point location
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A simple entropy-based algorithm for planar point location
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Making data structures confluently persistent
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Relaxed multi-way trees with group updates
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
B+ retake: sustaining high volume inserts into large data pages
Proceedings of the 4th ACM international workshop on Data warehousing and OLAP
Survey of Spatio-Temporal Databases
Geoinformatica
Optimally computing a shortest weakly visible line segment inside a simple polygon
Computational Geometry: Theory and Applications
Reporting intersecting pairs of convex polytopes in two and three dimensions
Computational Geometry: Theory and Applications
Partially persistent data structures of bounded degree with constant update time
Nordic Journal of Computing
Efficient Expected-Case Algorithms for Planar Point Location
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Time and Space Efficient Multi-method Dispatching
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Search Trees with Relaxed Balance and Near-Optimal Height
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Exponential Structures for Efficient Cache-Oblivious Algorithms
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Visibility Queries in Simple Polygons and Applications
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Complexity of Layered Binary Search Trees with Relaxed Balance
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Finding an Optimal Bridge between Two Polygons
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
The Performance of Concurrent Red-Black Tree Algorithms
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Planar Point Location for Large Data Sets: To Seek or Not to Seek
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Persistent Authenticated Dictionaries and Their Applications
ISC '01 Proceedings of the 4th International Conference on Information Security
Efficient visibility queries in simple polygons
Computational Geometry: Theory and Applications
Proximate planar point location
Proceedings of the nineteenth annual symposium on Computational geometry
External memory data structures
Handbook of massive data sets
Pursuing a Petaflop: Point Designs for 100 TF Computers Using PIM Technologies
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Relaxed multi-way trees with group updates
Journal of Computer and System Sciences - Special issu on PODS 2001
Single and bulk updates in stratified trees: an amortized and worst-case analysis
Computer Science in Perspective
Functional Pearl trouble shared is trouble halved
Haskell '03 Proceedings of the 2003 ACM SIGPLAN workshop on Haskell
Planar point location for large data sets: to seek or not to seek
Journal of Experimental Algorithmics (JEA)
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Making data structures confluently persistent
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
I/O-efficient point location using persistent B-trees
Journal of Experimental Algorithmics (JEA)
I/O-efficient dynamic planar point location
Computational Geometry: Theory and Applications
Efficient computation of query point visibility in polygons with holes
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Fossilized index: the linchpin of trustworthy non-alterable electronic records
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
ACM SIGGRAPH 2005 Papers
Tight bounds for connecting sites across barriers
Proceedings of the twenty-second annual symposium on Computational geometry
Isosurface Extraction and Spatial Filtering using Persistent Octree (POT)
IEEE Transactions on Visualization and Computer Graphics
Range mode and range median queries on lists and trees
Nordic Journal of Computing
Point set stratification and Delaunay depth
Computational Statistics & Data Analysis
Label updating to avoid point-shaped obstacles in fixed model
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
A simple entropy-based algorithm for planar point location
ACM Transactions on Algorithms (TALG)
Guard placement for efficient point-in-polygon proofs
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Query point visibility computation in polygons with holes
Computational Geometry: Theory and Applications
In-place 2-d nearest neighbor search
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Distribution-sensitive point location in convex subdivisions
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A survey of persistent data structures
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
The complexity of the outer face in arrangements of random segments
Proceedings of the twenty-fourth annual symposium on Computational geometry
External memory planar point location with logarithmic updates
Proceedings of the twenty-fourth annual symposium on Computational geometry
Optimal location of transportation devices
Computational Geometry: Theory and Applications
Versioning Tree Structures by Path-Merging
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Towards a definition of higher order constrained Delaunay triangulations
Computational Geometry: Theory and Applications
Succinct geometric indexes supporting point location queries
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection
Proceedings of the twenty-fifth annual symposium on Computational geometry
The geodesic farthest-site Voronoi diagram in a polygonal domain with holes
Proceedings of the twenty-fifth annual symposium on Computational geometry
Space---Query-Time Tradeoff for Computing the Visibility Polygon
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Executing code in the past: efficient in-memory object graph versioning
Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications
Going off-road: transversal complexity in road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
The 2-center problem in three dimensions
Proceedings of the twenty-sixth annual symposium on Computational geometry
Super-efficient aggregating history-independent persistent authenticated dictionaries
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection
Computational Geometry: Theory and Applications
Hausdorff distance under translation for points and balls
ACM Transactions on Algorithms (TALG)
Geodesic Fréchet distance inside a simple polygon
ACM Transactions on Algorithms (TALG)
Testing 2-vertex connectivity and computing pairs of vertex-disjoint s-t paths in digraphs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithms and theory of computation handbook
A static optimality transformation with applications to planar point location
Proceedings of the twenty-seventh annual symposium on Computational geometry
Authenticated Dictionaries: Real-World Costs and Trade-Offs
ACM Transactions on Information and System Security (TISSEC)
Confluent persistence revisited
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Developments in data structure research during the first 25 years of FSTTCS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Covering a set of points with a minimum number of lines
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Succinct geometric indexes supporting point location queries
ACM Transactions on Algorithms (TALG)
Nearest-neighbor searching under uncertainty
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Entropy, triangulation, and point location in planar subdivisions
ACM Transactions on Algorithms (TALG)
Locating two obnoxious facilities using the weighted maximin criterion
Operations Research Letters
Cuttings for disks and axis-aligned rectangles
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Space/query-time tradeoff for computing the visibility polygon
Computational Geometry: Theory and Applications
Improved implementation of point location in general two-dimensional subdivisions
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
The 2-center problem in three dimensions
Computational Geometry: Theory and Applications
A near-optimal algorithm for shortest paths among curved obstacles in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Dynamic planar point location with sub-logarithmic local updates
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 48.22 |
A classical problem in computational geometry is the planar point location problem. This problem calls for preprocessing a polygonal subdivision of the plane defined by n line segments so that, given a sequence of points, the polygon containing each point can be determined quickly on-line. Several ways of solving this problem in O(log n) query time and O(n) space are known, but they are all rather complicated. We propose a simple O(log n)-query-time, O(n)-space solution, using persistent search trees. A persistent search tree differs from an ordinary search tree in that after an insertion or deletion, the old version of the tree can still be accessed. We develop a persistent form of binary search tree that supports insertions and deletions in the present and queries in the past. The time per query or update is O(log m), where m is the total number of updates, and the space needed is O(1) per update. Our planar point location algorithm is an immediate application of this data structure. The structure also provides an alternative to Chazelle's "hive graph" structure, which has a variety of applications in geometric retrieval.