We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O n 4c 2c (3c)c +...
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
In their paper on delineating boundaries from geographic data, Reinbacher et al. [9] use a recolouring method to reclassify points so that the boundaries that separate points of d...
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...