On the public citation graph

Computing Vision Points in Polygons

https://doi.org/10.1007/pl00009271
0 signed · 37 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.1002/net.3230140304openalex-snapshot
Euclidean shortest paths in the presence of rectilinear barriers
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-60220-8_56openalex-snapshot
Computing a shortest watchman path in a simple polygon in polynomial-time
inferredcites →https://doi.org/10.1007/bf01377183openalex-snapshot
Ray shooting in polygons using geodesic triangulations
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/bf02187747openalex-snapshot
Visibility and intersection problems in plane geometry
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/0196-6774(81)90019-5openalex-snapshot
A linear algorithm for computing the visibility polygon from a point
inferredcites →https://doi.org/10.1016/0734-189x(83)90065-8openalex-snapshot
Visibility of a simple polygon
inferredcites →https://doi.org/10.1016/0925-7721(92)90010-popenalex-snapshot
Walking an unknown street with bounded detour
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50012-8openalex-snapshot
Minimum Decompositions of Polygonal Objects
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.1145/109648.109667openalex-snapshot
The two guards problem
inferredcites →https://doi.org/10.1145/160985.161163openalex-snapshot
An optimal algorithm for the two-guard problem
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.1007/3-540-45993-6_14openalex-snapshot
On the Competitive Complexity of Navigation Tasks
inferred← citeshttps://doi.org/10.1007/978-3-031-27051-2_18openalex-snapshot
k-Transmitter Watchman Routes
inferred← citeshttps://doi.org/10.1007/s00224-004-1155-5openalex-snapshot
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment
inferred← citeshttps://doi.org/10.1007/s10514-020-09963-4openalex-snapshot
Game tree search for minimizing detectability and maximizing visibility
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.06.003openalex-snapshot
Polygon exploration with time-discrete vision
inferred← citeshttps://doi.org/10.1109/icais53314.2022.9742991openalex-snapshot
A Systematic Approach on Visibility Analysis for Video Surveillance
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/iros.2015.7353849openalex-snapshot
Visibility-based persistent monitoring with robot teams
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/iros51168.2021.9635898openalex-snapshot
Multi-Agent Reinforcement Learning for Visibility-based Persistent Monitoring
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.9781611973402.72openalex-snapshot
Near-optimal labeling schemes for nearest common ancestors
inferred← citeshttps://doi.org/10.1137/s0097539702419352openalex-snapshot
An Optimal Competitive Strategy for Walking in Streets
inferred← citeshttps://doi.org/10.1142/s0218195910003232openalex-snapshot
GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
inferred← citeshttps://doi.org/10.1145/564870.564914openalex-snapshot
Nearest common ancestors
inferred← citeshttps://doi.org/10.4230/dagsemproc.06421.8openalex-snapshot
Polygon Exploration with Discrete Vision
inferred← citeshttps://doi.org/10.48550/arxiv.0807.2358openalex-snapshot
Polygon Exploration with Time-Discrete Vision
inferred← citeshttps://doi.org/10.48550/arxiv.1612.03246openalex-snapshot
Algorithms for Visibility-Based Monitoring with Robot Teams
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.