Nonrobustness is a well-known problem in many areas of computational science. Until now, robustness techniques and the construction of robust algorithms have been the province of experts in this eldâ€¦ (More)

We investigate the computational problems associated with combinatorial surfaces. Specifically, we present an algorithm (based on the Brahana-Dehn-Heegaard approach) for transforming the polygonalâ€¦ (More)

The potato-peeling problem asks for the largest convex polygon contained inside a given simple polygon. We give an O(n 7) time algorithm to this problem, answering a question of Goodman. We also giveâ€¦ (More)

Let X be a given set of n circular and straight line segments in the plane where two segments may interest only at their endpoints. We introduce a new technique that computes the Voronoi diagram of Xâ€¦ (More)

Exact computation is assumed in most algorithms in computational geometry. In practice, implementors perform computation in some fixed-precision model, usually the machine floating-point arithmetic.â€¦ (More)