Entre autres, les patrons
des parallÃ©lÃ©pipÃ¨des rectangles.
In 1887, Lord Kelvin asked how to partition space into cells of volume 1 such that the total area of the interfaces between the cells is a minimum. The best partition Kelvin could come up with was made of slightly curved 14-sided polyhedra. Two of Kelvin's tetrakaidecahedra are pictured here:
If one magnifies a point of a soap film, one gets a tangent cone. Recall that a cone is composed of rays emanating from a point.
By George W. Hart
by Klaus Ã. Mogensen
I've noticed that the characteristic polynomials of symmetric figures are more factorable than asymmetric figures. (adjacency matrix )
In 1887, Lord Kelvin asked how to partition space into cells of volume 1 such that the total area of the interfaces between the cells is a minimum. For over a century, nobody could improve on Kelvin's partition. Then in 1993, Denis Weaire and Robert Phelan came up with a partition of space into two kinds of cells (of equal volume, of course) that beat Kelvin's partition by 0.3% in area.
Jorge Rezende - Mathematical Physics Group (GFMUL) University or Lisbon
On the Puzzles with polyhedra and numbers, Polyhedron puzzles and groups, Photos of polyhedron puzzles
(Patrons de polytopes)
At the end of the 19th century, the interest in geometry gave place to the construction of geometrical models of surfaces. These models were mostly designed by mathematicians and made of different materials such as plaster, wood or string...
Drs Irene Polo Blanco, together with Lotte van der Zalm, have made an inventory of this collection and have put the information on this website.
PAGES PERSONNELLES - HOME PAGES
The Bellows Conjecture - Consider a polyhedral surface in three-space that has the property that it can change its shape while keeping all its polygonal faces congruent. Adjacent faces are allowed to rotate along common edges. Mathematically exact flexible surfaces were found by Connelly in 1978. But the question remained as to whether the volume bounded by such surfaces was necessarily constant during the flex.
EXEMPLES - EXAMPLES
is the solution to a very interesting problem. The question is how many polyhedra exist such that every pair of vertices is joined by an edge. The first clear example is the well known tetrahedron (triangular pyramid). Some simple combinatorics specify how many vertices, edges, faces, and holes such polyhedra must have.
In 1977, Hungarian mathematician Lajos Szilassi found a way to construct a toroidal heptahedron. Each face of his polyhedron is a hexagon (although none of them is a regular hexagon).
Klaus Steffen took the construction of flexible polyhedron one step further by constructing a symmetric flexible Connelly sphere
with only 9 verticies.
Bricard's flexible octahedra
The flexible octahedron in figure 3 cannot be made with surfaces
Robert Connelly was looking for an answer to the following question: is convexity necessary for rigidity?
diagrams for the construction of two flexor models (left model : Robert Connelly, right : Klaus Steffen)
Geometry arising from the simultaneous comparison of multiple DNA or protein sequences.
LOGICIELS - SOFTWARES
The site is here to tell you about my programs Great Stella and Small Stella, but I hope it will be of interest to anyone with an interest in polyhedra. There are lots of photos of polyhedra I've made using these programs, along with tips for building them.
is an interactive program for the modelling of liquid surfaces shaped by various forces and constraints. The program is available free of charge.
OUTILS - TOOLS
is a self-contained ANSI C implementation of the reverse search algorithm for vertex enumeration/convex hull problems.
is a collection of routines for analyzing polytopes and polyhedra. The polyhedra are either given as the convex hull of a set of points plus (possibly) the convex cone of a set of vectors, or as a system of linear equations and inequalities.
- A library of polyhedral functions
I R I S A
Polylib is a free library written in C for the manipulation of polyhedra. The library is operating on objects like vectors, matrices, lattices, polyhedra, Z-polyhedra, unions of polyhedra and a lot of other intermediary structures. It provides functions for all the important operations on these structures.
(Chernikova's algorithm, Ehrhart's polynomials)
are software environments for designing and building paper sculpture using polyhedra and custom variants of polyhedra.
LIVRES - BOOKS
SUJETS - SUBJECTS
Thierry Lambre Univ. Bl. Pascal Les CÃ©zeaux Clermt-F.
DOCUMENTS - PAPERS
journÃ©es X-UPS 1995 Ãcole Polytechnique
Matrices hermitiennes et convexitÃ© (M. Audin). Polytopes convexes entiers (M. Brion). Construction de courbes rÃ©elles (J.-J. Risler). Volumes mixtes des corps convexes (B. Teissier)
COURS - COURSES
J.-M. Sarlat, Acad. Poitiers
E.M. Feichtner, K. Fukuda and P. Parrilo
JEUX - GAMES
This page describes a Rubik-style puzzle I made out of cardboard. To be honest, it really doesn't work very smoothly!
QUESTIONS - FAQ
GROUPES DE DISCUSSION - NEWS
In 1977, the Hungarian mathematician Lajos Szilassi found a way to construct a seven sided toroidal polyhedron.
some quite interesting maps among the other Archimedean polytopes
FIRMES - FIRMS
to cut out and build yourself
LIENS - LINKS
From the Geometry Junkyard, computational and recreational geometry pointers.