Skip to main content
SpringerLink
Log in

Computing a Minimum-Width Square Annulus in Arbitrary Orientation

[Extended Abstract]

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9627))

Included in the following conference series:

Abstract

In this paper, we address the problem of computing a minimum-width square annulus in arbitrary orientation that encloses a given set of n points in the plane. A square annulus is the region between two concentric squares. We present an \(O(n^3 \log n)\)-time algorithm that finds such a square annulus over all orientations.

This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT & Future Planning (2013R1A1A1A05006927) and by the Ministry of Education (2015R1D1A1A01057220).

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

References

  1. Abellanas, M., Hurtado, F., Icking, C., Ma, L., Palop, B., Ramos, P.: Best fitting rectangles. In: European Workshop on Computational Geometry (EuroCG 2003) (2003)

    Google Scholar 

  2. Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM 51(4), 606–635 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Agarwal, P., Sharir, M.: Efficient randomized algorithms for some geometric optimization problems. Discrete Comput. Geom. 16, 317–337 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  4. Barequet, G., Briggs, A.J., Dickerson, M.T., Goodrich, M.T.: Offset-polygon annulus placement problems. Comput. Geom.: Theory Appl. 11, 125–141 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  5. Barequet, G., Goryachev, A.: Offset polygon and annulus placement problems. Comput. Geom.: Theory Appl. 47(3, Part A), 407–434 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  6. de Berg, M., Bose, P., Bremner, D., Ramaswami, S., Wilfong, G.: Computing constrained minimum-width annuli of point sets. Comput.-Aided Des. 30(4), 267–275 (1998)

    Article  Google Scholar 

  7. Chan, T.: Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. Int. J. Comput. Geom. Appl. 12, 67–85 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Duncan, C., Goodrich, M., Ramos, E.: Efficient approximation and optimization algorithms for computational metrology. In: Proceedings of the 8th ACM-SIAM Symposium Discrete Algorithms (SODA 1997), pp. 121–130 (1997)

    Google Scholar 

  9. Ebara, H., Fukuyama, N., Nakano, H., Nakanishi, Y.: Roundness algorithms using the Voronoi diagrams. In: Abstracts 1st Canadian Conference on Computational Geometry (CCCG), pp. 41 (1989)

    Google Scholar 

  10. Gluchshenko, O.N., Hamacher, H.W., Tamir, A.: An optimal \(o(n \log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width. Oper. Res. Lett. 37(3), 168–170 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hershberger, J.: Finding the upper envelope of \(n\) line segments in \(O(n\log n)\) time. Inf. Proc. Lett. 33, 169–174 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mukherjee, J., Mahapatra, P., Karmakar, A., Das, S.: Minimum-width rectangular annulus. Theor. Comput. Sci. 508, 74–80 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  13. Roy, U., Zhang, X.: Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error. Comput.-Aided Des. 24(3), 161–168 (1992)

    Article  MATH  Google Scholar 

  14. Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York (1995)

    MATH  Google Scholar 

  15. Toussaint, G.: Solving geometric problems with the rotating calipers. In: Proceedings of the IEEE MELECON (1983)

    Google Scholar 

  16. Wainstein, A.: A non-monotonous placement problem in the plane. In: Software Systems for Solving Optimal Planning Problems, Abstract: 9th All-Union Symp. USSR, Symp., pp. 70–71 (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Kyonggi University, Suwon, South Korea

    Sang Won Bae

Authors
  1. Sang Won Bae
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sang Won Bae .

Editor information

Editors and Affiliations

  1. Dept. of Computer Science and Engin., Bangladesh Univ. of Engin. & Technol., Dhaka, Bangladesh

    Mohammad Kaykobad

  2. Dept. of Computer Science, Sapienza University of Rome, Rome, Italy

    Rossella Petreschi

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Bae, S.W. (2016). Computing a Minimum-Width Square Annulus in Arbitrary Orientation. In: Kaykobad, M., Petreschi, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2016. Lecture Notes in Computer Science(), vol 9627. Springer, Cham. https://doi.org/10.1007/978-3-319-30139-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30139-6_11

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30138-9

  • Online ISBN: 978-3-319-30139-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation