Deltahedra

Results: 206



#Item
41When Can a Net Fold to a Polyhedron?  Therese Biedly Anna Lubiwy

When Can a Net Fold to a Polyhedron? Therese Biedly Anna Lubiwy

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2003-06-20 15:58:43
42Eurographics/ ACM SIGGRAPH Symposium on Computer AnimationD. Metaxas and J. Popovic (Editors) Arbitrary Cutting of Deformable Tetrahedralized Objects Eftychios Sifakis† Stanford University

Eurographics/ ACM SIGGRAPH Symposium on Computer AnimationD. Metaxas and J. Popovic (Editors) Arbitrary Cutting of Deformable Tetrahedralized Objects Eftychios Sifakis† Stanford University

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2010-09-08 13:39:20
43A Simple Probablistic Algorithm for Approximating Two and Three-dimensional Objects 1  Binhai Zhu 2

A Simple Probablistic Algorithm for Approximating Two and Three-dimensional Objects 1 Binhai Zhu 2

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2003-06-20 16:00:52
44CCCG 2011, Toronto ON, August 10–12, 2011  A Topologically Convex Vertex-Ununfoldable Polyhedron Zachary Abel∗  Erik D. Demaine†

CCCG 2011, Toronto ON, August 10–12, 2011 A Topologically Convex Vertex-Ununfoldable Polyhedron Zachary Abel∗ Erik D. Demaine†

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:16
45CCCG 2011, Toronto ON, August 10–12, 2011  A Topologically Convex Vertex-Ununfoldable Polyhedron Zachary Abel∗  Erik D. Demaine†

CCCG 2011, Toronto ON, August 10–12, 2011 A Topologically Convex Vertex-Ununfoldable Polyhedron Zachary Abel∗ Erik D. Demaine†

Add to Reading List

Source URL: zacharyabel.com

Language: English - Date: 2012-12-19 11:02:07
46CCCG 2010, Winnipeg MB, August 9–11, 2010  Bounded-Degree Polyhedronization of Point Sets Gill Barequet Martin L. Demaine

CCCG 2010, Winnipeg MB, August 9–11, 2010 Bounded-Degree Polyhedronization of Point Sets Gill Barequet Martin L. Demaine

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 10:46:16
47CCCG 2011, Toronto ON, August 10–12, 2011  Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel∗  Erik D. Demaine†

CCCG 2011, Toronto ON, August 10–12, 2011 Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel∗ Erik D. Demaine†

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:14
48PHYSICAL REVIEW E 81, 041310 共2010兲  Exact constructions of a family of dense periodic packings of tetrahedra 1  S. Torquato1,2,3,4,5,6 and Y. Jiao6

PHYSICAL REVIEW E 81, 041310 共2010兲 Exact constructions of a family of dense periodic packings of tetrahedra 1 S. Torquato1,2,3,4,5,6 and Y. Jiao6

Add to Reading List

Source URL: cherrypit.princeton.edu

Language: English - Date: 2010-04-30 10:53:52
49Geometry from around the world The following open problem appeared on the National College Entrance Examination of China (2002): Given two identical equilateral triangle pieces of cardboard, cut one into several pieces t

Geometry from around the world The following open problem appeared on the National College Entrance Examination of China (2002): Given two identical equilateral triangle pieces of cardboard, cut one into several pieces t

Add to Reading List

Source URL: www.curriculumsupport.education.nsw.gov.au

Language: English - Date: 2009-11-11 21:37:54
50CCCG 2011, Toronto ON, August 10–12, 2011  A Topologically Convex Vertex-Ununfoldable Polyhedron Zachary Abel∗  Erik D. Demaine†

CCCG 2011, Toronto ON, August 10–12, 2011 A Topologically Convex Vertex-Ununfoldable Polyhedron Zachary Abel∗ Erik D. Demaine†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:16