279 search results - page 6 / 56 » Implicit Convex Polygons |
COMPGEOM
2011
ACM
12 years 11 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...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
COMPGEOM
1999
ACM
13 years 12 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 ...
SIGGRAPH
1997
ACM
13 years 11 months ago
1997
ACM
Morse theory shows how the topology of an implicit surface is affected by its function’s critical points, whereas catastrophe theory shows how these critical points behave as th...
SIGGRAPH
1995
ACM
13 years 11 months ago
1995
ACM
A method is presented to broaden implicit surface modeling. The implicit surfaces usually employed in computer graphics are two dimensional manifolds because they are defined by r...