Efficient Delaunay triangulation using rational arithmetic
ACM Transactions on Graphics (TOG)
Numerical stability of algorithms for line arrangements
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Static analysis yields efficient exact integer arithmetic for computational geometry
ACM Transactions on Graphics (TOG)
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Computing exact geometric predicates using modular arithmetic with single precision
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Software reliability via run-time result-checking
Journal of the ACM (JACM)
Interval arithmetic yields efficient dynamic filters for computational geometry
Proceedings of the fourteenth annual symposium on Computational geometry
Exact geometric predicates using cascaded computation
Proceedings of the fourteenth annual symposium on Computational geometry
Online computation and competitive analysis
Online computation and competitive analysis
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
A core library for robust numeric and geometric computation
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
The influence of caches on the performance of sorting
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Algebraic methods and arithmetic filtering for exact predicates on circle arcs
Proceedings of the sixteenth annual symposium on Computational geometry
A new constructive root bound for algebraic expressions
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library
The STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Verifiable implementations of geometric algorithms using finite precision arithmetic
Verifiable implementations of geometric algorithms using finite precision arithmetic
Safe and effective determinant evaluation
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
A Separation Bound for Real Algebraic Expressions
Algorithmica
Hi-index | 0.00 |