On the public citation graph

Visibility with One Reflection

https://doi.org/10.1007/pl00009368
0 signed · 44 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.1007/3-540-61422-2_139openalex-snapshot
Visibility with multiple reflections
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/bf02187913openalex-snapshot
Computing the link center of a simple polygon
inferredcites →https://doi.org/10.1007/bf02574009openalex-snapshot
Computability and complexity of ray tracing
inferredcites →https://doi.org/10.1007/bfb0028976openalex-snapshot
An O(n log n) algorithm for computing a link center in a simple polygon
inferredcites →https://doi.org/10.1007/pl00009378openalex-snapshot
Visibility with Multiple Reflections
inferredcites →https://doi.org/10.1016/0167-2789(86)90062-xopenalex-snapshot
Billiards in polygons
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/b978-044482537-7/50023-1openalex-snapshot
Art Gallery and Illumination Problems
inferredcites →https://doi.org/10.1016/s0925-7721(97)00021-7openalex-snapshot
Visibility with multiple diffuse reflections
inferredcites →https://doi.org/10.1090/dol/011openalex-snapshot
Old and New Unsolved Problems in Plane Geometry and Number Theory
inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
inferredcites →https://doi.org/10.1109/tc.1981.1675729openalex-snapshot
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge
inferredcites →https://doi.org/10.1109/tit.1986.1057165openalex-snapshot
Computational complexity of art gallery problems
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/41958.41959openalex-snapshot
Computing the link center of a simple polygon
inferredcites →https://doi.org/10.1145/73833.73841openalex-snapshot
An efficient algorithm for link-distance problems
inferredcites →https://doi.org/10.1145/800250.807481openalex-snapshot
On visible surface generation by a priori tree structures
inferredcites →https://doi.org/10.1201/9781420035315-27openalex-snapshot
Shortest Paths and Networks
inferredcites →https://doi.org/10.1201/9781420035315.ch27openalex-snapshot
Shortest Paths and Networks
inferredcites →https://doi.org/10.1215/s0012-7094-49-01613-0openalex-snapshot
Some properties of L-sets in the plane
inferredcites →https://doi.org/10.2307/2324140openalex-snapshot
Old and New Unsolved Problems in Plane Geometry and Number Theory.

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.1999.0746openalex-snapshot
Image Analysis and Computer Vision: 1998
inferred← citeshttps://doi.org/10.1007/11682462_13openalex-snapshot
The Complexity of Diffuse Reflections in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-031-27051-2_8openalex-snapshot
Reflective Guarding a Gallery
inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_4openalex-snapshot
How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_5openalex-snapshot
Algorithms for Computing Diffuse Reflection Paths in Polygons
inferred← citeshttps://doi.org/10.1007/pl00009378openalex-snapshot
Visibility with Multiple Reflections
inferred← citeshttps://doi.org/10.1007/s00371-011-0670-zopenalex-snapshot
Algorithms for computing diffuse reflection paths in polygons
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50020-6openalex-snapshot
Visibility in the Plane
inferred← citeshttps://doi.org/10.1016/j.dam.2012.12.020openalex-snapshot
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
inferred← citeshttps://doi.org/10.1016/j.dam.2015.04.025openalex-snapshot
Diffuse reflection diameter in simple polygons
inferred← citeshttps://doi.org/10.1016/j.endm.2013.10.054openalex-snapshot
Diffuse Reflections in Simple Polygons
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.02.011openalex-snapshot
Visibility extension via mirror-edges to cover invisible segments
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115083openalex-snapshot
Visibility extension via reflection
inferred← citeshttps://doi.org/10.1109/mmar55195.2022.9874340openalex-snapshot
Bouncing Robots in Rectilinear Polygons
inferred← citeshttps://doi.org/10.1109/mmar58394.2023.10242582openalex-snapshot
Arithmetic Billiard Paths Revisited: Escaping from a Rectangular Room
inferred← citeshttps://doi.org/10.1109/romoco60539.2024.10604334openalex-snapshot
Systematic Escape Using Billiard Moves
inferred← citeshttps://doi.org/10.1109/tvt.2021.3065221openalex-snapshot
Base Station and Passive Reflectors Placement for Urban mmWave Networks
inferred← citeshttps://doi.org/10.20382/jocg.v8i2a5openalex-snapshot
On the Complexity of Minimum-Link Path Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2108.10940openalex-snapshot
Art Gallery Plus Single Specular-reflection
inferred← citeshttps://doi.org/10.48550/arxiv.2112.01104openalex-snapshot
A Constant-Factor Approximation Algorithm for Point Guarding an Art Gallery
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0306010openalex-snapshot
On multiple connectedness of regions visible due to multiple diffuse reflections
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.