346 search results - page 19 / 70 » Isodiametric Problems for Polygons |
170
Voted
FOCS
1997
IEEE
15 years 11 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
249
click to vote
COMPGEOM
2011
ACM
14 years 11 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
171
click to vote
IVC
2007
15 years 7 months ago
2007
This paper tackles the problem of the computation of a planar polygonal curve from a digital planar curve, such that the digital data can be exactly retrieved from the polygonal c...
182
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
212
click to vote
PG
2007
IEEE
16 years 1 months ago
2007
IEEE
We introduce a novel mechanism for creating line drawings from three-dimensional models, which captures the dynamic nature of the drawing process. The approach takes into account ...