Sciweavers

Share
CORR
2007
Springer
97views Education» more  CORR 2007»
8 years 11 months ago
Unfolding Restricted Convex Caps
This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restri...
Joseph O'Rourke
CGF
2007
127views more  CGF 2007»
8 years 11 months ago
A Finite Element Method on Convex Polyhedra
We present a method for animating deformable objects using a novel finite element discretization on convex polyhedra. Our finite element approach draws upon recently introduced ...
Martin Wicke, Mario Botsch, Markus H. Gross
FMSD
2006
104views more  FMSD 2006»
8 years 11 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord
EJC
2010
8 years 11 months ago
On the infinitesimal rigidity of weakly convex polyhedra
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex poly...
Robert Connelly, Jean-Marc Schlenker
CGF
2008
128views more  CGF 2008»
8 years 11 months ago
Hierarchical Convex Approximation of 3D Shapes for Fast Region Selection
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
Marco Attene, Michela Mortara, Michela Spagnuolo, ...
COMGEO
2010
ACM
8 years 11 months ago
Exact join detection for convex polyhedra and other numerical abstractions
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
9 years 10 days 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
2008
9 years 19 days ago
A Class of Convex Polyhedra with Few Edge Unfoldings
We construct a sequence of convex polyhedra on n vertices with the property that, as n, the fraction of its edge unfoldings that avoid overlap approaches 0, and so the frac
Alex Benton, Joseph O'Rourke
CCCG
2007
9 years 19 days ago
Unfolding Polyhedra via Cut-Tree Truncation
We prove that an infinite class of convex polyhedra, produced by restricted vertex truncations, always unfold without overlap. The class includes the “domes,” providing a sim...
Alex Benton, Joseph O'Rourke
SAS
1999
Springer
9 years 3 months ago
Polyhedral Analysis for Synchronous Languages
We define an operational semantics for the Signal language and design an analysis which allows to verify properties pertaining to the relation between values of the numeric and bo...
Frédéric Besson, Thomas P. Jensen, J...
books