Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Efficient planar convex hull algorithm
Image and Vision Computing
The ultimate planar convex hull algorithm
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
C++ primer
Efficient Delaunay triangulation using rational arithmetic
ACM Transactions on Graphics (TOG)
On properties of floating point arithmetics: numerical stability and the cost of accurate computations
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
Exact geometric computation in LEDA
Proceedings of the eleventh annual symposium on Computational geometry
Static analysis yields efficient exact integer arithmetic for computational geometry
ACM Transactions on Graphics (TOG)
Robust proximity queries: an illustration of degree-driven algorithm design
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Interval arithmetic yields efficient dynamic filters for computational geometry
Proceedings of the fourteenth annual symposium on Computational geometry
A strong and easily computable separation bound for arithmetic expressions involving square roots
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Algorithm 523: CONVEX, A New Convex Hull Algorithm for Planar Sets [Z]
ACM Transactions on Mathematical Software (TOMS)
Methods and Applications of Interval Analysis (SIAM Studies in Applied and Numerical Mathematics) (Siam Studies in Applied Mathematics, 2.)
Comments on convex hull of a finite set of points in two dimensions
Information Processing Letters
An Easy to Use Implementation of Linear Perturbations within CGAL
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
The Design and Implementation of Planar Maps in CGAL
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
An Adaptable and Extensible Geometry Kernel
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Applications of the Generic Programming Paradigm in the Design of CGAL
Selected Papers from the International Seminar on Generic Programming
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
| Hi-index | 0.00 |
We report on experiments on the performance of various geometry kernels for the two-dimensional convex hull problem. We consider how programming techniques and the choice of geometric representation affect performance. In particular we investigate the cost of exact computation. We use C++ as the implementation language. Our experiments are largely based on CGAL.