Sciweavers

31 search results - page 3 / 7
» Bilattice-Based Squares and Triangles
Sort
View
77
Voted
COMBINATORICS
2006
122views more  COMBINATORICS 2006»
14 years 10 months ago
Adding Layers to Bumped-Body Polyforms with Minimum Perimeter Preserves Minimum Perimeter
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 ...
Winston C. Yang
COMBINATORICS
2002
62views more  COMBINATORICS 2002»
14 years 10 months ago
New Lower Bounds for Heilbronn Numbers
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...
Francesc Comellas, J. Luis A. Yebra
100
Voted
SCA
2007
15 years 20 days ago
Screen space meshes
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...
Matthias Müller, Simon Schirm, Stephan Duthal...
CORR
1999
Springer
105views Education» more  CORR 1999»
14 years 10 months ago
Hinged Dissection of Polyominoes and Polyforms
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...
Erik D. Demaine, Martin L. Demaine, David Eppstein...
ICIP
2001
IEEE
15 years 12 months ago
A new efficient algorithm for fitting of rectangles and squares
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...
Herbert Süße, Klaus Voss