Sciweavers

ORL
2007
72views more  ORL 2007»
13 years 4 months ago
Colorings of k-balanced matrices and integer decomposition property of related polyhedra
We show that a class of polyhedra, arising from certain 0, 1 matrices introduced by Truemper and Chandrasekaran, has the integer decomposition property. This is accomplished by pr...
Giacomo Zambelli
CORR
1999
Springer
89views Education» more  CORR 1999»
13 years 4 months ago
Ununfoldable Polyhedra with Convex Faces
Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the ...
Marshall W. Bern, Erik D. Demaine, David Eppstein,...
TCS
2008
13 years 4 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd
ANOR
2005
131views more  ANOR 2005»
13 years 4 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Egon Balas
ENTCS
2006
137views more  ENTCS 2006»
13 years 4 months ago
An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...
Morgan Magnin, Didier Lime, Olivier H. Roux
EJC
2010
13 years 4 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
GISCIENCE
2008
Springer
115views GIS» more  GISCIENCE 2008»
13 years 5 months ago
Validation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization
Abstract. Closed, watertight, 3D geometries are represented by polyhedra. Current data models define these polyhedra basically as a set of polygons, leaving the test on intersectin...
Edward Verbree, Hang Si
ICALP
2000
Springer
13 years 8 months ago
On the Representation of Timed Polyhedra
In this paper we investigate timed polyhedra, i.e. polyhedra which are finite unions of full dimensional simplices of a special kind. Such polyhedra form the basis of timing analys...
Olivier Bournez, Oded Maler
HYBRID
1999
Springer
13 years 8 months ago
Orthogonal Polyhedra: Representation and Computation
Abstract. In this paper we investigate orthogonal polyhedra, i.e. polyhedra which are finite unions of full-dimensional hyper-rectangles. We define representation schemes for the...
Olivier Bournez, Oded Maler, Amir Pnueli
CA
1998
IEEE
13 years 8 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...