Planar point location using persistent search trees
Communications of the ACM
Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Optimal point location in a monotone subdivision
SIAM Journal on Computing
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
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
Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Four results on randomized incremental constructions
Computational Geometry: Theory and Applications
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
How good are convex hull algorithms?
Computational Geometry: Theory and Applications
On degeneracy in geometric computations
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Algorithm Design and Software Libraries: Recent Developments in the LEDA Project
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
A computational basis for higher-dimensional computational geometry and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A Skeptic’s Approach to Combining HOL and Maple
Journal of Automated Reasoning
Upward Planarity Checking: ``Faces Are More than Polygons''
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
The reliable algorithmic software challenge RASC
Computer Science in Perspective
Online geometric reconstruction
Proceedings of the twenty-second annual symposium on Computational geometry
An efficient local approach to convexity testing of piecewise-linear hypersurfaces
Computational Geometry: Theory and Applications
The reliable algorithmic software challenge RASC
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Triangulations of line segment sets in the plane
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Efficient and accurate computation of upper bounds of approximation errors
Theoretical Computer Science
Online geometric reconstruction
Journal of the ACM (JACM)
| Hi-index | 0.00 |