32 search results - page 5 / 7 » Minimum blocking sets of circles for a set of lines in the p... |
SIGGRAPH
1987
ACM
13 years 10 months ago
1987
ACM
In the course of developing a system for fitting smooth curves to camera input we have developed several direct (i.e. noniterative) methods for fitting a shape (line, circle, conic...
SODA
1993
ACM
13 years 8 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 ...
PCM
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Content retrieval of scanned line drawing images is a difficult problem, especially from real-life large scale databases. Existing algorithms don’t work well due to th...
ISAAC
2009
Springer
14 years 1 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
COMGEO
2010
ACM
13 years 7 months ago
2010
ACM
A highway H is a line in the plane on which one can travel at a greater speed than in the remaining plane. One can choose to enter and exit H at any point. The highway time distanc...