On the public citation graph
On recognizing and characterizing visibility graphs of simple polygons
0 signed · 56 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/3-540-19487-8_10openalex-snapshot
On recognizing and characterizing visibility graphs of simple polygons
inferredcites →https://doi.org/10.1007/3-540-58950-3_366openalex-snapshot
Visibility graphs and oriented matroids (extended abstract)
inferredcites →https://doi.org/10.1007/bf01553883openalex-snapshot
An optimal visibility graph algorithm for triangulated simple polygons
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.1007/bf02574366openalex-snapshot
A new necessary condition for the vertex visibility graphs of simple polygons
inferredcites →https://doi.org/10.1007/s00454-002-2881-6openalex-snapshot
Visibility Graphs and Oriented Matroids
inferredcites →https://doi.org/10.1016/0196-6774(90)90026-bopenalex-snapshot
Recognizing visibility graphs of spiral polygons
inferredcites →https://doi.org/10.1016/0925-7721(93)90010-4openalex-snapshot
Characterizing and recognizing weak visibility polygons
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-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/sfcs.1985.47openalex-snapshot
Recognizing circle graphs in polynomial time
inferredcites →https://doi.org/10.1109/tpami.1979.4766871openalex-snapshot
Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering
inferredcites →https://doi.org/10.1137/0201013openalex-snapshot
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
inferredcites →https://doi.org/10.1145/152992.152994openalex-snapshot
Computational geometry column 18
inferredcites →https://doi.org/10.1145/323233.323255openalex-snapshot
Computing the largest empty convex subset of a set of points
inferredcites →https://doi.org/10.1145/359156.359164openalex-snapshot
An algorithm for planning collision-free paths among polyhedral obstacles
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-44438-6_30openalex-snapshot
A New Visibility Partition for Affine Pattern Matching
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/978-3-030-60440-0_5openalex-snapshot
Clique-Width of Point Configurations
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_46openalex-snapshot
On the Complexity of Half-Guarding Monotone Polygons
inferred← citeshttps://doi.org/10.1007/978-3-031-49611-0_24openalex-snapshot
On Half Guarding Polygons
inferred← citeshttps://doi.org/10.1007/978-3-319-28678-5_6openalex-snapshot
Visibility Graphs of Anchor Polygons
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_55openalex-snapshot
Selected Open Problems in Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-36279-8_25openalex-snapshot
Mapping Polygons with Agents That Measure 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-002-2881-6openalex-snapshot
Visibility Graphs and Oriented Matroids
inferred← citeshttps://doi.org/10.1007/s00454-005-1177-zopenalex-snapshot
On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-016-9831-1openalex-snapshot
Recognition and Complexity of Point Visibility Graphs
inferred← citeshttps://doi.org/10.1007/s10514-020-09956-3openalex-snapshot
LTA*: Local tangent based A* for optimal path planning
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00017-8openalex-snapshot
Determining bar-representability for ordered weighted graphs
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50020-6openalex-snapshot
Visibility in the Plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.12.003openalex-snapshot
Non-stretchable pseudo-visibility graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.02.010openalex-snapshot
Coloring polygon visibility graphs and their generalizations
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/s0925-7721(97)00011-4openalex-snapshot
The vertex-edge visibility graph of a polygon
inferred← citeshttps://doi.org/10.1109/access.2025.3562796openalex-snapshot
Modeling Parking Occupancy Using Algorithm of 3D Visibility Network
inferred← citeshttps://doi.org/10.1109/icra.2011.5979838openalex-snapshot
How many landmark colors are needed to avoid confusion in a polygon?
inferred← citeshttps://doi.org/10.1142/s0218195900000061openalex-snapshot
ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES
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/262839.262915openalex-snapshot
Vertex-edge pseudo-visibility graphs
inferred← citeshttps://doi.org/10.1145/304893.304980openalex-snapshot
Stretchability of star-like pseudo-visibility graphs
inferred← citeshttps://doi.org/10.1145/378583.378709openalex-snapshot
A sum of squares theorem for visibility
inferred← citeshttps://doi.org/10.14279/depositonce-5580openalex-snapshot
Intersection graphs and geometric objects in the plane
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.20382/jocg.v6i1a5openalex-snapshot
On characterizing terrain visibility graphs
inferred← citeshttps://doi.org/10.24200/sci.2024.63200.8282openalex-snapshot
Pseudo-Triangle Visibility Graph: Characterization and Reconstruction
inferred← citeshttps://doi.org/10.4230/lipics.socg.2021.29openalex-snapshot
Colouring Polygon Visibility Graphs and Their Generalizations
inferred← citeshttps://doi.org/10.46298/dmtcs.2126openalex-snapshot
A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon
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.1306.2978openalex-snapshot
Graphs with Plane Outside-Obstacle Representations
inferred← citeshttps://doi.org/10.48550/arxiv.1804.05105openalex-snapshot
Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons
inferred← citeshttps://doi.org/10.5545/sv-jme.2017.5189openalex-snapshot
http://www.sv-jme.eu/article/new-hybrid-system-of-machine-learning-and-statistical-pattern-recognition-for-a-3d-visibility-network/
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.