346 search results - page 6 / 70 » Isodiametric Problems for Polygons |
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
COMPGEOM
2004
ACM
14 years 24 days ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
ICRA
2010
IEEE
13 years 5 months ago
2010
IEEE
: The immobilization of non-rigid objects is currently an active research area in robotics. This paper explores the problem by studying the immobilization of serial chains of rigid...
ICCSA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
DCG
2000
13 years 7 months ago
2000
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...