22 search results - page 5 / 5 » Stabbing Convex Polygons with a Segment or a Polygon |
SODA
1993
ACM
13 years 6 months 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 ...
WG
2010
Springer
13 years 3 months ago
2010
Springer
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...