Sciweavers

JCT
2011
84views more  JCT 2011»
13 years 1 months ago
Enumerating isodiametric and isoperimetric polygons
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
Michael J. Mossinghoff
IJRR
2010
84views more  IJRR 2010»
13 years 4 months ago
Grasping Non-stretchable Cloth Polygons
In this paper, we examine non-stretchable 2D polygonal cloth, and place bounds on the number of fingers needed to immobilize it. For any non-stretchable cloth polygon, it is alwa...
Matthew P. Bell, Devin J. Balkcom
ICRA
2010
IEEE
102views Robotics» more  ICRA 2010»
13 years 4 months ago
Immobilizing 2D serial chains in form closure grasps
: 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...
Elon Rimon, A. Frank van der Stappen
IJRR
2002
129views more  IJRR 2002»
13 years 5 months ago
Deformable Free-Space Tilings for Kinetic Collision Detection
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
Pankaj K. Agarwal, Julien Basch, Leonidas J. Guiba...
ALGORITHMICA
1998
143views more  ALGORITHMICA 1998»
13 years 5 months ago
On Minimum-Area Hulls
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
Esther M. Arkin, Yi-Jen Chiang, Martin Held, Josep...
COMGEO
2004
ACM
13 years 6 months ago
Kinetic collision detection between two simple polygons
We design a kinetic data structure for detecting collisions between two simple polygons in motion. In order to do so, we create a planar subdivision of the free space between the ...
Julien Basch, Jeff Erickson, Leonidas J. Guibas, J...
CG
2005
Springer
13 years 6 months ago
A new algorithm for Boolean operations on general polygons
A new algorithm for Boolean operations on general planar polygons is presented. It is available for general planar polygons (manifold or non-manifold, with or without holes). Edge...
Yu Peng, Jun-Hai Yong, Wei-Ming Dong, Hui Zhang, J...
JC
2007
57views more  JC 2007»
13 years 6 months ago
Discrepancy with respect to convex polygons
We study the problem of discrepancy of finite point sets in the unit square with respect to convex polygons, when the directions of the edges are fixed, when the number of edges ...
W. W. L. Chen, G. Travaglini
IJCGA
2007
76views more  IJCGA 2007»
13 years 6 months ago
Immobilizing Hinged Polygons
: We study the problem of fixturing a chain of hinged objects in a given placement with frictionless point contacts. We define the notions of immobility and robust immobility, wh...
Jae-Sook Cheong, A. Frank van der Stappen, Kenneth...
JCT
2006
46views more  JCT 2006»
13 years 6 months ago
Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite
We prove that the anisotropic generating function of self-avoiding polygons is not a D-finite function--proving a conjecture of Guttmann [Discrete Math. 217 (2000) 167
Andrew Rechnitzer