Skip to main content
SpringerLink
Log in
Book cover

International Conference on Combinatorial Optimization and Applications

COCOA 2018: Combinatorial Optimization and Applications pp 495–508Cite as

Transmitting Particles in a Polygonal Domain by Repulsion

  • Conference paper
  • First Online:

  • 684 Accesses

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

Abstract

In this paper, we introduce the problem of transmitting particles to a target point by the effect of a repulsion actuator (RA). In this problem, we are given a polygonal domain P and a target point t inside it. Also, there is a particle at each point of P. The question is which particles can get to the target point t by activating a RA in P. We present the first polynomial time algorithm to solve this problem.

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. Biro, M.: Beacon-based routing and guarding. Ph.D. dissertation. State University of New York at Stony Brook (2013)

    Google Scholar 

  2. Biro, M., Gao, J., Iwerks, J., Kostitsyna, I., Mitchell, J.S.B.: Beacon-based routing and coverage. In: 21st Fall Workshop on Computational Geometry, FWCG 2011 (2011)

    Google Scholar 

  3. Biro, M., Gao, J., Iwerks, J., Kostitsyna, I., Mitchell,J.S.B.: Combinatorics of beacon-based routing and coverage. In: Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, vol. 1, p. 3 (2013)

    Google Scholar 

  4. Biro, M., Iwerks, J., Kostitsyna, I., Mitchell, J.S.B.: Beacon-based algorithms for geometric routing. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 158–169. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40104-6_14

    Chapter  MATH  Google Scholar 

  5. Bose, P., Shermer, T.C.: Gathering by repulsion. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 101. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)

    Google Scholar 

  6. de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational geometry. In: Computational Geometry, pp. 1–17. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-662-03427-9_1

    Chapter  Google Scholar 

  7. Kouhestani, B., Rappaport, D., Salomaa, K.: On the inverse beacon attraction region of a point. In: Proceedings of the 27th Canadian Conference on Computational Geometry, CCCG 2015, pp. 205–212 (2015)

    Google Scholar 

  8. Toth, C.D., O’Rourke, J., Goodman, J.E.: Handbook of Discrete and Computational Geometry. Chapman and Hall/CRC, Boca Raton (2017)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing Science, Simon Fraser University, Burnaby, BC, Canada

    Amirhossein Mozafari & Thomas C. Shermer

Authors
  1. Amirhossein Mozafari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas C. Shermer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Amirhossein Mozafari .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Kennesaw State University, Marietta, GA, USA

    Donghyun Kim

  2. Department of Mathematics and Computer Science, North Carolina Central University, Durham, NC, USA

    R. N. Uma

  3. Department of Computer Science, Georgia State University, Atlanta, GA, USA

    Alexander Zelikovsky

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mozafari, A., Shermer, T.C. (2018). Transmitting Particles in a Polygonal Domain by Repulsion. In: Kim, D., Uma, R., Zelikovsky, A. (eds) Combinatorial Optimization and Applications. COCOA 2018. Lecture Notes in Computer Science(), vol 11346. Springer, Cham. https://doi.org/10.1007/978-3-030-04651-4_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-04651-4_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-04650-7

  • Online ISBN: 978-3-030-04651-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation