Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns.Expand

The Sandwich algorithm approximates a convex function of one variable over an interval by evaluating the function and its derivative at a sequence of points.Different versions of the Sandwich algorithm use different rules for selecting the next evaluation point.Expand

The subject of this paper are algorithms for measuring similarity of patterns of line segments in the plane, a standard problem in, e.g. computer vision, geographic information systems, etc.Expand

We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on theâ€¦ Expand