349 search results - page 40 / 70 » Covering a Set of Points with a Minimum Number of Lines |
IVC
2000
13 years 7 months ago
2000
Feature matching is a prerequisite to a wide variety of vision tasks. This paper presents a method that addresses the problem of matching disparate views of coplanar points and li...
FUZZIEEE
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— Many spatial phenomena exhibit vagueness. Representation of such phenomena requires vague objects. In previous work, we provided definitions for vague objects: vague p...
SODA
1992
ACM
13 years 9 months ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
IJCGA
2008
13 years 8 months ago
2008
Given a set P of points (clients) in the plane, a Euclidean 2-centre of P is a set of two points (facilities) in the plane such that the maximum distance from any client to its ne...
CCCG
2007
13 years 9 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...