Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computational Science and Its Applications

ICCSA 2003: Computational Science and Its Applications — ICCSA 2003 pp 797–806Cite as

Computing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation

  • Conference paper
  • First Online:

  • 1489 Accesses

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

Abstract

In this paper, we report on the theory and implementation of an O(n 3) algorithm for computing the largest empty rectangle of arbitrary orientation for a given set of n points in the plane.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aggarwal and Subhash Suri. Fast algorithms for computing the largest empty rectangle. In Proc. 3rd Annu. ACM Sympos. Comput. Geom., pages 278–290, 1987.

    Google Scholar 

  2. Pankaj K. Agarwal and Micha Sharir. Efficient algorithms for geometric optimization. ACM Comput. Surveys, 30:412–458, 1998.

    Article  Google Scholar 

  3. Bernard Chazelle, R. L. Drysdale, III, and D. T. Lee. Computing the largest empty rectangle. SIAM J. Comput., 15:300–315, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  4. A. Naamad, W.-L. Hsu, and D. T. Lee. On the maximum empty rectangle problem. Discrete Appl. Math., 8:267–277, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Orlowski. A new algorithm for the largest empty rectangle problem. Algorithmica, 5:65–73, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  6. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 3rd edition, October 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Windsor, Windsor, Canada

    Asish Mukhopadhyay

  2. Department of Computer Sci. & Engg., Indian Institute of Technology, Guwahati, India

    S. V. Rao

Authors
  1. Asish Mukhopadhyay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. V. Rao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Army High Performance Computing Research Center, USA University of Minessota Department of Computer Science and Engineering, MN, 55455, USA

    Vipin Kumar

  2. Department of Computer Science, University of Calgary, Calgary, AB, T2N1N4, Canada

    Marina L. Gavrilova

  3. Heuchera Technologies Inc., 122 9251-8Yonge Street, Richmond Hill, ON, Canada, L4C 9T3

    Chih Jeng Kenneth Tan

  4. School of Computer Science, The Queen’s University of Belfast, Belfast, BT7 1NN, Northern Ireland UK

    Chih Jeng Kenneth Tan

  5. Département d’informatique et de recherche opérationelle Montréal, Université de Montréal, Québec, H3C 3J7, Canada

    Pierre L’Ecuyer

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mukhopadhyay, A., Rao, S.V. (2003). Computing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44842-X_81

Download citation

  • DOI: https://doi.org/10.1007/3-540-44842-X_81

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40156-8

  • Online ISBN: 978-3-540-44842-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation