This is a survey on methods to construct a three-dimensional convex polytope with a given combinatorial structure, that is, with the edges forming a given 3-connected planar graph, focusing on efforts to achieve small integer coordinates
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawi...
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawi...
A triangulation of a finite point set A in IR d is a geometric simplicial complex which covers the c...
This is a survey on methods to construct a three-dimensional convex polytope with a given combinator...
There is much current interest among researches to find algorithms that will draw graphs in three di...
We provide O(n)-time algorithms for constructing the following types of drawings of n-vertex 3-conne...
In this article we describe a method of constructing all simple triangulations of the sphere with mi...
Guibas conjectured that given a convex polygon P in the xy-plane along with two triangulations of i...
In this paper, we investigate the area and volume requirement of convex drawings of planar graphs in...
Let Γ be a 3-polytopal graph such that every face of Γ is convex. We prove that if the set of proper...
AbstractIn this article, we describe a method of constructing all simple triangulations of the spher...
AbstractRelations between graph theory and polyhedra are presented in two contexts. In the first, th...
AbstractLet Γ be a 3-polytopal graph such that every face of Γ is convex. We prove that if the set o...
In this article we describe a method of constructing all simple triangulations of the sphere with mi...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawi...
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawi...
A triangulation of a finite point set A in IR d is a geometric simplicial complex which covers the c...
This is a survey on methods to construct a three-dimensional convex polytope with a given combinator...
There is much current interest among researches to find algorithms that will draw graphs in three di...
We provide O(n)-time algorithms for constructing the following types of drawings of n-vertex 3-conne...
In this article we describe a method of constructing all simple triangulations of the sphere with mi...
Guibas conjectured that given a convex polygon P in the xy-plane along with two triangulations of i...
In this paper, we investigate the area and volume requirement of convex drawings of planar graphs in...
Let Γ be a 3-polytopal graph such that every face of Γ is convex. We prove that if the set of proper...
AbstractIn this article, we describe a method of constructing all simple triangulations of the spher...
AbstractRelations between graph theory and polyhedra are presented in two contexts. In the first, th...
AbstractLet Γ be a 3-polytopal graph such that every face of Γ is convex. We prove that if the set o...
In this article we describe a method of constructing all simple triangulations of the sphere with mi...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawi...
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawi...
A triangulation of a finite point set A in IR d is a geometric simplicial complex which covers the c...
DOI
Add to ORKG