15 search results - page 1 / 3 » Isotopy of Polygonal Domains for Generalized Polygons |
EJC
1998
13 years 7 months ago
1998
in Proceedings of EuroCG, Berlin, M¨arz 2001, pp. 142–145. [14] Branched coverings, triangulations, and 3-manifolds, (mit Ivan Izmestiev). Adv. Geometry, 3:191–225, 2003. [15]...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), it is known that the geodesic diameter is determined...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
COMPGEOM
2011
ACM
12 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...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We consider the existence and efficient construction of bounded curvature paths traversing constant-width regions of the plane, called corridors. We make explicit a width threshol...