scientific article; zbMATH DE number 1303061

MaRDI QIDQ4249563zbMATH OpenFDO

Authors Oded Maler, Amir Pnueli, Olivier Bournez

Publication date 2 December 1999

zbMATH Keywords

orthogonal polyhedra

Mathematics Subject Classification ID

Polytopes and polyhedra (52B99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1860737
• Automata-based symbolic representations of polyhedra
• Resolvable representation of polyhedra
• THE EXTENDED CONVEX DIFFERENCES TREE (ECDT) REPRESENTATION FOR N-DIMENSIONAL POLYHEDRA
• scientific article; zbMATH DE number 1304965

Cited in

(28)

• Convex polyhedral chains: A representation for geometric data
• Resolvable representation of polyhedra
• Computing the discrete compactness of orthogonal pseudo-polytopes via their nD-EVM representation
• Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
• Local orientation-preserving symmetry preserving operations on polyhedra
• scientific article; zbMATH DE number 1670871 (Why is no real title available?)
• scientific article; zbMATH DE number 1698715 (Why is no real title available?)
• Data structures for higher-dimensional rectilinear packing
• Automata-based symbolic representations of polyhedra
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
• Computation of the axial view of a set of isothetic parallelepipeds
• Approximating Continuous Systems by Timed Automata
• Transformation of geometric models into orthogonal polyhedra using fuzzy logic
• THE EXTENDED CONVEX DIFFERENCES TREE (ECDT) REPRESENTATION FOR N-DIMENSIONAL POLYHEDRA
• scientific article; zbMATH DE number 1304965 (Why is no real title available?)
• DIMENSION-INDEPENDENT CONVEX-CELL BASED HPC SKELETONS AND PRODUCT
• Reachability computation for polynomial dynamical systems
• Cartesian product partitioning of multi-dimensional reachable state spaces
• Local polyhedra and geometric graphs
• DEVELOPMENTS OF POLYHEDRA USING OBLIQUE COORDINATES
• Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
• Unbounding discrete oriented polytopes
• On the construction of planar embedding for a class of orthogonal polyhedra
• Reconstructing orthogonal polyhedra from putative vertex sets
• The two variable per inequality abstract domain
• Divide and conquer: variable set separation in hybrid systems reachability analysis
• Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology
• Orthogonal surfaces and their CP-orders

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249563)