349 search results - page 22 / 70 » Covering a Set of Points with a Minimum Number of Lines |
COMBINATORICA
2004
13 years 7 months ago
2004
Consider a k-element subset P of the plane. It is known that the maximum number of sets similar to P that can be found among n points in the plane is (n2 ) if and only if the cros...
WG
2010
Springer
13 years 6 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...
DAC
1995
ACM
13 years 11 months ago
1995
ACM
In this paper we present a set cover based approach (SCP) to multi-way partitioning for minimum delay for Look-Up Table based FPGAs. SCP minimizes the number of chip-crossings on ...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply structured compared to its competitors. The presented algori...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...