Computational geometry: an introduction
Computational geometry: an introduction
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
The input/output complexity of sorting and related problems
Communications of the ACM
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Cutting hyperplane arrangements
Discrete & Computational Geometry
Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems
SIAM Journal on Computing
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
Dynamic point location in arrangements of hyperplanes
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
Greed sort: optimal deterministic sorting on parallel disks
Journal of the ACM (JACM)
Computing faces in segment and simplex arrangements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A fully-dynamic data structure for external substring search
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On computing Voronoi diagrams by divide-prune-and-conquer
Proceedings of the twelfth annual symposium on Computational geometry
Strategic directions in storage I/O issues in large-scale computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Efficient external memory algorithms by simulating coarse-grained parallel algorithms
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
On sorting strings in external memory (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
BSP-Like External-Memory Computation
CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
Supporting I/O-efficient scientific computation in TPIE
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On range reporting, ray shooting and k-level construction
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
I/O-efficient dynamic planar point location (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
The Input, Preparation, and Distribution of Data for Parallel GIS Operations (Research Note)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
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
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
External memory data structures
Handbook of massive data sets
Handbook of massive data sets
Planar point location for large data sets: to seek or not to seek
Journal of Experimental Algorithmics (JEA)
I/O-efficient point location using persistent B-trees
Journal of Experimental Algorithmics (JEA)
Engineering a compact parallel delaunay algorithm in 3D
Proceedings of the twenty-second annual symposium on Computational geometry
I/O-efficient algorithms for computing planar geometric spanners
Computational Geometry: Theory and Applications
External memory planar point location with logarithmic updates
Proceedings of the twenty-fourth annual symposium on Computational geometry
I/O-efficient construction of constrained delaunay triangulations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
I/O-Efficient algorithms on near-planar graphs
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |