We give a linear-time algorithm for computing the medial axis of a simple polygon P, This answers a long-standing open question|previously, the best deterministic algorithm ran in O(n log n) time. Weâ€¦ (More)

In this paper, we first define a new Voronoi diagram for the endpoints of a set of line segments in the plane which do not intersect (except possibly at their endpoints), which is called aâ€¦ (More)

In this paper, we present an Î˜(n) time worst-case deterministic algorithm for finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple n-sided polygon in the plane.â€¦ (More)

In this paper, we investigate various properties and problems associated with the maximum weight triangulation of a po the plane. We prove that the weight of a maximum weight triangulation of anyâ€¦ (More)

In this paper we present a linear-time approximation scheme for determining the maximum weight triangulation of a convex polygon. Our algorithm is simple and can be implemented easily.