349 search results - page 13 / 70 » Covering a Set of Points with a Minimum Number of Lines |
HPCC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Service discovery is a crucial feature for the usability of mobile ad-hoc networks (MANETs). In this paper, Minimum Dominating Forward Node Set based Service Discovery Pr...
VLDB
1990
ACM
13 years 12 months ago
1990
ACM
In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight li...
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
The number of minimum pseudo-triangulations is minimized for point sets in convex position. 2004 Elsevier B.V. All rights reserved.
JUCS
2007
13 years 7 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
FSTTCS
2007
Springer
14 years 2 months ago
2007
Springer
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...