A subexponential bound for linear programming
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Ray shooting in convex polytopes
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Global visibility algorithms for illumination computations
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Efficient piecewise-linear function approximation using the uniform metric: (preliminary version)
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
On lazy randomized incremental construction
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
A survey of linear programming in randomized subexponential time
ACM SIGACT News
New lower bounds for convex hull problems in odd dimensions
Proceedings of the twelfth annual symposium on Computational geometry
On computing Voronoi diagrams by divide-prune-and-conquer
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
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient approximation and optimization algorithms for computational metrology
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Deterministic algorithms for 2-d convex programming and 3-d online linear programming
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Average case analysis of dynamic geometric optimization
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Random sampling in geometric optimization: new insights and applications
Proceedings of the sixteenth annual symposium on Computational geometry
Linear programming queries revisited
Proceedings of the sixteenth annual symposium on Computational geometry
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
Proceedings of the sixteenth annual symposium on Computational geometry
Randomizing combinatorial algorithms for linear programming when the dimension is moderately high
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Explicit and implicit enforcing: randomized optimization
Computational Discrete Mathematics
Simple randomized algorithms for closest pair problems
Nordic Journal of Computing
An efficient randomized algorithm for the closest pair problem on colored point sets
Nordic Journal of Computing
In-Place Planar Convex Hull Algorithms
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Irregularities of Distribution, Derandomization, and Complexity Theory
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Reconstruction of Animated Models from Images Using Constrained Deformable Surfaces
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Incremental constructions con BRIO
Proceedings of the nineteenth annual symposium on Computational geometry
Sublinear geometric algorithms
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A linear incremental algorithm for naive and standard digital lines and planes recognition
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
Multi-pass geometric algorithms
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Helly-type theorems for approximate covering
Proceedings of the twenty-fourth annual symposium on Computational geometry
Markov incremental constructions
Proceedings of the twenty-fourth annual symposium on Computational geometry
Output-sensitive algorithms for Tukey depth and related problems
Statistics and Computing
Spatial Skyline Queries: An Efficient Geometric Algorithm
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Approximating centroids for the maximum intersection of spherical polygons
Computer-Aided Design
Algorithms and theory of computation handbook
Reducing PAPR by selecting optimal wavelet tree structure in WOFDM
Computers and Electrical Engineering
Analytical description of digital circles
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Spatial skyline queries: exact and approximation algorithms
Geoinformatica
ESA'11 Proceedings of the 19th European conference on Algorithms
Unique sink orientations of grids
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Superimposing voronoi complexes for shape deformation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |