Sciweavers

2583 search results - page 4 / 517
» On the Representation of Timed Polyhedra
Sort
View
CA
1998
IEEE
13 years 10 months ago
Feature-based Surface Decomposition for Correspondence and Morphing Between Polyhedra
We present a new approach for establishing correspondence between two homeomorphic 3D polyhedral models. The user can specify corresponding feature pairs on the polyhedra with a s...
Arthur D. Gregory, Andrei State, Ming C. Lin, Dine...
DCG
2008
64views more  DCG 2008»
13 years 5 months ago
Grid Vertex-Unfolding Orthogonal Polyhedra
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a net, a connected planar piece with no overlaps. A grid unfolding allows addition...
Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
ISAAC
2010
Springer
272views Algorithms» more  ISAAC 2010»
13 years 3 months ago
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra
The concept of neighbor system, introduced by Hartvigsen (2009), is a set of integral vectors satisfying a certain combinatorial property. In this paper, we reveal the relationship...
Akiyoshi Shioura
FMSD
2006
104views more  FMSD 2006»
13 years 5 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
COMPGEOM
2006
ACM
13 years 11 months ago
An upper bound on the average size of silhouettes
It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides,...
Marc Glisse