279 search results - page 4 / 56 » Implicit Convex Polygons |
CCCG
2003
13 years 9 months ago
2003
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
ISAAC
1999
Springer
13 years 12 months ago
1999
Springer
This paper considers recon gurations of polygons, where each polygon edge is a rigid link, no two of which can cross during the motion. We prove that one can recon gure any monoton...
JCDCG
2000
Springer
13 years 11 months ago
2000
Springer
A k-dissection D of a polygon P, is a partition of P into a set of subpolygons {Q1, . . . , Qm} with disjoint interiors such that these can be reassembled to form k polygons P1, ....
IJCGA
2006
13 years 7 months ago
2006
CG
2005
Springer
13 years 7 months ago
2005
Springer
This article discusses an enhanced polygonization algorithm for variational implicit surfaces. The polygonization scheme is a simple hierarchical adaptation of the Marching Cubes ...