On the public citation graph

Shortest watchman routes in simple polygons

https://doi.org/10.1007/bf02574671
0 signed · 123 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.1016/0020-0190(88)90141-xopenalex-snapshot
Optimum watchman routes
inferredcites →https://doi.org/10.1137/0217010openalex-snapshot
An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
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/10515.10518openalex-snapshot
Optimum watchman routes

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11864349_92openalex-snapshot
Visibility of Point Clouds and Mapping of Unknown Environments
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_43openalex-snapshot
Searching a Simple Polygon by a k-Searcher
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_60openalex-snapshot
An incremental algorithm for constructing shortest watchman routes
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_235openalex-snapshot
Finding the shortest watchman route in a simple polygon
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_236openalex-snapshot
Constructing shortest watchman routes by divide-and-conquer
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_219openalex-snapshot
Shortest safari routes in simple polygons
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_56openalex-snapshot
Computing a shortest watchman path in a simple polygon in polynomial-time
inferred← citeshttps://doi.org/10.1007/978-1-4471-2256-2_11openalex-snapshot
Watchman Routes
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-031-27051-2_18openalex-snapshot
k-Transmitter Watchman Routes
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-319-03780-6_31openalex-snapshot
Touring Disjoint Polygons Problem Is NP-Hard
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_31openalex-snapshot
Competitive Online Approximation of the Optimal Search Ratio
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/978-3-642-10631-6_41openalex-snapshot
Minimum Covering with Travel Cost
inferred← citeshttps://doi.org/10.1007/978-3-642-35926-2_13openalex-snapshot
Touring Polygons: An Approximation Algorithm
inferred← citeshttps://doi.org/10.1007/bf01910637openalex-snapshot
External watchman routes
inferred← citeshttps://doi.org/10.1007/bfb0028276openalex-snapshot
Optimum guard covers and m-watchmen routes for restricted polygons
inferred← citeshttps://doi.org/10.1007/bfb0036185openalex-snapshot
Concerning the time bounds of existing shortest watchman route algorithms
inferred← citeshttps://doi.org/10.1007/bfb0054356openalex-snapshot
Moving an angle around a region
inferred← citeshttps://doi.org/10.1007/pl00009467openalex-snapshot
Finding the Shortest Watchman Route in a Simple Polygon
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/s10878-010-9303-0openalex-snapshot
Minimum covering with travel cost
inferred← citeshttps://doi.org/10.1007/s11390-011-1196-6openalex-snapshot
Multiview Visibility Estimation for Image-Based Modeling
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90137-mopenalex-snapshot
The robber route problem
inferred← citeshttps://doi.org/10.1016/0020-0255(92)90072-gopenalex-snapshot
The zookeeper route problem
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90014-jopenalex-snapshot
Watchman routes under limited visibility
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90027-4openalex-snapshot
Minimal link visibility paths inside a simple polygon
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/50020-6openalex-snapshot
Visibility in the Plane
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50023-1openalex-snapshot
Art Gallery and Illumination Problems
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.2025.102217openalex-snapshot
m-Watchmen's routes in minbar and generalized minbar polygons
inferred← citeshttps://doi.org/10.1016/j.cosrev.2010.05.001openalex-snapshot
Online algorithms for searching and exploration in the plane
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.04.010openalex-snapshot
Shortest paths in simple polygons with polygon-meet constraints
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.06.005openalex-snapshot
A 2-approximation algorithm for the zookeeper's problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.06.003openalex-snapshot
Complexity of minimum corridor guarding problems
inferred← citeshttps://doi.org/10.1016/j.robot.2013.09.004openalex-snapshot
A survey on coverage path planning for robotics
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.003openalex-snapshot
Query-point visibility constrained shortest paths in simple polygons
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.019openalex-snapshot
Touring a sequence of disjoint polygons: Complexity and extension
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114818openalex-snapshot
Observation routes and external watchman routes
inferred← citeshttps://doi.org/10.1016/s0004-3702(03)00062-6openalex-snapshot
Performance bounds for planning in unknown terrain
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00146-0openalex-snapshot
Fast computation of shortest watchman routes in simple polygons
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/s0020-0190(03)00284-9openalex-snapshot
Finding shortest safari routes in simple polygons
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.1016/s0925-7721(01)00058-xopenalex-snapshot
Optimally computing a shortest weakly visible line segment inside a simple polygon
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1017/s0263574718000292openalex-snapshot
Multi-robot coverage path planning using hexagonal segmentation for geophysical surveys
inferred← citeshttps://doi.org/10.1080/23799927.2023.2166873openalex-snapshot
A sufficient condition for visibility paths in simple polygons
inferred← citeshttps://doi.org/10.1080/23799927.2024.2357323openalex-snapshot
Fixed parameter tractable algorithms for watchman route related problems on line segment arrangements
inferred← citeshttps://doi.org/10.1109/5.163407openalex-snapshot
Recent results in art galleries (geometry)
inferred← citeshttps://doi.org/10.1109/acc.2007.4282381openalex-snapshot
Robotic Path Planning and Visibility with Limited Sensor Data
inferred← citeshttps://doi.org/10.1109/cdc.2005.1582488openalex-snapshot
Stochastic Strategies for Autonomous Robotic Surveillance
inferred← citeshttps://doi.org/10.1109/coase.2016.7743569openalex-snapshot
Multi-robot 3D coverage path planning for First Responders teams
inferred← citeshttps://doi.org/10.1109/csce60160.2023.00102openalex-snapshot
Minimizing Turns in Watchman Robot Navigation: Strategies and Solutions
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/iceice.2011.5777777openalex-snapshot
A method of placing sensor position for inspection with constrained visibility
inferred← citeshttps://doi.org/10.1109/icma.2009.5245056openalex-snapshot
Finding the lowest-cost path for searching the grid-based environment
inferred← citeshttps://doi.org/10.1109/icpr.2010.883openalex-snapshot
Visibility of Multiple Cameras in a Scene with Unknown Geometry
inferred← citeshttps://doi.org/10.1109/icra.2011.5980372openalex-snapshot
Visibility-based pursuit-evasion with probabilistic evader models
inferred← citeshttps://doi.org/10.1109/icra.2012.6225266openalex-snapshot
Shortest paths for visibility-based pursuit-evasion
inferred← citeshttps://doi.org/10.1109/icra.2014.6907074openalex-snapshot
A complete algorithm for visibility-based pursuit-evasion with multiple pursuers
inferred← citeshttps://doi.org/10.1109/icra.2016.7487621openalex-snapshot
Pursuit-evasion with fixed beams
inferred← citeshttps://doi.org/10.1109/icra.2017.7989586openalex-snapshot
Persistent pursuit-evasion: The case of the preoccupied pursuer
inferred← citeshttps://doi.org/10.1109/icseng.2017.53openalex-snapshot
Monotone Paths with Visibility Properties
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.2014.6942796openalex-snapshot
A sampling-based algorithm for multi-robot visibility-based pursuit-evasion
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/iros51168.2021.9636581openalex-snapshot
Roadmap for Visibility-based Target Tracking: Iterative Construction and Motion Strategy
inferred← citeshttps://doi.org/10.1109/itng.2011.166openalex-snapshot
Detour Admitting Short Paths
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/robot.2007.363070openalex-snapshot
View Planning Problem with Combined View and Traveling Cost
inferred← citeshttps://doi.org/10.1109/robot.2007.363163openalex-snapshot
Metric View Planning Problem with Traveling Cost and Visibility Range
inferred← citeshttps://doi.org/10.1109/robot.2008.4543610openalex-snapshot
Hybrid laser and vision based object search and localization
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185382openalex-snapshot
How to learn an unknown environment
inferred← citeshttps://doi.org/10.1109/tase.2011.2123888openalex-snapshot
Some Complexity Results for Metric View Planning Problem With Traveling Cost and Visibility Range
inferred← citeshttps://doi.org/10.1109/tpami.2004.1273987openalex-snapshot
Vc-dimension of exterior visibility
inferred← citeshttps://doi.org/10.1109/tro.2011.2174494openalex-snapshot
Shadow Information Spaces: Combinatorial Filters for Tracking Targets
inferred← citeshttps://doi.org/10.1137/060662204openalex-snapshot
Competitive Online Approximation of the Optimal Search Ratio
inferred← citeshttps://doi.org/10.1137/1.9781611973105.60openalex-snapshot
Approximating Watchman Routes
inferred← citeshttps://doi.org/10.1137/s0097539799348670openalex-snapshot
The Polygon Exploration Problem
inferred← citeshttps://doi.org/10.1142/s0218127497000546openalex-snapshot
Adaptive Evolutionary Optimization of Team Work
inferred← citeshttps://doi.org/10.1142/s0218195910003232openalex-snapshot
GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
inferred← citeshttps://doi.org/10.1142/s0218195993000063openalex-snapshot
OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS
inferred← citeshttps://doi.org/10.1142/s0218195995000246openalex-snapshot
SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
inferred← citeshttps://doi.org/10.1142/s0218195999000212openalex-snapshot
CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
inferred← citeshttps://doi.org/10.1145/177424.177984openalex-snapshot
Optimal linear-time algorithm for the shortest illuminating line segment in a polygon
inferred← citeshttps://doi.org/10.1145/2133803.2184449openalex-snapshot
Exact solutions and bounds for general art gallery problems
inferred← citeshttps://doi.org/10.1145/2486159.2486176openalex-snapshot
Optimal patrolling of fragmented boundaries
inferred← citeshttps://doi.org/10.1145/274787.274788openalex-snapshot
How to learn an unknown environment. I
inferred← citeshttps://doi.org/10.1145/304893.304981openalex-snapshot
Visibility-based pursuit-evasion in a polygonal room with a door
inferred← citeshttps://doi.org/10.1145/3399431openalex-snapshot
Connected Wireless Camera Network Deployment with Visibility Coverage
inferred← citeshttps://doi.org/10.1145/58395.58397openalex-snapshot
Computational geometry column
inferred← citeshttps://doi.org/10.1145/780542.780612openalex-snapshot
Touring a sequence of polygons
inferred← citeshttps://doi.org/10.1177/0278364907080424openalex-snapshot
Cooperative Observation of Multiple Moving Targets: an algorithm and its formalization
inferred← citeshttps://doi.org/10.1177/0278364917711535openalex-snapshot
Complete and optimal visibility-based pursuit-evasion
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.14288/1.0051866openalex-snapshot
Optimally sweeping convex polygons with two and three guards
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.1609/aaai.v26i1.8381openalex-snapshot
Searching for Optimal Off-Line Exploration Paths in Grid Environments for a Robot with Limited Visibility
inferred← citeshttps://doi.org/10.1613/jair.1.13685openalex-snapshot
Solving the Watchman Route Problem with Heuristic Search
inferred← citeshttps://doi.org/10.21236/ada226923openalex-snapshot
Planning Monotone Paths to Visit a Set of Obstacles
inferred← citeshttps://doi.org/10.2498/cit.1001182openalex-snapshot
Object Search and Localization for an Indoor Mobile Robot
inferred← citeshttps://doi.org/10.2514/1.i011541openalex-snapshot
Minimum-Time Dubins Airplane Inspection Tours with Visibility and Dwell Time Constraints
inferred← citeshttps://doi.org/10.3233/fun-2001-45308openalex-snapshot
Approximating a Shortest Watchman Route
inferred← citeshttps://doi.org/10.3745/kipsta.2002.9a.4.595openalex-snapshot
An algorithm for finding a watchman route with minimum links in the characteristic polygons
inferred← citeshttps://doi.org/10.4018/978-1-4666-2479-5.ch010openalex-snapshot
How Ants Can Efficiently Solve the Generalized Watchman Route Problem
inferred← citeshttps://doi.org/10.4018/978-1-4666-4607-0.ch022openalex-snapshot
How Ants Can Efficiently Solve the Generalized Watchman Route Problem
inferred← citeshttps://doi.org/10.4018/jsir.2011070101openalex-snapshot
How Ants Can Efficiently Solve Generalized Watchman Route Problem
inferred← citeshttps://doi.org/10.4108/airo.3492openalex-snapshot
Efficiently Guiding K-Robots Along Pathways with Minimal Turns
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.65openalex-snapshot
The Visibility Center of a Simple Polygon
inferred← citeshttps://doi.org/10.4310/cms.2011.v9.n2.a9openalex-snapshot
Approximate solutions to several visibility optimization problems
inferred← citeshttps://doi.org/10.47749/t/unicamp.2008.444561openalex-snapshot
Patrulhamento multiagente
inferred← citeshttps://doi.org/10.48550/arxiv.1101.2360openalex-snapshot
Minimum Covering with Travel Cost
inferred← citeshttps://doi.org/10.5555/314464.314473openalex-snapshot
On-line search in a simple polygon
inferred← citeshttps://doi.org/10.5555/643002.643005openalex-snapshot
Improved exploration of rectilinear polygons
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.