Skip to main content

Orthogonal Polyhedra: Representation and Computation

  • Conference paper
  • First Online:
Hybrid Systems: Computation and Control (HSCC 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1569))

Included in the following conference series:

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 these polyhedra based on their vertices, and show that these compact representation schemes are canonical for all (convex and non-convex) polyhedra in any dimension. We then develop efficient algorithms for membership, face-detection and Boolean operations for these representations.

This work was partially supported by the European Community Esprit-LTR Project 26270 VHS (Verification of Hybrid systems) and the French-Israeli collaboration project 970MAEFUT5 (Hybrid Models of Industrial Plants).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur and D.L. Dill, A Theory of Timed Automata, Theoretical Computer Science 126, 183–235, 1994.

    Article  MathSciNet  Google Scholar 

  2. A. Aguilera and D. Ayala, Orthogonal Polyhedra as Geometric Bounds, in Constructive Solid Geometry, Proc. Solid Modeling 97, 1997

    Google Scholar 

  3. A. Aguilera and D. Ayala, Domain Extension for the Extreme Vertices Model (EVM) and Set-membership Classification, Proc. Constructive Solid Geometry 98, 1998.

    Google Scholar 

  4. P. Antsaklis, W. Kohn, A. Nerode and S. Sastry (Eds.), Hybrid Systems II, LNCS 999, Springer, 1995.

    Google Scholar 

  5. A. Brondsted, An Introduction to Convex Polytopes, Springer, 1983.

    Google Scholar 

  6. T. Dang, O. Maler, Reachability Analysis via Face Lifting, in T.A. Henzinger and S. Sastry (Eds), Hybrid Systems: Computation and Control, LNCS 1386, 96–109, Springer, 1998.

    Chapter  Google Scholar 

  7. M.R. Greenstreet, Verifying Safety Properties of Differential Equations, in R. Alur and T.A. Henzinger (Eds.), Proc. CAV’96, LNCS 1102, 277–287, Springer, 1996.

    Google Scholar 

  8. T.A. Henzinger and S. Sastry (Eds), Hybrid Systems: Computation and Control, LNCS 1386, Springer, 1998.

    Google Scholar 

  9. R.P. Kurshan and K.L. McMillan, Analysis of Digital Circuits Through Symbolic Reduction, IEEE Trans. on Computer-Aided Design, 10, 1350–1371, 1991.

    Article  Google Scholar 

  10. O. Maler (Ed.), Hybrid and Real-Time Systems, Int. Workshop HART’97, LNCS 1201, Springer, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bournez, O., Maler, O., Pnueli, A. (1999). Orthogonal Polyhedra: Representation and Computation. In: Vaandrager, F.W., van Schuppen, J.H. (eds) Hybrid Systems: Computation and Control. HSCC 1999. Lecture Notes in Computer Science, vol 1569. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48983-5_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-48983-5_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65734-7

  • Online ISBN: 978-3-540-48983-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics