Computing envelopes in four dimensions with applications
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
Immobilizing polygons against a wall
Proceedings of the eleventh annual symposium on Computational geometry
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
Proceedings of the eleventh annual symposium on Computational geometry
Fast rendering of irregular grids
Proceedings of the 1996 symposium on Volume visualization
New lower bounds for convex hull problems in odd dimensions
Proceedings of the twelfth annual symposium on Computational geometry
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
Improvements on bottleneck matching and related problems using geometry
Proceedings of the twelfth annual symposium on Computational geometry
Space-time tradeoffs for emptiness queries (extended abstract)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximate nearest neighbor queries revisited
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Proceedings of the fourteenth annual symposium on Computational geometry
Geometric applications of a randomized optimization technique
Proceedings of the fourteenth annual symposium on Computational geometry
An exact interactive time visibility ordering algorithm for polyhedral cell complexes
VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
On the all-pairs Euclidean short path problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Efficient generation of k-directional assembly sequences
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for layered manufacturing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Finite-resolution hidden surface removal
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Sweeping simple polygons with a chain of guards
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A cell probe lower bound for dynamic nearest-neighbor searching
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Segment intersection searching problems in general settings
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids
IEEE Transactions on Visualization and Computer Graphics
Approximation algorithms for the bottleneck stretch factor problem
Nordic Journal of Computing
Approximation Algorithms for the Bottleneck Stretch Factor Problem
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Hausdorff distance under translation for points and balls
Proceedings of the nineteenth annual symposium on Computational geometry
On lines avoiding unit balls in three dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Ray shooting and stone throwing with near-linear storage
Computational Geometry: Theory and Applications
Pianos are not flat: rigid motion planning in three dimensions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Ray shooting amid balls, farthest point from a line, and range emptiness searching
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
Proceedings of the twenty-second annual symposium on Computational geometry
Approximation algorithms for spreading points
Journal of Algorithms
Robust, generic and efficient construction of envelopes of surfaces in three-dimensional spaces
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
Computational Geometry: Theory and Applications
Approximating nearest neighbor among triangles in convex position
Information Processing Letters
Dynamic ham-sandwich cuts in the plane
Computational Geometry: Theory and Applications
Processing an Offline Insertion-Query Sequence with Applications
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Ray shooting and stone throwing with near-linear storage
Computational Geometry: Theory and Applications
Computing the visibility map of fat objects
Computational Geometry: Theory and Applications
Linear data structures for fast ray-shooting amidst convex polyhedra
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Hausdorff distance under translation for points and balls
ACM Transactions on Algorithms (TALG)
Algorithms and theory of computation handbook
The union of colorful simplices spanned by a colored point set
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Approximate polytope membership queries
Proceedings of the forty-third annual ACM symposium on Theory of computing
Semialgebraic Range Reporting and Emptiness Searching with Applications
SIAM Journal on Computing
Approximate nearest neighbor search for low dimensional queries
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Polyline fitting of planar points under min-sum criteria
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Nearest-neighbor searching under uncertainty
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Computing the visibility map of fat objects
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
The union of colorful simplices spanned by a colored point set
Computational Geometry: Theory and Applications
A faster algorithm for computing motorcycle graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |