22 search results - page 5 / 5 » Stabbing Convex Polygons with a Segment or a Polygon |
118
Voted
SODA
1993
ACM
15 years 2 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 ...
133
Voted
WG
2010
Springer
14 years 11 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...