COMPGEOM
2011
ACM
13 years 4 months ago
2011
ACM
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
COMGEO
2008
ACM
14 years 20 hour ago
2008
ACM
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...
TJS
2002
14 years 2 days ago
2002
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...
JMMA
2002
14 years 3 days ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
GC
2007
Springer
14 years 11 days ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
COMPGEOM
1999
ACM
14 years 4 months ago
1999
ACM
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical ...
CEC
2009
IEEE
14 years 7 months ago
2009
IEEE
— We examine the problem of partitioning a square into convex polygons which are as circular as possible. Circular means that the polygon’s aspect ratio is supposed to be near