99 search results - page 17 / 20 » On empty convex polygons in a planar point set |
ISAAC
2007
Springer
15 years 5 months ago
2007
Springer
We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al. [2, 12]. In this model, in one pass the input stream can be scanned to ...
105
click to vote
SODA
1993
ACM
15 years 27 days ago
1993
ACM
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
ICRA
1994
IEEE
15 years 3 months ago
1994
IEEE
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
SODA
2001
ACM
15 years 29 days ago
2001
ACM
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...