Skip to main content
SpringerLink
Log in

Discrete Planar Two-Watchtower Problem for k-Visibility

  • Conference paper
  • First Online:
The 6th International Conference on Wireless, Intelligent and Distributed Environment for Communication (WIDECOM 2023)

Part of the book series: Lecture Notes on Data Engineering and Communications Technologies ((LNDECT,volume 185))

  • 72 Accesses

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover 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. Agarwal, P.K., et al.: Guarding a terrain by two watchtowers. Algorithmica 58(2), 352–390 (2010)

    Article  MathSciNet  Google Scholar 

  2. Aichholzer, O., et al.: Modem illumination of monotone polygons. Comput. Geom. 68, 101–118 (2018)

    Article  MathSciNet  Google Scholar 

  3. Ambainis, A., Filmus, Y., Le Gall, F.: Fast matrix multiplication: limitations of the Coppersmith-Winograd method. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 585–593 (2015)

    Google Scholar 

  4. Bahoo, Y., Bose, P., Durocher, S.: Watchtower for k-crossing visibility. In: CCCG, pp. 203–209 (2019)

    Google Scholar 

  5. Bahoo, Y., et al.: A time–space trade-off for computing the k-visibility region of a point in a polygon. Theor. Comput. Sci. 789, 13–21 (2019)

    Article  MathSciNet  Google Scholar 

  6. Bahoo, Y., et al.: Computing the k-visibility region of a point in a polygon. Theory Comput. Syst. 64(7), 1292–1306 (2020)

    Article  MathSciNet  Google Scholar 

  7. Bajuelos, A.L., et al.: A hybrid metaheuristic strategy for covering with wireless devices. J. Univ. Comput. Sci. 18(14), 1906–1932 (2012)

    MathSciNet  Google Scholar 

  8. Ballinger, B., et al.: Coverage with k-transmitters in the presence of obstacles. J. Combin. Optim. 25, 208–233 (2013)

    Article  MathSciNet  Google Scholar 

  9. Ben-Moshe, B., Carmi, P., Katz, M.J.: Computing all large sums-of-pairs in Rn and the discrete planar two-watchtower problem. Inf. Process. Lett. 89(3), 137–139 (2004)

    Article  Google Scholar 

  10. Bespamyatnikh, S., et al.: On the planar two-watchtower problem. In: Computing and Combinatorics: 7th Annual International Conference, COCOON 2001 Guilin, China, August 20–23, 2001 Proceedings 7, pp. 121–130. Springer (2001)

    Google Scholar 

  11. Dean, J.A., Lingas, A., Sack, J.-R.: Recognizing polygons, or how to spy. Vis. Comput. 3, 344–355 (1988)

    Article  Google Scholar 

  12. Evans, W., Sember, J.: k-star-shaped polygons, pp. 215–218 (2010)

    Google Scholar 

  13. Fabila-Monroy, R., Vargas, A.R., Urrutia, J.: On modem illumination problems. In: XIII encuentros de geometria computacional, Zaragoza, Spain (2009)

    Google Scholar 

  14. Mouawad, N., Shermer, T.: The superman problem. Vis. Comput. 10, 459–473 (1994)

    Article  Google Scholar 

  15. Sharir, M.: The shortest watchtower and related problems for polyhedral terrains. Inf. Process. Lett. 29(5), 265–270 (1988)

    Article  MathSciNet  Google Scholar 

  16. Zhu, B.: Computing the shortest watchtower of a polyhedral terrain in O (nlogn) time. Comput. Geom. 8(4), 181–193 (1997)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Toronto Metropolitan University, Toronto, ON, Canada

    Yeganeh Bahoo, Somnath Kundu & Rudaba Syed

Authors
  1. Yeganeh Bahoo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Somnath Kundu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rudaba Syed
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yeganeh Bahoo .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Ryerson University, Toronto, ON, Canada

    Isaac Woungang

  2. Department of Information Technology, Netaji Subhas University of Technology, New Delhi, Delhi, India

    Sanjay Kumar Dhurandher

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bahoo, Y., Kundu, S., Syed, R. (2024). Discrete Planar Two-Watchtower Problem for k-Visibility. In: Woungang, I., Dhurandher, S.K. (eds) The 6th International Conference on Wireless, Intelligent and Distributed Environment for Communication. WIDECOM 2023. Lecture Notes on Data Engineering and Communications Technologies, vol 185. Springer, Cham. https://doi.org/10.1007/978-3-031-47126-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-47126-1_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-47125-4

  • Online ISBN: 978-3-031-47126-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation