Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Acrophobic guard watchtower problem

From MaRDI portal
Publication:2096366
Jump to:navigation, search

DOI10.1016/j.comgeo.2022.101918OpenAlexW4290790717WikidataQ114195455 ScholiaQ114195455MaRDI QIDQ2096366

Ritesh Seth, Anil Maheshwari, Subhas C. Nandy

Publication date: 16 November 2022

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2022.101918

zbMATH Keywords

complexityalgorithmsterrain guardingacrophobic guardwatchtower


Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Computing methodologies and applications (68Uxx) Polytopes and polyhedra (52Bxx)




Cites Work

  • Unnamed Item
  • Guarding polyhedral terrains
  • Guarding polyhedral terrain by \(k\)-watchtowers
  • The shortest watchtower and related problems for polyhedral terrains
  • Finding the intersection of two convex polyhedra
  • Parametric search: three new applications
  • Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
  • Applying Parallel Computation Algorithms in the Design of Serial Algorithms
  • Guarding a terrain by two watchtowers
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2096366&oldid=14592652"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 22:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki