349 search results - page 21 / 70 » Covering a Set of Points with a Minimum Number of Lines |
COMPGEOM
1990
ACM
13 years 12 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
DCG
2010
13 years 8 months ago
2010
Let L be a set of n lines in Rd , for d 3. A joint of L is a point incident to at least d lines of L, not all in a common hyperplane. Using a very simple algebraic proof techniqu...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
3DPVT
2006
IEEE
13 years 11 months ago
2006
IEEE
We present a novel method for recovering the 3D-line structure of a scene from multiple widely separated views. Traditional optimization-based approaches to line-based structure f...
GD
2006
Springer
13 years 11 months ago
2006
Springer
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...