On the public citation graph
External watchman routes
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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230140304openalex-snapshot
Euclidean shortest paths in the presence of rectilinear barriers
inferredcites →https://doi.org/10.1007/bf02574671openalex-snapshot
Shortest watchman routes in simple polygons
inferredcites →https://doi.org/10.1016/0020-0190(85)90044-4openalex-snapshot
Constructing the visibility graph for n-line segments in O(n2) time
inferredcites →https://doi.org/10.1016/0031-3203(82)90057-7openalex-snapshot
On a convex hull algorithm for polygons and its application to triangulation problems
inferredcites →https://doi.org/10.1016/0166-218x(91)90063-3openalex-snapshot
Computing external farthest neighbors for a simple polygon
inferredcites →https://doi.org/10.1109/sfcs.1985.65openalex-snapshot
Visibility-polygon search and euclidean shortest paths
inferredcites →https://doi.org/10.1109/tc.1981.1675729openalex-snapshot
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge
inferredcites →https://doi.org/10.1137/0220055openalex-snapshot
An Output-Sensitive Algorithm for Computing Visibility Graphs
inferredcites →https://doi.org/10.1145/10515.10516openalex-snapshot
Linear time algorithms for visibility and shortest path problems inside simple polygons
inferredcites →https://doi.org/10.1145/73833.73861openalex-snapshot
Determining sector visibility of a polygon
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_26openalex-snapshot
Observation Routes and External 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.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50023-1openalex-snapshot
Art Gallery and Illumination Problems
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.02.007openalex-snapshot
Minimum-perimeter enclosures
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.06.024openalex-snapshot
Optimal placement of base stations in border surveillance using limited capacity drones
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114818openalex-snapshot
Observation routes and external watchman routes
inferred← citeshttps://doi.org/10.1109/5.163407openalex-snapshot
Recent results in art galleries (geometry)
inferred← citeshttps://doi.org/10.1109/icseng.2017.53openalex-snapshot
Monotone Paths with Visibility Properties
inferred← citeshttps://doi.org/10.1109/robot.2009.5152256openalex-snapshot
Multi-robot tree and graph exploration
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185382openalex-snapshot
How to learn an unknown environment
inferred← citeshttps://doi.org/10.1109/tro.2011.2121170openalex-snapshot
Multirobot Tree and Graph Exploration
inferred← citeshttps://doi.org/10.1115/1.2039100openalex-snapshot
Determining Setup Orientations From the Visibility of Slice Geometry for Rapid Computer Numerically Controlled Machining
inferred← citeshttps://doi.org/10.1117/12.25506openalex-snapshot
Algorithmic approaches to optimal route planning
inferred← citeshttps://doi.org/10.14288/1.0051866openalex-snapshot
Optimally sweeping convex polygons with two and three guards
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.