Sciweavers

90 search results - page 8 / 18
» Many holes in hindley-milner
Sort
View
COMPGEOM
2004
ACM
14 years 25 days ago
Approximate convex decomposition of polygons
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 ...
Jyh-Ming Lien, Nancy M. Amato
CCCG
2003
13 years 8 months ago
Coloring Objects Built From Bricks
We address a question posed by Sibley and Wagon. They proved that rhombic Penrose tilings in the plane can be 3colored, but a key lemma of their proof fails in the natural 3D gene...
Suzanne Gallagher, Joseph O'Rourke
WSCG
2004
185views more  WSCG 2004»
13 years 8 months ago
Automatic Fitting and Control of Complex Freeform Shapes in 3-D
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
Yu Song, Joris S. M. Vergeest, Chensheng Wang
SIGGRAPH
2010
ACM
13 years 7 months ago
Designing a new toy to fit other toy pieces: a shape-matching toy design based on existing building blocks
: Shape-matching toys are popular items for infants, and consist of boxes with many holes in different shapes along with corresponding blocks of the same shapes. To play with the t...
Yuki Igarashi, Hiromasa Suzuki
ASPLOS
2006
ACM
14 years 1 months ago
Combinatorial sketching for finite programs
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
Armando Solar-Lezama, Liviu Tancau, Rastislav Bod&...