115 search results - page 20 / 23 » Refolding planar polygons |
IMAMS
2007
13 years 8 months ago
2007
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...
CCCG
2006
13 years 8 months ago
2006
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
IJCGA
2000
13 years 7 months ago
2000
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
JCO
2010
13 years 5 months ago
2010
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
PR
1998
13 years 7 months ago
1998
—We introduce a class of planar arcs and curves, called tame arcs, which is general enough to describe (parts of) the boundaries of planar real objects. A tame arc can have smoot...