An algorithm for approximate closest-point queries
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Almost optimal set covers in finite VC-dimension: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
An efficient algorithm for terrain simplification
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Surface approximation and geometric partitions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for projective clustering
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Controlled Topology Simplification
IEEE Transactions on Visualization and Computer Graphics
Locally Toleranced Surface Simplification
IEEE Transactions on Visualization and Computer Graphics
Linear time approximation of 3D convex polytopes
Computational Geometry: Theory and Applications
Approximation algorithms for projective clustering
Journal of Algorithms
Automatic generation of triangular irregular networks using greedy cuts
VIS '95 Proceedings of the 6th conference on Visualization '95
Improved approximation algorithms for geometric set cover
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Guarding galleries and terrains
Information Processing Letters
Succinct approximate convex pareto curves
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Hausdorff approximation of 3D convex polytopes
Information Processing Letters
Small-size ε-nets for axis-parallel rectangles and boxes
Proceedings of the forty-first annual ACM symposium on Theory of computing
Epsilon nets and union complexity
Proceedings of the twenty-fifth annual symposium on Computational geometry
Near-linear approximation algorithms for geometric hitting sets
Proceedings of the twenty-fifth annual symposium on Computational geometry
On the set multi-cover problem in geometric settings
Proceedings of the twenty-fifth annual symposium on Computational geometry
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
SIAM Journal on Computing
Approximate polytope membership queries
Proceedings of the forty-third annual ACM symposium on Theory of computing
VC-dimension and shortest path algorithms
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Polytope approximation and the Mahler volume
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved bound for the union of fat triangles
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Optimal area-sensitive bounds for polytope approximation
Proceedings of the twenty-eighth annual symposium on Computational geometry
On the set multicover problem in geometric settings
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |