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
Reporting points in halfspaces
Computational Geometry: Theory and Applications
On vertical ray shooting in arrangements
Computational Geometry: Theory and Applications
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Point location among hyperplanes and unidirectional ray-shooting
Computational Geometry: Theory and Applications
Approximations and optimal geometric divide-and-conquer
Selected papers of the 23rd annual ACM symposium on Theory of computing
Derandomization of geometric algorithms
Derandomization of geometric algorithms
Computing faces in segment and simplex arrangements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
Randomized external-memory algorithms for some geometric problems
Proceedings of the fourteenth annual symposium on Computational geometry
Computing Many Faces in Arrangements of Lines and Segments
SIAM Journal on Computing
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
SIAM Journal on Computing
Random Sampling, Halfspace Range Reporting, and Construction of (= k)-Levels in Three Dimensions
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Product range spaces, sensitive sampling, and derandomization
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Dynamic planar convex hull operations in near-logarithmic amortized time
Journal of the ACM (JACM)
Higher order Delaunay triangulations
Computational Geometry: Theory and Applications
Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Constrained higher order Delaunay triangulations
Computational Geometry: Theory and Applications
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Generating realistic terrains with higher-order Delaunay triangulations
Computational Geometry: Theory and Applications - Special issue on the 21st European workshop on computational geometry (EWCG 2005)
On approximate range counting and depth
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Constructing minimum-interference networks
Computational Geometry: Theory and Applications
Output-sensitive algorithms for Tukey depth and related problems
Statistics and Computing
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
Computing hereditary convex structures
Proceedings of the twenty-fifth annual symposium on Computational geometry
Cache-oblivious range reporting with optimal queries requires superlinear space
Proceedings of the twenty-fifth annual symposium on Computational geometry
A general approach for cache-oblivious range reporting and approximate range counting
Proceedings of the twenty-fifth annual symposium on Computational geometry
Constrained higher order Delaunay triangulations
Computational Geometry: Theory and Applications
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
Journal of the ACM (JACM)
Proceedings of the twenty-sixth annual symposium on Computational geometry
A general approach for cache-oblivious range reporting and approximate range counting
Computational Geometry: Theory and Applications
Convex hull of imprecise points in o(n log n) time after preprocessing
Proceedings of the twenty-seventh annual symposium on Computational geometry
Generating realistic terrains with higher-order delaunay triangulations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Constructing interference-minimal networks
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Improved space bounds for cache-oblivious range reporting
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Bounded-degree polyhedronization of point sets
Computational Geometry: Theory and Applications
Convex hull of points lying on lines in o(nlogn) time after preprocessing
Computational Geometry: Theory and Applications
Information Processing Letters
| Hi-index | 0.00 |