Next:
Parallel Transitive Closure and
Up:
Online Library of Jeff
Previous:
CXHist: An On-line Classification-based
COMPUTATIONAL GEOMETRY
Parallel Transitive Closure and Point Location in Planar Structures
Optimal Cooperative Search in Fractional Cascaded Data Structures
Approximation Algorithms for Geometric Median Problems
A Simplified Technique for Hidden-Line Elimination in Terrains
External-Memory Computational Geometry
Indexing for Data Models with Constraints and Classes
The Object Complexity Model for Hidden-Surface Elimination
Binary Space Partitions for Fat Rectangles
Efficient 3-D Range Searching in External Memory
Optimal External Memory Interval Management
Communication Issues in Large-Scale Geometric Computation
Practical Techniques for Constructing Binary Space Partitions for Orthogonal Rectangles
Cylindrical Static and Kinetic Binary Space Partitions
I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking
Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems
Efficient Searching with Linear Constraints
Scalable Sweep-Based Spatial Join
Constructing Binary Space Partitions for Orthogonal Rectangles in Practice
Efficient Bulk Operations on Dynamic R-trees
I/O-Efficient Dynamic Point Location in Monotone Subdivisions
A Parallel Algorithm for Planar Orthogonal Grid Drawings
On Two-Dimensional Indexability and Optimal Range Search Indexing
Online Data Structures in External Memory
A Unified Approach for Indexed and Non-Indexed Spatial Joins
I/O-Efficient Algorithms for Problems on Grid-Based Terrains
CAMEL: Concept Annotated iMagE Libraries
External Memory Algorithms and Data Structures: Dealing with Massive Data
Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data
Efficient Join Processing over Uncertain-Valued Attributes
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing
Algorithms and Data Structures for External Memory
--
main reference!
Jeff Vitter
2009-11-09
