Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2016: Computing and Combinatorics pp 443–454Cite as

Computing a Minimum-Width Square or Rectangular Annulus with Outliers

[Extended Abstract]

  • Conference paper
  • First Online:

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

Abstract

A square or rectangular annulus is the closed region between a square or rectangle and its offset. In this paper, we address the problem of computing a minimum-width square or rectangular annulus that contains at least \(n-k\) points out of n given points in the plane. The k excluded points are considered as outliers of the n input points. We present several first algorithms to the problem.

This research was supported by Basic Science Research Program through the National Research Foundation of Koresa (NRF) funded by the Ministry of Education (2015R1D1A1A01057220).

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

Learn about 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) (2003)

    Google Scholar 

  2. Aggarwal, A., Imai, H., Katoh, N., Suri, S.: Finding \(k\) points with minimum diameter and related problems. J. Algorithms 12, 38–56 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ahn, H.K., Bae, S.W., Demaine, E.D., Demaine, M.L., Kim, S.S., Korman, M., Reinbacher, I., Son, W.: Covering points by disjoint boxes with outliers. Comput. Geom. Theor. Appl. 44(3), 178–190 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Atanassov, R., Bose, P., Couture, M., Maheshwari, A., Morin, P., Paquette, M., Smid, M., Wuhrer, S.: Algorithms for optimal outlier removal. J. Discrete Alg. 7(2), 239–248 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bae, S.W.: Computing a minimum-width square annulus in arbitrary orientation [extended abstract]. In: Proceedings of the 10th International Workshop on Algorithms and Computation (WALCOM 2016), vol. 9627, pp. 131–142 (2016)

    Google Scholar 

  6. de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computationsl Geometry: Alogorithms and Applications, 2nd edn. Springer, Heidelberg (2000)

    Book  MATH  Google Scholar 

  7. Chan, T.M.: Geometric applications of a randomized optimization technique. Discrete Comput. Geom. 22(4), 547–567 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chan, T.M.: Remarks on \(k\)-level algorithms in the plane (1999). Manuscript

    Google Scholar 

  9. Dey, T.K.: Improved bounds on planar \(k\)-sets and related problems. Discrete Comput. Geom. 19, 373–382 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  10. Everett, H., Robert, J.M., van Kreveld, M.: An optimal algorithm for computing \((\le k)\)-levels, with applications. Int. J. Comput. Geom. Appl. 6(3), 247–261 (1996)

    Article  MathSciNet  MATH  Google Scholar 

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

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Matoušek, J.: On geometric optimization with few violated constraints. Discrete Comput. Geom. 14, 365–384 (1995)

    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 

  15. Segal, M., Kedem, K.: Enclosing \(k\) points in the smallest axis parallel rectangle. Inform. Process. Lett. 65, 95–99 (1998)

    Article  MathSciNet  MATH  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. Virginia Commonwealth Univ , Richmond, Virginia, USA

    Thang N. Dinh

  2. University of Florida , Gainesville, Alabama, USA

    My T. Thai

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 or Rectangular Annulus with Outliers. In: Dinh, T., Thai, M. (eds) Computing and Combinatorics . COCOON 2016. Lecture Notes in Computer Science(), vol 9797. Springer, Cham. https://doi.org/10.1007/978-3-319-42634-1_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-42634-1_36

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-42633-4

  • Online ISBN: 978-3-319-42634-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation