A Unified Approach for Indexed and Non-Indexed Spatial Joins
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Distribution Sweeping on Clustered Machines with Hierarchical Memories
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Extending Rectangle Join Algorithms for Rectilinear Polygons
WAIM '00 Proceedings of the First International Conference on Web-Age Information Management
Exponential Structures for Efficient Cache-Oblivious Algorithms
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Cache Oblivious Distribution Sweeping
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Approximation Techniques for Indexing Two-Dimensional Constraint Databases
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
On Multi-way Spatial Joins with Direction Predicates
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
LEDA-SM Extending LEDA to Secondary Memory
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
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
I/O-Efficient Well-Separated Pair Decomposition and Its Applications
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
The Sort/Sweep Algorithm: A New Method for R-tree Based Spatial Joins
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
External memory planar point location with logarithmic updates
Proceedings of the twenty-fourth annual symposium on Computational geometry
Fundamental parallel algorithms for private-cache chip multiprocessors
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Cache-Oblivious Red-Blue Line Segment Intersection
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Optimal halfspace range reporting in three dimensions
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A parallel plane sweep algorithm for multi-core systems
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
The complexity of flow on fat terrains and its i/o-efficient computation
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
I/O-efficient map overlay and point location in low-density subdivisions
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
I/O-efficient point location in a set of rectangles
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
I/O-efficient batched union-find and its applications to terrain analysis
ACM Transactions on Algorithms (TALG)
Cleaning massive sonar point clouds
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Geometric algorithms for private-cache chip multiprocessors
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
External-memory algorithms and data structures
Algorithms and theory of computation handbook
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Efficient viewshed computation on terrain in external memory
Geoinformatica
FIFO indexes for decomposable problems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On finding skylines in external memory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Geospatial overlay computation on the GPU
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
I/O-efficient construction of constrained delaunay triangulations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Ordered and unordered top-K range reporting in large data sets
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Self-improving algorithms for coordinate-wise maxima
Proceedings of the twenty-eighth annual symposium on Computational geometry
Stabbing horizontal segments with vertical rays
Proceedings of the twenty-eighth annual symposium on Computational geometry
A scalable algorithm for maximizing range sum in spatial databases
Proceedings of the VLDB Endowment
Computational geometry in the parallel external memory model
SIGSPATIAL Special
Worst-Case I/O-Efficient Skyline Algorithms
ACM Transactions on Database Systems (TODS)
Cache and I/O efficent functional algorithms
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient bulk updates on multiversion B-trees
Proceedings of the VLDB Endowment
A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers
Theory of Computing Systems
| Hi-index | 0.00 |
In this paper we give new techniques for designing efficient algorithms for computational geometry problems that are too large to be solved in internal memory. We use these techniques to develop optimal and practical algorithms for a number of important large-scale problems. We discuss our algorithms primarily in the context of single processor/single disk machines, a domain in which they are not only the first known optimal results but also of tremendous practical value. Our methods also produce the first known optimal algorithms for a wide range of two-level and hierarchical multilevel memory models, including parallel models. The algorithms are optimal both in terms of I/O cost and internal computation.