On the public citation graph
Finding the Shortest Watchman Route in a Simple Polygon
0 signed · 90 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/3-540-54945-5_60openalex-snapshot
An incremental algorithm for constructing shortest watchman routes
inferredcites →https://doi.org/10.1007/3-540-57568-5_235openalex-snapshot
Finding the shortest watchman route in a simple polygon
inferredcites →https://doi.org/10.1007/3-540-57568-5_236openalex-snapshot
Constructing shortest watchman routes by divide-and-conquer
inferredcites →https://doi.org/10.1007/bf01840360openalex-snapshot
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf02574671openalex-snapshot
Shortest watchman routes in simple polygons
inferredcites →https://doi.org/10.1007/bfb0028276openalex-snapshot
Optimum guard covers and m-watchmen routes for restricted polygons
inferredcites →https://doi.org/10.1007/bfb0036185openalex-snapshot
Concerning the time bounds of existing shortest watchman route algorithms
inferredcites →https://doi.org/10.1109/fscs.1990.89541openalex-snapshot
Triangulating a simple polygon in linear time
inferredcites →https://doi.org/10.1109/tit.1986.1057165openalex-snapshot
Computational complexity of art gallery problems
inferredcites →https://doi.org/10.1137/0213024openalex-snapshot
Fast Algorithms for Finding Nearest Common Ancestors
inferredcites →https://doi.org/10.1142/s0218195993000063openalex-snapshot
OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS
inferredcites →https://doi.org/10.1142/s0218195993000233openalex-snapshot
AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
inferredcites →https://doi.org/10.1142/s0218195999000212openalex-snapshot
CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
inferredcites →https://doi.org/10.1145/147508.147511openalex-snapshot
An optimal algorithm for intersecting line segments in the plane
inferredcites →https://doi.org/10.1145/322139.322142openalex-snapshot
An Optimal Algorithm for Finding the Kernel of a Polygon
inferredcites →https://doi.org/10.1145/98524.98600openalex-snapshot
On solving geometric optimization problems using shortest paths
inferredcites →https://doi.org/10.5555/313559.313611openalex-snapshot
A pedestrian approach to ray shooting: shoot a ray, take a walk
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/cviu.2000.0835openalex-snapshot
Image Analysis and Computer Vision: 1999
inferred← citeshttps://doi.org/10.1007/10991541_11openalex-snapshot
Online Searching with an Autonomous Robot
inferred← citeshttps://doi.org/10.1007/11750321_17openalex-snapshot
Linear-Time 2-Approximation Algorithm for the Watchman Route Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-10801-4_13openalex-snapshot
Patrolling on Dynamic Ring Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-25332-5_16openalex-snapshot
Watchman Routes for Robot Inspection
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_25openalex-snapshot
Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_24openalex-snapshot
Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles
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-39658-1_41openalex-snapshot
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
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/s00037-005-0200-3openalex-snapshot
On the complexity of approximating tsp with neighborhoods and related problems
inferred← citeshttps://doi.org/10.1007/s00453-024-01245-0openalex-snapshot
Approximation Algorithms for the Two-Watchman Route in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s10514-012-9319-7openalex-snapshot
Multi-robot repeated area coverage
inferred← citeshttps://doi.org/10.1007/s10846-019-01039-5openalex-snapshot
Stochastic Multi-Robot Patrolling with Limited Visibility
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.08.005openalex-snapshot
Online searching with an autonomous robot
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.06.003openalex-snapshot
Polygon exploration with time-discrete vision
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.02.001openalex-snapshot
Watchman tours for polygons with holes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.11.008openalex-snapshot
Watchman routes for lines and line segments
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.07.003openalex-snapshot
On Romeo and Juliet problems: Minimizing distance-to-sight
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102217openalex-snapshot
m-Watchmen's routes in minbar and generalized minbar polygons
inferred← citeshttps://doi.org/10.1016/j.ipl.2022.106262openalex-snapshot
Online search for a hyperplane in high-dimensional Euclidean space
inferred← citeshttps://doi.org/10.1016/j.robot.2022.104037openalex-snapshot
Summarizing large scale 3D mesh for urban navigation
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.021openalex-snapshot
A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114818openalex-snapshot
Observation routes and external watchman routes
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00259-9openalex-snapshot
The Traveling Salesman Problem for lines in the plane
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00502-1openalex-snapshot
Minimum-link watchman tours
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00047-6openalex-snapshot
Approximation algorithms for TSP with neighborhoods in the plane
inferred← citeshttps://doi.org/10.1080/23799927.2023.2166873openalex-snapshot
A sufficient condition for visibility paths in simple polygons
inferred← citeshttps://doi.org/10.1109/iceice.2011.5777777openalex-snapshot
A method of placing sensor position for inspection with constrained visibility
inferred← citeshttps://doi.org/10.1109/icra.2019.8794305openalex-snapshot
Tree Search Techniques for Minimizing Detectability and Maximizing Visibility
inferred← citeshttps://doi.org/10.1109/infocom.2014.6848052openalex-snapshot
Connected wireless camera network deployment with visibility coverage
inferred← citeshttps://doi.org/10.1109/iros.2015.7353849openalex-snapshot
Visibility-based persistent monitoring with robot teams
inferred← citeshttps://doi.org/10.1109/iros.2018.8593372openalex-snapshot
Summarizing Large Scale 3D Mesh
inferred← citeshttps://doi.org/10.1109/iros.2018.8593508openalex-snapshot
Persistent Monitoring with Refueling on a Terrain Using a Team of Aerial and Ground Robots
inferred← citeshttps://doi.org/10.1109/iros.2018.8593960openalex-snapshot
Visibility-Based Monitoring of a Path Using a Heterogeneous Robot Team
inferred← citeshttps://doi.org/10.1109/iros40897.2019.8967602openalex-snapshot
Path planning with Incremental Roadmap Update for Visibility-based Target Tracking
inferred← citeshttps://doi.org/10.1109/itsc.2018.8569447openalex-snapshot
Navigability Graph Extraction From Large-Scale 3D Point Cloud
inferred← citeshttps://doi.org/10.1109/jcsse49651.2020.9268436openalex-snapshot
Building two communication towers over a terrain
inferred← citeshttps://doi.org/10.1109/lra.2017.2714980openalex-snapshot
Visibility-Based Target-Tracking Game: Bounds and Tracking Strategies
inferred← citeshttps://doi.org/10.1109/lra.2022.3159824openalex-snapshot
Towards a Continuous Solution of the $d$-Visibility Watchman Route Problem in a Polygon With Holes
inferred← citeshttps://doi.org/10.1109/milcom.2017.8170777openalex-snapshot
Multi-vehicle patrolling with limited visibility and communication constraints
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.1137/1.9781611973105.60openalex-snapshot
Approximating Watchman Routes
inferred← citeshttps://doi.org/10.1137/1.9781611975482.67openalex-snapshot
A PTAS for Euclidean TSP with Hyperplane Neighborhoods
inferred← citeshttps://doi.org/10.1137/s0097539799348670openalex-snapshot
The Polygon Exploration Problem
inferred← citeshttps://doi.org/10.1142/s0218195920500053openalex-snapshot
How to Keep an Eye on Small Things
inferred← citeshttps://doi.org/10.1142/s1793830912500449openalex-snapshot
THE TRAVELING SALESMAN PROBLEM FOR LINES AND RAYS IN THE PLANE
inferred← citeshttps://doi.org/10.1142/s179383092250063xopenalex-snapshot
Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles
inferred← citeshttps://doi.org/10.1145/2525314.2525355openalex-snapshot
Sweeping a terrain by collaborative aerial vehicles
inferred← citeshttps://doi.org/10.1145/2850418openalex-snapshot
The Traveling Salesman Problem for Lines, Balls, and Planes
inferred← citeshttps://doi.org/10.1145/3399431openalex-snapshot
Connected Wireless Camera Network Deployment with Visibility Coverage
inferred← citeshttps://doi.org/10.14258/izvasu(2024)1-14openalex-snapshot
On Some Variations of the Problem of Protecting the Art Gallery
inferred← citeshttps://doi.org/10.15439/2025f4752openalex-snapshot
Improved upper bounds on the shortest watchman route in simple polygons: Dependence on reflex vertices and triangulation strategies
inferred← citeshttps://doi.org/10.15439/2026f5997openalex-snapshot
Weak segment visibility in simple polygons: A reflex-vertex scanning algorithm with a guaranteed-area lower bound
inferred← citeshttps://doi.org/10.20382/jocg.v7i2a5openalex-snapshot
Shortest Path to a Segment and Quickest Visibility Queries
inferred← citeshttps://doi.org/10.20382/jocg.v8i2a5openalex-snapshot
On the Complexity of Minimum-Link Path Problems
inferred← citeshttps://doi.org/10.2139/ssrn.7321750openalex-snapshot
Stochastic Multi-Robot Monitoring on Graphs under Markovian Mobility
inferred← citeshttps://doi.org/10.25148/etd.fidc006561openalex-snapshot
A Dynamical System Approach for Resource-Constrained Mobile Robotics
inferred← citeshttps://doi.org/10.3233/fun-2001-45308openalex-snapshot
Approximating a Shortest Watchman Route
inferred← citeshttps://doi.org/10.4230/dagsemproc.06421.8openalex-snapshot
Polygon Exploration with Discrete Vision
inferred← citeshttps://doi.org/10.4230/lipics.socg.2020.24openalex-snapshot
Geometric Secluded Paths and Planar Satisfiability
inferred← citeshttps://doi.org/10.48550/arxiv.0807.2358openalex-snapshot
Polygon Exploration with Time-Discrete Vision
inferred← citeshttps://doi.org/10.48550/arxiv.1708.01461openalex-snapshot
A Linear-time Algorithm for Orthogonal Watchman Route Problem with Minimum Bends
inferred← citeshttps://doi.org/10.48550/arxiv.1808.04349openalex-snapshot
Patrolling on Dynamic Ring Networks
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.48550/arxiv.2109.11712openalex-snapshot
Feasibility study of urban flood mapping using traffic signs for route optimization
inferred← citeshttps://doi.org/10.5555/2627817.2627876openalex-snapshot
The traveling salesman problem for lines, balls and planes
inferred← citeshttps://doi.org/10.5555/365411.365417openalex-snapshot
Approximation algorithms for TSP with neighborhoods in the plane
inferred← citeshttps://doi.org/10.70675/7dc799e9z1046z4887z8074z8001c8c2101bopenalex-snapshot
Extraction d'un graphe de navigabilité à partir d'un nuage de points 3D enrichis.
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.