568 search results - page 2 / 114 » Regular Polygon Detection |
CCCG
2003
13 years 7 months ago
2003
We explore an instance of the question of partitioning a polygon into pieces, each of which is as “circular” as possible, in the sense of having an aspect ratio close to
CCCG
2006
13 years 7 months ago
2006
Suppose intruders are in a dark polygonal room and they can move at a finite but unbounded speed, trying to avoid detection. A boundary 1-searcher can move along the polygon bounda...
SIAMCO
2010
13 years 1 months ago
2010
This work is devoted to stationary optimal control problems with polygonal constraints on the components of the state. Existence of Lagrange multipliers, of different regularity, i...
EJC
2008
13 years 6 months ago
2008
This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons)...
JCDCG
1998
Springer
13 years 10 months ago
1998
Springer
We study the minimum number g(m, n) (respectively, p(m, n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygo...