Sorting Jordan sequences in linear time using level-linked search trees
Information and Control
Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
A fast planar partition algorithm, II
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
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
Symbolic treatment of geometric degeneracies
Journal of Symbolic Computation
Applications of random sampling to on-line algorithms in computational geometry
Discrete & Computational Geometry
An efficient approach to removing geometric degeneracies
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
Four results on randomized incremental constructions
Computational Geometry: Theory and Applications
An Algorithm for Convex Polytopes
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
Checking geometric programs or verification of geometric structures
Proceedings of the twelfth annual symposium on Computational geometry
Robust proximity queries: an illustration of degree-driven algorithm design
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Fast and numerically stable parametric alignment of biosequences
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Degenerate convex hulls on-line in any fixed dimension
Proceedings of the fourteenth annual symposium on Computational geometry
Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Topological Sweep in Degenerate Cases
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
An Easy to Use Implementation of Linear Perturbations within CGAL
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Exact Computation of 4-D Convex Hulls with Perturbation and Acceleration
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
Sliver-free perturbation for the Delaunay tetrahedrization
Computer-Aided Design
Topological sweep of the complete graph
Discrete Applied Mathematics
Using three-valued logic to specify and verify algorithms of computational geometry
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Algorithms for vector graphic optimization and compression
CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
Dependable polygon-processing algorithms for safety-critical embedded systems
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Computer Science Review
Analytical aspects of tie breaking
Theoretical Computer Science
| Hi-index | 0.02 |