31 search results - page 3 / 7 » Bilattice-Based Squares and Triangles |
COMBINATORICS
2006
13 years 5 months ago
2006
In two dimensions, a polyform is a finite set of edge-connected cells on a square, triangular, or hexagonal grid. A layer is the set of grid cells that are vertex-adjacent to the ...
COMBINATORICS
2002
13 years 5 months ago
2002
The n-th Heilbronn number, Hn, is the largest value such that n points can be placed in the unit square in such a way that all possible triangles defined by any three of the point...
SCA
2007
13 years 8 months ago
2007
We present a simple yet powerful approach for the generation and rendering of surfaces defined by the boundary of a three-dimensional point cloud. First, a depth map plus internal...
CORR
1999
Springer
13 years 5 months ago
1999
Springer
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be rotated into any member of S. We present a hinged dissection...
ICIP
2001
IEEE
14 years 7 months ago
2001
IEEE
In this paper, we introduce a completely new approach to fitting rectangles and squares to given closed regions using our published ideas in [6], [7], [8]. In these papers, we hav...