Sciweavers

88 search results - page 1 / 18
» Orthogonal Polyhedra: Representation and Computation
Sort
View
HYBRID
1999
Springer
13 years 9 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
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
13 years 9 months ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...
VMV
2001
126views Visualization» more  VMV 2001»
13 years 6 months ago
Erosion and Dilation on 2-D and 3-D Digital Images: A New Size-Independent Approach
This paper presents a new approach to achieve elementary neighborhood operations on both 2D and 3D binary images by using the Extreme Vertices Model (EVM), a recent orthogonal pol...
Jorge Rodríguez, Dolors Ayala
FMSD
2006
104views more  FMSD 2006»
13 years 4 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
CAV
2007
Springer
120views Hardware» more  CAV 2007»
13 years 11 months ago
Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
Chao Wang, Zijiang Yang, Aarti Gupta, Franjo Ivanc...