Sciweavers

88 search results - page 3 / 18
» Orthogonal Polyhedra: Representation and Computation
Sort
View
DAC
2002
ACM
14 years 6 months ago
TCG-S: orthogonal coupling of P*-admissible representations for general floorplans
We extend in this paper the concept of the P-admissible floorplan representation to that of the P*-admissible one. A P*-admissible representation can model the most general floorp...
Jai-Ming Lin, Yao-Wen Chang
SMA
2005
ACM
167views Solid Modeling» more  SMA 2005»
13 years 11 months ago
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
Peter Hachenberger, Lutz Kettner
CONIELECOMP
2004
IEEE
13 years 9 months ago
Representing and Computing Some Configuration Properties for the n-Dimensional Orthogonal Pseudo-Polytopes
In this paper we present a set of formulations that describe some properties of the configurations that can represent the n-Dimensional Orthogonal PseudoPolytopes. Moreover, we de...
Antonio Aguilera, Ricardo Pérez-Aguila
ANOR
2005
131views more  ANOR 2005»
13 years 5 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
CAV
2009
Springer
132views Hardware» more  CAV 2009»
14 years 6 months ago
Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
Thao Dang, David Salinas