On the public citation graph

Characterizing and recognizing the visibility graph of a funnel-shaped polygon

https://doi.org/10.1007/bf01300372
0 signed · 33 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-19487-8_10openalex-snapshot
On recognizing and characterizing visibility graphs of simple polygons
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf01553883openalex-snapshot
An optimal visibility graph algorithm for triangulated simple polygons
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/bf01840436openalex-snapshot
Visibility of disjoint polygons
inferredcites →https://doi.org/10.1007/bf02187747openalex-snapshot
Visibility and intersection problems in plane geometry
inferredcites →https://doi.org/10.1007/bf02570710openalex-snapshot
Visibility graphs of staircase polygons and the weak Bruhat order, I: From visibility graphs to maximal chains
inferredcites →https://doi.org/10.1016/0095-8956(85)90050-4openalex-snapshot
Weakly triangulated graphs
inferredcites →https://doi.org/10.1016/0167-8655(86)90043-7openalex-snapshot
A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
inferredcites →https://doi.org/10.1016/0196-6774(85)90012-4openalex-snapshot
The NP-completeness column: an ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(90)90026-bopenalex-snapshot
Recognizing visibility graphs of spiral polygons
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
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.1137/0220055openalex-snapshot
An Output-Sensitive Algorithm for Computing Visibility Graphs
inferredcites →https://doi.org/10.1142/s0218195992000202openalex-snapshot
DISTANCE VISIBILITY GRAPHS
inferredcites →https://doi.org/10.1142/s0218195995000179openalex-snapshot
COMPLEXITY ASPECTS OF VISIBILITY GRAPHS
inferredcites →https://doi.org/10.1145/109648.109681openalex-snapshot
Distance visibility graphs
inferredcites →https://doi.org/10.82308/18310openalex-snapshot
Hierarchical decomposition of polygons with applications

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-56279-6_75openalex-snapshot
Characterizing and recognizing visibility graphs of Funnel-shaped polygons
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_8openalex-snapshot
Reconstructing Generalized Staircase Polygons with Uniform Step Length
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_62openalex-snapshot
An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_51openalex-snapshot
A Characterization of Visibility Graphs for Pseudo-polygons
inferred← citeshttps://doi.org/10.1007/s00454-020-00226-8openalex-snapshot
A Fast Shortest Path Algorithm on Terrain-like Graphs
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50020-6openalex-snapshot
Visibility in the Plane
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.1145/2543581.2543589openalex-snapshot
Unsolved problems in visibility graphs of points, segments, and polygons
inferred← citeshttps://doi.org/10.1145/2582112.2582117openalex-snapshot
Improved bounds for the conflict-free chromatic art gallery problem
inferred← citeshttps://doi.org/10.48550/arxiv.1708.09842openalex-snapshot
Reconstructing Generalized Staircase Polygons with Uniform Step Length
inferred← citeshttps://doi.org/10.48550/arxiv.1904.08746openalex-snapshot
Advancing Through Terrains
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.