279 search results - page 28 / 56 » Implicit Convex Polygons |
LATIN
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
IJCGA
2010
13 years 5 months ago
2010
For a set T of n points in a metric space (X, d), a point y X is dominated by a point x X if d(x, t) d(y, t) for all t T and there exists t T such that d(x, t ) < d(y, t )....
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...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
In this paper, we present an algorithm that utilizes a quadtree data structure to construct a strictly convex quadrilateral mesh for a simple polygonal region in which no newly cr...
CCCG
2003
13 years 9 months ago
2003
We consider the problem of finding the shortest curve in the plane that has unit width. This problem was first posed as the “river shore” puzzle by Ogilvy (1972) and is rela...