On the public citation graph
An alternate proof of the rectilinear art gallery theorem
0 signed · 79 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/978-1-4684-6686-7_26openalex-snapshot
Games, Graphs, and Galleries
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/0734-189x(84)90207-xopenalex-snapshot
Stationing guards in rectilinear art galleries
inferredcites →https://doi.org/10.1016/s0734-189x(84)80041-9openalex-snapshot
Stationing guards in rectilinear art galleries
inferredcites →https://doi.org/10.1137/0604020openalex-snapshot
Traditional Galleries Require Fewer Watchmen
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_8openalex-snapshot
Problems of posting sentries: Variations on the art gallery theorem
inferred← citeshttps://doi.org/10.1007/3-540-44860-8_90openalex-snapshot
Approximation Algorithms to Minimum Vertex Cover Problems on Polygons and Terrains
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_68openalex-snapshot
Computing a viewpoint of a set of points inside a polygon
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_16openalex-snapshot
Guarding Galleries and Terrains
inferred← citeshttps://doi.org/10.1007/978-1-4419-8420-3_2openalex-snapshot
Region-Guarding Problem in 3-D Areas
inferred← citeshttps://doi.org/10.1007/978-1-4613-8997-2_23openalex-snapshot
Computational Complexity of Art Gallery Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_34openalex-snapshot
Guarding Disjoint Orthogonal Polygons in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-031-74758-8_4openalex-snapshot
A Proportion of Visibility Polygon’s Surface to the Entire Polygon’s Surface: A Lower Bound of the Proportion Derived for General Polygons of Any Shape and Orthogonal Polygons
inferred← citeshttps://doi.org/10.1007/978-3-319-20385-0_5openalex-snapshot
Design for Manufacturability with E-Beam Lithography
inferred← citeshttps://doi.org/10.1007/978-3-319-22177-9_4openalex-snapshot
On the Enumeration of Permutominoes
inferred← citeshttps://doi.org/10.1007/978-3-319-30262-1_6openalex-snapshot
Visibility, Hausdorffness, Algebra and Separation Spaces
inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_13openalex-snapshot
Quadratic-Time Linear-Space Algorithms for Generating Orthogonal Polygons with a Given Number of Vertices
inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_14openalex-snapshot
Partitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: Lower and Upper Bounds on the Number of Pieces
inferred← citeshttps://doi.org/10.1007/978-3-540-25945-9_36openalex-snapshot
Generating Random Orthogonal Polygons
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_59openalex-snapshot
On Some City Guarding Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_6openalex-snapshot
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_3openalex-snapshot
Approximation Algorithms for Art Gallery Problems in Polygons and Terrains
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_65openalex-snapshot
Area Bounds of Rectilinear Polygons Realized by Angle Sequences
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_9openalex-snapshot
Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
inferred← citeshttps://doi.org/10.1007/bf00146907openalex-snapshot
Galleries need fewer mobile guards: A variation on Chv�tal's theorem
inferred← citeshttps://doi.org/10.1007/bfb0032069openalex-snapshot
On the rectilinear art gallery problem
inferred← citeshttps://doi.org/10.1007/s00373-024-02880-8openalex-snapshot
Ortho-Unit Polygons can be Guarded with at most $$\left\lfloor \frac{n-4}{8} \right\rfloor $$ Guards
inferred← citeshttps://doi.org/10.1007/s00453-001-0045-3openalex-snapshot
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers
inferred← citeshttps://doi.org/10.1007/s00453-018-0433-6openalex-snapshot
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation
inferred← citeshttps://doi.org/10.1007/s00454-012-9429-1openalex-snapshot
The Art Gallery Theorem for Polyominoes
inferred← citeshttps://doi.org/10.1007/s00454-014-9587-4openalex-snapshot
Perfect Graphs and Guarding Rectilinear Art Galleries
inferred← citeshttps://doi.org/10.1007/s00454-015-9756-0openalex-snapshot
How to Guard Orthogonal Polygons: Diagonal Graphs and Vertex Covers
inferred← citeshttps://doi.org/10.1007/s12065-021-00616-8openalex-snapshot
Minimum landmarks for robot localization in orthogonal environments
inferred← citeshttps://doi.org/10.1016/0020-0255(92)90077-lopenalex-snapshot
On covering orthogonal polygons with star-shaped polygons
inferred← citeshttps://doi.org/10.1016/0925-7721(96)00014-4openalex-snapshot
Generalized guarding and partitioning for rectilinear polygons
inferred← citeshttps://doi.org/10.1016/b978-0-444-70467-2.50016-3openalex-snapshot
Guard Placement in Rectilinear Polygons
inferred← citeshttps://doi.org/10.1016/j.amc.2026.130353openalex-snapshot
A fast constructive algorithm for large-scale generation of orthogonal polygonal structures with applications to benchmarking geometric algorithms
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.02.007openalex-snapshot
Normal art galleries: Wall in – all in
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.02.002openalex-snapshot
Tight bounds for beacon-based coverage in simple rectilinear polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.05.004openalex-snapshot
Area bounds of rectilinear polygons realized by angle sequences
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.102054openalex-snapshot
The dispersive art gallery problem
inferred← citeshttps://doi.org/10.1016/j.dam.2009.12.004openalex-snapshot
Approximation algorithms for art gallery problems in polygons
inferred← citeshttps://doi.org/10.1016/j.dam.2016.12.015openalex-snapshot
Approximability of guarding weak visibility polygons
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.05.014openalex-snapshot
Guarding galleries and terrains
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.03.014openalex-snapshot
An “Art Gallery Theorem” for pyramids
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.06.012openalex-snapshot
New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision
inferred← citeshttps://doi.org/10.1016/s0734-189x(84)80041-9openalex-snapshot
Stationing guards in rectilinear art galleries
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00024-8openalex-snapshot
Edge guards in rectilinear polygons
inferred← citeshttps://doi.org/10.1080/00207160903154733openalex-snapshot
Drawing complete binary trees inside rectilinear polygons
inferred← citeshttps://doi.org/10.1080/00207168508803456openalex-snapshot
A simple proof of the rectilinear art gallery theorem
inferred← citeshttps://doi.org/10.1109/aspdac.2013.6509604openalex-snapshot
L-shape based layout fracturing for e-beam lithography
inferred← citeshttps://doi.org/10.1109/glsv.1996.497620openalex-snapshot
Partitioning algorithms for corner stitching [VLSI]
inferred← citeshttps://doi.org/10.1109/icra.2012.6224694openalex-snapshot
Navigation among visually connected sets of partially distinguishable landmarks
inferred← citeshttps://doi.org/10.1109/tit.1986.1057165openalex-snapshot
Computational complexity of art gallery problems
inferred← citeshttps://doi.org/10.1109/tro.2011.2169619openalex-snapshot
On Optimizing Autonomous Pipeline Inspection
inferred← citeshttps://doi.org/10.1109/tsmc.2016.2560533openalex-snapshot
Data Fusion and Type-2 Fuzzy Inference in Contextual Data Stream Monitoring
inferred← citeshttps://doi.org/10.1137/0221051openalex-snapshot
Searching for a Mobile Intruder in a Polygonal Region
inferred← citeshttps://doi.org/10.1137/0607051openalex-snapshot
A Short Proof of the Rectilinear Art Gallery Theorem
inferred← citeshttps://doi.org/10.1142/s0218195921500060openalex-snapshot
Vertex Guarding for Dynamic Orthogonal Art Galleries
inferred← citeshttps://doi.org/10.1145/10515.10520openalex-snapshot
Minimally covering a horizontally convex orthogonal polygon
inferred← citeshttps://doi.org/10.1145/234860.234865openalex-snapshot
Efficient decomposition of polygons into L-shapes with application to VLSI layouts
inferred← citeshttps://doi.org/10.1145/323233.323247openalex-snapshot
Decomposing polygonal regions into convex quadrilaterals
inferred← citeshttps://doi.org/10.1145/3629188.3629192openalex-snapshot
Algorithm for Modified Minimum Length Sliding k Transmitter Problem
inferred← citeshttps://doi.org/10.1177/23998083211037347openalex-snapshot
Space decomposition based on visible objects in an indoor environment
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.15607/rss.2011.vii.011openalex-snapshot
An Art Gallery Approach to Ensuring that Landmarks are Distinguishable
inferred← citeshttps://doi.org/10.48550/arxiv.1011.1917openalex-snapshot
Normal art galleries: wall in - all in
inferred← citeshttps://doi.org/10.48550/arxiv.1505.05106openalex-snapshot
Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons
inferred← citeshttps://doi.org/10.48550/arxiv.2007.06052openalex-snapshot
City Guarding with Limited Field of View
inferred← citeshttps://doi.org/10.48550/arxiv.2106.12969openalex-snapshot
Approximability of (Simultaneous) Class Cover for Boxes
inferred← citeshttps://doi.org/10.48550/arxiv.2107.05540openalex-snapshot
A new metaheuristic approach for the art gallery problem
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0603057openalex-snapshot
Guard Placement For Wireless Localization
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.