Sciweavers

Share
VC
1998
106views more  VC 1998»
9 years 1 months ago
Polyhedron realization for shape transformation
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 ...
Avner Shapiro, Ayellet Tal
DCG
1998
66views more  DCG 1998»
9 years 1 months ago
The Volume as a Metric Invariant of Polyhedra
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....
Idzhad Kh. Sabitov
DCG
2006
96views more  DCG 2006»
9 years 1 months ago
Elementary Moves on Triangulations
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 ...
Monika Ludwig, Matthias Reitzner
CORR
2006
Springer
94views Education» more  CORR 2006»
9 years 1 months ago
Epsilon-Unfolding Orthogonal Polyhedra
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). ...
Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
CORR
2008
Springer
126views Education» more  CORR 2008»
9 years 1 months ago
3D Building Model Fitting Using A New Kinetic Framework
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...
Mathieu Brédif, Didier Boldo, Marc Pierrot ...
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
9 years 2 months ago
Separation and Approximation of Polyhedral Objects
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...
Joseph S. B. Mitchell, Subhash Suri
CCCG
2003
9 years 2 months ago
The Strange Complexity of Constrained Delaunay Triangulation
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...
Nicolas Grislain, Jonathan Richard Shewchuk
CCCG
2003
9 years 2 months ago
On the Complexity of Halfspace Volume Queries
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 ...
Erik D. Demaine, Jeff Erickson, Stefan Langerman
CCCG
2010
9 years 2 months ago
Bounded-degree polyhedronization of point sets
In 1994 Gr
Gill Barequet, Nadia Benbernou, David Charlton, Er...
JCDCG
2000
Springer
9 years 5 months ago
Volume Queries in Polyhedra
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...
John Iacono, Stefan Langerman
books