346 search results - page 41 / 70 » Isodiametric Problems for Polygons |
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
ICRA
2003
IEEE
14 years 3 months ago
2003
IEEE
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...
ICTAI
2000
IEEE
14 years 2 months ago
2000
IEEE
In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is proposed to maintain the Euclidean spatial con...
ISPD
2000
ACM
14 years 2 months ago
2000
ACM
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
CORR
2002
Springer
13 years 9 months ago
2002
Springer
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...