Skip to search formSkip to main contentSkip to account menu

Experimental evaluation and cross-benchmarking of univariate real solvers

This paper is focused on the comparison of black-box implementations of state-of-the-art algorithms for isolating real roots of univariate polynomials over the integers and indicates that for most instances the solvers based on Continued Fractions are among the best methods.
View on ACM (opens in a new tab)

A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons

We give an exact geometry kernel for conic arcs, algorithms for exact computation with low-degree algebraic numbers, and an algorithm for computing the arrangement of conic arcs that immediately…
View via Publisher (opens in a new tab)

Engineering Art Galleries

This work describes this work, shows the chronology of developments, and compares current algorithms, including two unpublished versions, in an exhaustive experiment, to show what core algorithmic ingredients have led to recent successes.
View PDF on arXiv (opens in a new tab)

Efficient Computation of Visibility Polygons

New implementations, and corresponding experimental evaluations, are reported on for two established and one novel algorithm for computing visibility polygons, as a new package for the Computational Geometry Algorithms Library (CGAL).
View PDF on arXiv (opens in a new tab)

Which children can find a way through a strange town using a streetmap? – results of an empirical study on children's orientation competence

This article relates about some results of an interdisciplinary research project analyzing influencing factors of children's spatial orientation competence in real space carried out by geography…
View on Taylor & Francis (opens in a new tab)

Educational Standards in Geography for the Intermediate School Certificate : with sample assignments. 2. English edition

Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!

Two approaches to the problem of calculating a cell in a 3- dimensional arrangement of quadrics are presented, one of which operates directly in 3-space by applying classical solid modeling techniques and the other with the help of verified floating point arithmetic.
View on ACM (opens in a new tab)

Distributed cohesive control for robot swarms: Maintaining good connectivity in the presence of exterior forces

A set of local continuous algorithms that together produce a generalization of a Euclidean Steiner tree are proposed, which scales well, is robust against node failures, and performs close to the best known approximation bound for a corresponding centralized static optimization problem.
View on IEEE (opens in a new tab)

High Precision Conservative Surface Mesh Generation for Swept Volumes

A novel, efficient, and flexible scheme to generate a high-quality mesh that approximates the outer boundary of a swept volume that is able to handle inputs of high complexity and compute an approximation with a very high precision, which is demonstrated on real industrial data sets.
View on IEEE (opens in a new tab)

Effective Computational Geometry for Curves and Surfaces

We present the first release of the C++ libraries of the Exacus project of the Max-PlanckInstitut für Informatik. We explain the structure of the libraries and the software design for the numerics…
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)