We address ourselves to three types of combinatorial and projective problems, all of which concern the patterns of faces, edges and vertices of polyhedra. These patterns, as combinatorial structures, we call combinatorial oriented polyhedra. Which patterns can be realized in space with plane faces, bent along every edge, and how can these patterns be generated topologlcally? Which polyhedra are constructed in space by a series of single or double truncations on the smallest polyhedron of the type (for example from the tetrahedron for spherical polyhedra)? Which plane line drawings portraying the edge graph of a combinatorial polyhedron are actually the projection of the edges of a plane-faced polyhedron in space? Wherever possible known re...
Faces play a central role in the combinatorial and computational aspects ofpolyhedra. In this paper,...
In this paper we describe the data structures and the procedures of a program, which is...
The polyhedral approach is one of the most powerful techniques available for solving hard combinator...
Figure 1: Polyhedral patterns on a knot. Top: three polyhedral patterns tiling a knot and optimized ...
In this paper we describe the data structures and the procedures of a program, which is...
AbstractIn this paper we give simultaneous answers to three questions: (a) When does a plane picture...
His interest in geometric forms having developed during his training in the plastic arts, the author...
Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper...
AbstractRelations between graph theory and polyhedra are presented in two contexts. In the first, th...
Consider a polyhedron. For example, a platonic, an arquemidean, or a dual of an arquemidean polyhedr...
We present a linear time algorithm that produces a planar polyline drawing for a plane graph with $n...
International audienceThe author studies (not necessarily convex) triangulated polyhedra in three-di...
We present a linear time algorithm that produces a planar polyline drawing for a plane graph with $n...
University of Minnesota M.S. thesis. September 2011. Major: Computer science. Advisor:Dr. Douglas Du...
Given a set S of n points in the plane (not all on a line) it is well known that it is always possi...
Faces play a central role in the combinatorial and computational aspects ofpolyhedra. In this paper,...
In this paper we describe the data structures and the procedures of a program, which is...
The polyhedral approach is one of the most powerful techniques available for solving hard combinator...
Figure 1: Polyhedral patterns on a knot. Top: three polyhedral patterns tiling a knot and optimized ...
In this paper we describe the data structures and the procedures of a program, which is...
AbstractIn this paper we give simultaneous answers to three questions: (a) When does a plane picture...
His interest in geometric forms having developed during his training in the plastic arts, the author...
Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper...
AbstractRelations between graph theory and polyhedra are presented in two contexts. In the first, th...
Consider a polyhedron. For example, a platonic, an arquemidean, or a dual of an arquemidean polyhedr...
We present a linear time algorithm that produces a planar polyline drawing for a plane graph with $n...
International audienceThe author studies (not necessarily convex) triangulated polyhedra in three-di...
We present a linear time algorithm that produces a planar polyline drawing for a plane graph with $n...
University of Minnesota M.S. thesis. September 2011. Major: Computer science. Advisor:Dr. Douglas Du...
Given a set S of n points in the plane (not all on a line) it is well known that it is always possi...
Faces play a central role in the combinatorial and computational aspects ofpolyhedra. In this paper,...
In this paper we describe the data structures and the procedures of a program, which is...
The polyhedral approach is one of the most powerful techniques available for solving hard combinator...