Skip to main content

Terrain Visibility with Multiple Viewpoints

  • Conference paper
Algorithms and Computation (ISAAC 2013)

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

Included in the following conference series:

Abstract

We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider three fundamental visibility structures: the visibility map, the colored visibility map, and the Voronoi visibility map. We study the complexity of each structure for both 1.5D and 2.5D terrains, and provide efficient algorithms to construct them. Our algorithm for the visibility map in 2.5D terrains improves on the only existing algorithm in this setting.

F. H., V. S., and R.I. S. were partially supported by projects Gen. Cat. DGR 2009SGR1040, MINECO MTM2012-30951 and ESF EuroGIGA-ComPoSe - MICINN EUI-EURC-2011-4306. M. L. and F. S. were supported by Netherlands Organisation for Scientific Research (NWO) under project no 639.021.123 and 612.001.022. I. M. was supported by FCT project PEst-C/MAT/UI4106/2011 with COMPETE number FCOMP-01-0124-FEDER-022690. M.  S. was supported by projects F.R.S.-FNRS - EUROGIGA NR 13604 and GAČR GIG/11/E023. R.I. S. was partially supported by the FP7 Marie Curie Actions Individual Fellowship PIEF-GA-2009-251235, and by FCT through grant SFRH/BPD/88455/2012.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aurenhammer, F.: Power diagrams: Properties, algorithms and applications. SIAM J. Comput. 16(1), 78–96 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ben-Moshe, B., Katz, M., Mitchell, J.: A constant-factor approximation algorithm for optimal 1.5D terrain guarding. SIAM J. Comput. 36(6), 1631–1647 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bose, P., Shermer, T., Toussaint, G., Zhu, B.: Guarding polyhedral terrains. Comput. Geom. 7(3), 173–185 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  4. Catry, F., Rego, F., Santos, T., Almeida, J., Relvas, P.: Fires prevention in Portugal - using GIS to help improving early fire detection effectiveness. In: 4th Int. Wildland Fire Conf. (2007)

    Google Scholar 

  5. Cole, R., Sharir, M.: Visibility problems for polyhedral terrains. J. Symbolic Comput. 7(1), 11–30 (1989)

    Article  MathSciNet  Google Scholar 

  6. Coll, N., Madern, N., Sellarès, J.A.: Good-visibility maps visualization. Vis. Comput. 26(2), 109–120 (2010)

    Article  Google Scholar 

  7. Gibson, M., Kanade, G., Krohn, E., Varadarajan, K.: An approximation scheme for terrain guarding. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009. LNCS, vol. 5687, pp. 140–148. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Hurtado, F., Löffler, M., Matos, I., Sacristán, V., Saumell, M., Silveira, R.I., Staals, F.: Terrain visibility with multiple viewpoints (2013), arXiv:1309.4323 [cs.CG]

    Google Scholar 

  9. Katz, M.J., Overmars, M.H., Sharir, M.: Efficient hidden surface removal for objects with small union size. Comput. Geom. 2, 223–234 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  10. King, J., Krohn, E.: Terrain guarding is NP-hard. SIAM J. Comput. 40(5), 1316–1339 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lv, P., Zhang, J.-F., Lu, M.: An optimal method for multiple observers sitting on terrain based on improved simulated annealing techniques. In: Ali, M., Dapoigny, R. (eds.) IEA/AIE 2006. LNCS (LNAI), vol. 4031, pp. 373–382. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Möller, B.: Changing wind-power landscapes: regional assessment of visual impact on land use and population in Northern Jutland, Denmark. Appl. Energ. 83(5), 477–494 (2006)

    Article  Google Scholar 

  13. Reif, J.H., Sen, S.: An efficient output-sensitive hidden surface removal algorithm and its parallelization. In: Proc. 4th Symp. Computational Geometry, pp. 193–200. ACM (1988)

    Google Scholar 

  14. Yick, J., Mukherjee, B., Ghosal, D.: Wireless sensor network survey. Comput. Netw. 52(12), 2292–2330 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hurtado, F. et al. (2013). Terrain Visibility with Multiple Viewpoints. In: Cai, L., Cheng, SW., Lam, TW. (eds) Algorithms and Computation. ISAAC 2013. Lecture Notes in Computer Science, vol 8283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45030-3_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45030-3_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45029-7

  • Online ISBN: 978-3-642-45030-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics