Polyhedron - PDFSEARCH.IO - Document Search Engine

Polyhedron
Results: 478

#	Item
31	MiMa Mathematics in the Making Project nLLP– 1-IT-COMENIUS-CMP MiMa Toolkit March 2015 Add to Reading List Source URL: www.mathematicsinthemaking.eu Language: English - Date: 2015-04-10 06:26:59 Geometry Convex geometry Euclidean geometry Platonic solids Deltahedra Polyhedra Planar graphs Dice Regular icosahedron Nontransitive dice Polyhedron Icosahedron
32	The Triangle Closure is a Polyhedron Amitabh Basu∗ Robert Hildebrand† Matthias K¨oppe‡ Add to Reading List Source URL: www.ams.jhu.edu Language: English - Date: 2013-01-16 20:59:43
33	Geombinatorics), 165 – 171 A convex polyhedron which is not equifacettable Branko Grünbaum Department of Mathematics, Box Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2003-07-12 11:24:35
34	POLYHEDRON PUZZLES AND GROUPS JORGE REZENDE 1. Introduction Consider a polyhedron. For example, a platonic, an archimedean, or a dual of an archimedean polyhedron. Construct flat polygonal plates in Add to Reading List Source URL: gfm.cii.fc.ul.pt Language: English - Date: 2006-11-10 04:57:26
35	Geombinatorics), 43 – 48. A starshaped polyhedron with no net Branko Grünbaum Department of Mathematics, BoxUniversity of Washington Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2003-07-12 10:43:53
36	A library to manipulate Z-polyhedron in image representation Guillaume Iooss, Sanjay Rajopadhye Colorado State University January 23, 2012 Add to Reading List Source URL: impact.gforge.inria.fr Language: English - Date: 2015-06-05 05:18:37
37	A Topologically Convex Vertex-Ununfoldable Polyhedron Zachary Abel, Erik D. Demaine, and Martin L. Demaine, CCCG 2011 Add to Reading List Source URL: zacharyabel.com - Date: 2016-01-24 17:37:27
38	A Topologically Convex Vertex-Ununfoldable Polyhedron Zachary Abel1 Erik D. Demaine2 1 MIT Add to Reading List Source URL: zacharyabel.com Language: English - Date: 2016-01-24 17:37:27
39	EuroCG’08, Nancy – March 18-20, 2008 A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron Nina Amenta∗ Dominique Attali† Add to Reading List Source URL: www.gipsa-lab.grenoble-inp.fr Language: English - Date: 2012-12-15 14:15:54
40	Parallel Volume Computation of Massive Polyhedron Union W. Randolph Franklin∗ Abstract We present a parallel implementation of UNION3, an algorithm for computing the volume, surface area, center of mass, or similar pro Add to Reading List Source URL: www-cs.engr.ccny.cuny.edu Language: English - Date: 2013-10-11 17:03:10