This paper presents an interactive modeling system of polyhedra using the isomorphic graphs. Especially, Conway polyhedron notation is implemented. The notation can be observed as interactive animation. Keywords—Conway polyhedron notation, Polyhedral graph, Visualization.

Given a graph G = (V, E) and a weight function on the edges w : E 7→ R, we consider the polyhedron P (G, w) of negative-weight flows on G, and get a complete characterization of the vertices and extreme directions of P (G, w). As a corollary, we show that, unless P = NP , there no output polynomial-time algorithm to generate all the vertices of a 0/1-polyhedron. This strengthens the NP-hardness...

We consider the construction of a polyhedral Delaunay partition as limit sequence power diagrams (radical partitions). The dual Voronoi diagram is obtained weighted partitions. problem reduced to two convex polyhedra, inscribed and superscribed around circular paraboloid, pairs general polyhedra. primal polyhedra should converge polyhedron converges polyhedron. are interested in case when verti...

In this paper, we study the problem of whether a polyhedron can be obtained from a net , i.e., a polygon and a set of creases, by folding along the creases. We consider two cases, depending on whether we are given the dihedral angle at each crease. If these dihedral angles are given the problem can be solved in polynomial time by the simple expedient of performing the folding. If the dihedral a...