On the public citation graph

Optimum guard covers and m-watchmen routes for restricted polygons

https://doi.org/10.1007/bfb0028276
0 signed · 30 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf02574671openalex-snapshot
Shortest watchman routes in simple polygons
inferredcites →https://doi.org/10.1016/0020-0190(88)90141-xopenalex-snapshot
Optimum watchman routes
inferredcites →https://doi.org/10.1016/0095-8956(75)90061-1openalex-snapshot
A combinatorial theorem in plane geometry
inferredcites →https://doi.org/10.1016/0095-8956(78)90059-xopenalex-snapshot
A short proof of Chvátal's Watchman Theorem
inferredcites →https://doi.org/10.1016/s0734-189x(84)80041-9openalex-snapshot
Stationing guards in rectilinear art galleries
inferredcites →https://doi.org/10.1109/fscs.1990.89541openalex-snapshot
Triangulating a simple polygon in linear time
inferredcites →https://doi.org/10.1109/sfcs.1988.21976openalex-snapshot
Covering polygons is hard
inferredcites →https://doi.org/10.1109/tit.1986.1057165openalex-snapshot
Computational complexity of art gallery problems
inferredcites →https://doi.org/10.82308/4930openalex-snapshot
Rectilinear computational geometry

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-61332-3_173openalex-snapshot
Two-guarding a rectilinear polygon
inferred← citeshttps://doi.org/10.1007/978-1-4471-2256-2_11openalex-snapshot
Watchman Routes
inferred← citeshttps://doi.org/10.1007/978-3-540-68552-4_9openalex-snapshot
Computing Multiple Watchman Routes
inferred← citeshttps://doi.org/10.1007/978-3-540-78157-8_15openalex-snapshot
An Approximate Algorithm for Solving the Watchman Route Problem
inferred← citeshttps://doi.org/10.1007/pl00009467openalex-snapshot
Finding the Shortest Watchman Route in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s42835-021-00961-9openalex-snapshot
New Binary Particle Swarm Optimization Algorithm for Surveillance and Camera Situation Assessments
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50012-7openalex-snapshot
Polygon Decomposition
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50023-1openalex-snapshot
Art Gallery and Illumination Problems
inferred← citeshttps://doi.org/10.1016/j.asoc.2018.10.025openalex-snapshot
On the optimal placement of cameras for surveillance and the underlying set cover problem
inferred← citeshttps://doi.org/10.1016/j.cviu.2006.06.005openalex-snapshot
Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.06.037openalex-snapshot
Online exploration outside a convex obstacle
inferred← citeshttps://doi.org/10.1016/s0020-0255(97)10033-0openalex-snapshot
Watchman routes in the presence of a pair of convex polygons
inferred← citeshttps://doi.org/10.1109/icci.1992.227712openalex-snapshot
Shortest m-watchmen routes for histograms: the minmax case
inferred← citeshttps://doi.org/10.1109/taes.2021.3082668openalex-snapshot
Visual Monitoring of Points of Interest on a 2.5D Terrain Using a UAV With Limited Field-of-View Constraint
inferred← citeshttps://doi.org/10.1109/tase.2020.3014949openalex-snapshot
Visibility-Based Persistent Monitoring of Piecewise Linear Features on a Terrain Using Multiple Aerial and Ground Robots
inferred← citeshttps://doi.org/10.1145/1544012.1544038openalex-snapshot
Quality of monitoring of stochastic events by periodic & proportional-share scheduling of sensor coverage
inferred← citeshttps://doi.org/10.1145/1824766.1824774openalex-snapshot
Quality of monitoring of stochastic events by periodic and proportional-share scheduling of sensor coverage
inferred← citeshttps://doi.org/10.22215/etd/2016-11649openalex-snapshot
Coordinated Multi-Agents Patrolling Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1903.07363openalex-snapshot
Visual Monitoring for Multiple Points of Interest on a 2.5D Terrain using a UAV with Limited Field-of-View Constraint
inferred← citeshttps://doi.org/10.70675/a6ba6d8bz6453z4acdz919azb5ff5e67bf07openalex-snapshot
On the optimal placement of cameras for the surveillance of urban events : a real-world, human-assisted combinatorial approach for decision support systems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.