Polyhedron realization is the transformation of a polyhedron into a convex polyhedron with an isomorphic vertex neighborhood graph. We present in this paper a novel algorithm for ...
It is proved that in R3 the volume of any polyhedron is a root of some polynomial with coefficients depending only on the combinatorial structure and the metric of the polyhedron....
It is proved that a triangulation of a polyhedron can always be transformed into any other triangulation of the polyhedron using only elementary moves. One consequence is that an ...
Abstract. An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). ...
We describe a new approach to fit the polyhedron describing a 3D building model to the point cloud of a Digital Elevation Model (DEM). We introduce a new kinetic framework that hi...
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common spher...
Given a polyhedron P in Rd with n vertices, a halfspace volume query asks for the volume of P ∩ H for a given halfspace H. We show that, for d ≥ 3, such queries can require ...
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...