Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects...
Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvai...
: In this paper we approach the problems of rounding errors in geometric algorithms. Particularly, we are interested in geometric algorithms used by TerraLib
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...