Skip to main content

Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases

  • Conference paper
  • First Online:
WALCOM: Algorithms and Computation (WALCOM 2018)

Abstract

We study the problem of computing a minimum-width annulus with outliers. Specifically, given a set of n points in the plane and a nonnegative integer \(k \le n\), the problem asks to find a minimum-width annulus that contains at least \(n-k\) input points. The k excluded points are considered as outliers of the input points. In this paper, we are interested in particular in annuli of three different shapes: circular, square, and rectangular annuli. For the three cases, we present first and improved algorithms to the problem.

H.-K. Ahn, T. Ahn, J. Choi, M. Kim, E. Oh, and S.D. Yoon were supported by the MSIT (Ministry of Science and ICT), Korea, under the SW Starlab support program (IITP–2017–0–00905) supervised by the IITP (Institute for Information & communications Technology Promotion). S.W. Bae was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2015R1D1A1A01057220). C.-S. Shin was supported by University Research Grant of Hankuk University of Foreign Studies.

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 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: Proceedings of the European Workshop on Computational Geometry (EuroCG 2003), pp. 147–150 (2003)

    Google Scholar 

  2. Agarwal, P.K., Aronov, B., Sharir, M.: Computing envelopes in four dimensions with applications. SIAM J. Comput. 26(6), 1714–1732 (1997)

    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. Agarwal, P., Sharir, M., Toledo, S.: Applications of parametric searching in geometric optimization. J. Algo. 17, 292–318 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bae, S.W.: Computing a minimum-width square annulus in arbitrary orientation. In: Kaykobad, M., Petreschi, R. (eds.) WALCOM 2016. LNCS, vol. 9627, pp. 131–142. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-30139-6_11

    Chapter  Google Scholar 

  6. Bae, S.W.: Computing a minimum-width square or rectangular annulus with outliers. In: Dinh, T.N., Thai, M.T. (eds.) COCOON 2016. LNCS, vol. 9797, pp. 443–454. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42634-1_36

    Chapter  Google Scholar 

  7. de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-77974-2

    Book  MATH  Google Scholar 

  8. 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 

  9. Ebara, H., Fukuyama, N., Nakano, H., Nakanishi, Y.: Roundness algorithms using the Voronoi diagrams. In: Abstracts 1st Canadian Conference on Computational Geometry (CCCG), p. 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. Har-Peled, S., Wang, Y.: Shape fitting with outliers. SIAM J. Comput. 33(2), 269–285 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lee, D.: On \(k\)-nearest neighbor Voronoi diagrams in the plane. IEEE Trans. Comput. 31(6), 478–487 (1982)

    MathSciNet  MATH  Google Scholar 

  13. Liu, C.H., Papadopoulou, E., Lee, D.T.: The \(k\)-nearest-neighbor Voronoi diagram revisited. Algorithmica 71, 429–449 (2015)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sang Won Bae .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ahn, HK. et al. (2018). Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases. In: Rahman, M., Sung, WK., Uehara, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2018. Lecture Notes in Computer Science(), vol 10755. Springer, Cham. https://doi.org/10.1007/978-3-319-75172-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75172-6_5

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics