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
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)
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Computing faces in segment and simplex arrangements
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
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
Proceedings of the sixteenth annual symposium on Computational geometry
Algorithms for congruent sphere packing and applications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Optimal Polygon Cover Problems and Applcations
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Optimal Beam Penetrations in Two and Three Dimensions
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Translating a Planar Object to Maximize Point Containment
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Computing large planar regions in terrains, with an application to fracture surfaces
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Line Facility Location in Weighted Regions
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Line Segment Facility Location in Weighted Subdivisions
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Efficient method for maximizing bichromatic reverse nearest neighbor
Proceedings of the VLDB Endowment
Fréchet Distance Problems in Weighted Regions
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Geometric optimization and sums of algebraic functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Line facility location in weighted regions
Journal of Combinatorial Optimization
Maximizing bichromatic reverse nearest neighbor for Lp-norm in two- and three-dimensional spaces
The VLDB Journal — The International Journal on Very Large Data Bases
Computing shortest paths amid pseudodisks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Geometric optimization and sums of algebraic functions
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |