346 search results - page 10 / 70 » Isodiametric Problems for Polygons |
STOC
1999
ACM
13 years 11 months ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
TIP
1998
13 years 7 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
CCCG
2003
13 years 8 months ago
2003
A decomposition of a polygon P is a set of polygons whose geometric union is exactly P. We consider the problem of decomposing a polygon, which may contain holes, using subpolygon...
IWANN
2001
Springer
13 years 11 months ago
2001
Springer
It is presented in this paper a new approach to the problem of feature extraction. The approach is based on the edge detection, where a set of feature vectors is taken from the sou...
COMPGEOM
2004
ACM
14 years 24 days ago
2004
ACM
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...