On the public citation graph

Recognizing polygons, or how to spy

https://doi.org/10.1007/bf01901192
0 signed · 29 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/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bfb0024019openalex-snapshot
Translating polygons in the plane
inferredcites →https://doi.org/10.1016/0020-0190(81)90091-0openalex-snapshot
Testing a simple polygon for monotonicity
inferredcites →https://doi.org/10.1016/0031-3203(82)90057-7openalex-snapshot
On a convex hull algorithm for polygons and its application to triangulation problems
inferredcites →https://doi.org/10.1016/0167-8655(84)90039-4openalex-snapshot
A new linear algorithm for triangulating monotone 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-0-444-87806-9.50018-9openalex-snapshot
Movable Separability of Sets
inferredcites →https://doi.org/10.1137/0214056openalex-snapshot
Decomposing a Polygon into Simpler Components
inferredcites →https://doi.org/10.1145/322139.322142openalex-snapshot
An Optimal Algorithm for Finding the Kernel of a Polygon
inferredcites →https://doi.org/10.22215/etd/1985-01028openalex-snapshot
Structural properties of polygons.
inferredcites →https://doi.org/10.2307/1573035openalex-snapshot
Principles of Interactive Computer Graphics
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_2openalex-snapshot
Computing the k-Crossing Visibility Region of a Point in a Polygon
inferred← citeshttps://doi.org/10.1007/978-3-031-47126-1_5openalex-snapshot
Discrete Planar Two-Watchtower Problem for k-Visibility
inferred← citeshttps://doi.org/10.1007/978-3-031-48882-5_1openalex-snapshot
Segment Visibility for k-Transmitters
inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_24openalex-snapshot
Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon
inferred← citeshttps://doi.org/10.1007/978-4-431-68093-2_3openalex-snapshot
Computational Geometry: Recent Developments
inferred← citeshttps://doi.org/10.1007/bf01759069openalex-snapshot
Computational geometry algorithms for the systolic screen
inferred← citeshttps://doi.org/10.1007/bf01910632openalex-snapshot
Editorial
inferred← citeshttps://doi.org/10.1007/bf01910636openalex-snapshot
The Superman problem
inferred← citeshttps://doi.org/10.1007/s00224-020-09999-0openalex-snapshot
Computing the k-Visibility Region of a Point in a Polygon
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50020-6openalex-snapshot
Visibility in the Plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.02.004openalex-snapshot
Rotationally monotone polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.06.004openalex-snapshot
Combinatorics and complexity of guarding polygons with edge and point 2-transmitters
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.017openalex-snapshot
A time–space trade-off for computing the k-visibility region of a point in a polygon
inferred← citeshttps://doi.org/10.1109/5.163407openalex-snapshot
Recent results in art galleries (geometry)
inferred← citeshttps://doi.org/10.1142/s0218195919500122openalex-snapshot
Line-of-Sight Pursuit in Monotone and Scallop Polygons
inferred← citeshttps://doi.org/10.3850/978-981-07-1403-1_134openalex-snapshot
Finding the Visibility Matrix of an Orthogonal Polygon
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.