On the public citation graph
Hiding people in polygons
0 signed · 50 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.1007/bf00146907openalex-snapshot
Galleries need fewer mobile guards: A variation on Chv�tal's theorem
inferredcites →https://doi.org/10.1007/bf01918136openalex-snapshot
An alternate proof of the rectilinear art gallery theorem
inferredcites →https://doi.org/10.1007/bf02757075openalex-snapshot
The combinatorial structure of (m, n)-convex sets
inferredcites →https://doi.org/10.1007/bf02771549openalex-snapshot
Convexity and a certain propertyP m
inferredcites →https://doi.org/10.1007/bf02771570openalex-snapshot
On sets having finitely many points of local nonconvexity and propertyP m
inferredcites →https://doi.org/10.1007/bf02834752openalex-snapshot
A decomposition theorem form-convex sets
inferredcites →https://doi.org/10.1007/bf02834753openalex-snapshot
General decomposition theorems form-convex sets in the plane
inferredcites →https://doi.org/10.1016/0020-0190(86)90050-5openalex-snapshot
On Gallery Watchmen in grids
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.1080/00207168508803456openalex-snapshot
A simple proof of the rectilinear art gallery theorem
inferredcites →https://doi.org/10.1109/tit.1986.1057165openalex-snapshot
Computational complexity of art gallery problems
inferredcites →https://doi.org/10.1137/0604020openalex-snapshot
Traditional Galleries Require Fewer Watchmen
inferredcites →https://doi.org/10.1145/323233.323247openalex-snapshot
Decomposing polygonal regions into convex quadrilaterals
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-19487-8_10openalex-snapshot
On recognizing and characterizing visibility graphs of simple polygons
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_16openalex-snapshot
Maximum Clique and Minimum Clique Partition in Visibility Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_7openalex-snapshot
Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_20openalex-snapshot
How Many People Can Hide in a Terrain?
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_124openalex-snapshot
Algorithms for convex visibility problems
inferred← citeshttps://doi.org/10.1007/978-4-431-68093-2_3openalex-snapshot
Computational Geometry: Recent Developments
inferred← citeshttps://doi.org/10.1007/bf00147413openalex-snapshot
Covering and guarding polygons using L k -sets
inferred← citeshttps://doi.org/10.1007/bf02770871openalex-snapshot
On recognizing and characterizing visibility graphs of simple polygons
inferred← citeshttps://doi.org/10.1007/s00446-019-00362-2openalex-snapshot
Meeting in a polygon by anonymous oblivious robots
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00285-5openalex-snapshot
Hiding points in arrangements of segments
inferred← citeshttps://doi.org/10.1016/0020-0255(95)00052-6openalex-snapshot
Placing guards inside orthogonal polygons
inferred← citeshttps://doi.org/10.1016/0167-8655(93)90145-4openalex-snapshot
On recognizing unions of two convex polygons and related problems
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90010-4openalex-snapshot
Characterizing and recognizing weak visibility polygons
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.2006.01.004openalex-snapshot
Finding minimum hidden guard sets in polygons—tight approximability results
inferred← citeshttps://doi.org/10.1016/j.comgeo.2018.10.001openalex-snapshot
FO model checking on geometric graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103820openalex-snapshot
On colourability of polygon visibility graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2006.09.004openalex-snapshot
Computing the maximum clique in the visibility graph of a simple polygon
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.008openalex-snapshot
Connecting guards with minimum Steiner points inside simple polygons
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00029-3openalex-snapshot
Inapproximability of finding maximum hidden sets on polygons and terrains
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00070-0openalex-snapshot
Efficient visibility queries in simple polygons
inferred← citeshttps://doi.org/10.1109/5.163407openalex-snapshot
Recent results in art galleries (geometry)
inferred← citeshttps://doi.org/10.1109/iccsa.2008.19openalex-snapshot
Estimating the Maximum Hidden Vertex Set in Polygons
inferred← citeshttps://doi.org/10.1109/itw.2009.5351372openalex-snapshot
A geometrical analysis of obstructed wireless networks
inferred← citeshttps://doi.org/10.1145/2543581.2543589openalex-snapshot
Unsolved problems in visibility graphs of points, segments, and polygons
inferred← citeshttps://doi.org/10.4108/airo.3547openalex-snapshot
Concealing Robots in Environments: Enhancing Navigation and Privacy through Stealth Integration
inferred← citeshttps://doi.org/10.47749/t/unicamp.2013.911592openalex-snapshot
Sobre a caracterização de grafos de visibilidade de leques convexos
inferred← citeshttps://doi.org/10.48550/arxiv.1012.5187openalex-snapshot
Unsolved Problems in Visibility Graphs of Points, Segments and Polygons
inferred← citeshttps://doi.org/10.48550/arxiv.1206.1803openalex-snapshot
Hidden Mobile Guards in Simple Polygons
inferred← citeshttps://doi.org/10.48550/arxiv.1705.00324openalex-snapshot
Meeting in a Polygon by Anonymous Oblivious Robots
inferred← citeshttps://doi.org/10.48550/arxiv.1708.05815openalex-snapshot
Minimum Hidden Guarding of Histogram Polygons
inferred← citeshttps://doi.org/10.48550/arxiv.1709.01569openalex-snapshot
Guarding Path Polygons with Orthogonal Visibility
inferred← citeshttps://doi.org/10.7275/cbjb-4524openalex-snapshot
Vehicular Ad Hoc Networks: Interplay of Geometry, Communications, and Traffic
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.