This paper presents a characterization of realizable configurations for Guibas' conjecture based on work from the area of polytope convexity testing.
When a configuration is mapped into 3-space we first assign each vertex to its new position, and then add edges between any two vertices that were connected by ...
Guibas conjectured that given a convex polygon P in the xy-plane along with two triangulations of it, T 1 and T 2 that share no diagonals, ...
This paper presents a characterization of realizable configurations for Guibas' conjecture based on work from the area of polytope convexity testing. Our ...
It is shown that the problem of constructing convex polygons and convex polyhedra given the number of visible edges and visible faces from some orthogonal ...
This paper presents a characterization of realizable configurations for Guibas' conjecture based on work from the area of polytope convexity testing. Our ...
Benjamin M. Marlin , Godfried T. Toussaint: Constructing convex 3-polytopes from two triangulations of a polygon. Comput. Geom. 28(1): 41-47 (2004).
There are several different ways to specify convex polytopes in three dimensions. The obvious explicit representation is a list of the vertex coordinates ...
Missing: 3- | Show results with:3-
This leads to an algorithm for deciding and constructing such realizations that incorporates a linear programming step with O(n2)inequality constraints and n ...
People also ask
What is triangulation of a convex polygon?
How do you make a polygon convex?
What is the difference between a convex polygon and a regular polygon?
How do you know if a 3d polygon is convex?
Elementary steps of the construction include operations such as taking the join of two or three points, intersecting planes and lines, putting points on ...