346 search results - page 23 / 70 » Isodiametric Problems for Polygons |
DAM
2008
13 years 7 months ago
2008
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
CCCG
2010
13 years 8 months ago
2010
So far, the best result in running time for solving the fixed watchman route problem (i.e., shortest path for viewing any point in a simple polygon with given start point) is O(n3...
WSCG
2004
13 years 8 months ago
2004
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
IJCGA
2007
13 years 7 months ago
2007
: We study the problem of fixturing a chain of hinged objects in a given placement with frictionless point contacts. We define the notions of immobility and robust immobility, wh...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for bui...