346 search results - page 34 / 70 » Isodiametric Problems for Polygons |
CCCG
2007
13 years 11 months ago
2007
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edg...
JGS
2006
13 years 9 months ago
2006
Map comparison techniques based on a pixel-by-pixel comparison are useful for many purposes, but fail to reveal important aspects of map similarities and differences. In contrast, ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...
WADS
2007
Springer
14 years 3 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
APGV
2004
ACM
14 years 1 months ago
2004
ACM
In this paper, we consider the problem of determining feature saliency for 3D objects and describe a series of experiments that examined if salient features exist and can be predi...