On the public citation graph

Visibility graphs of staircase polygons and the weak Bruhat order, I: From visibility graphs to maximal chains

https://doi.org/10.1007/bf02570710
0 signed · 49 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-58950-3_366openalex-snapshot
Visibility graphs and oriented matroids (extended abstract)
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/978-1-4612-3894-2openalex-snapshot
Statistical Information and Likelihood
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/978-3-662-21946-1openalex-snapshot
Generators and Relations for Discrete Groups
inferredcites →https://doi.org/10.1007/bf02187696openalex-snapshot
Upper bounds for configurations and polytopes inR d
inferredcites →https://doi.org/10.1007/bf02187705openalex-snapshot
A unified approach to visibility representations of planar graphs
inferredcites →https://doi.org/10.1007/s00454-002-2881-6openalex-snapshot
Visibility Graphs and Oriented Matroids
inferredcites →https://doi.org/10.1016/0031-3203(81)90002-9openalex-snapshot
An efficient algorithm for decomposing a polygon into star-shaped polygons
inferredcites →https://doi.org/10.1016/0097-3165(80)90010-2openalex-snapshot
Generalized quadrangles associated with G2(q)
inferredcites →https://doi.org/10.1016/0097-3165(80)90011-4openalex-snapshot
On the combinatorial classification of nondegenerate configurations in the plane
inferredcites →https://doi.org/10.1016/0097-3165(84)90050-5openalex-snapshot
Semispaces of configurations, cell complexes of arrangements
inferredcites →https://doi.org/10.1016/0196-6774(90)90026-bopenalex-snapshot
Recognizing visibility graphs of spiral polygons
inferredcites →https://doi.org/10.1017/s0025557200055005openalex-snapshot
Generators and Relations for Discrete Groups. By H. S. M. Coxeter and W O. Moser. Pp. ix, 161. DM. 32. (Second Edition; Springer-Verlag)
inferredcites →https://doi.org/10.1109/icci.1993.315398openalex-snapshot
A combinatorial view of visibility graphs of simple polygons
inferredcites →https://doi.org/10.1137/0404001openalex-snapshot
The Weak Bruhat Order of $\text{S}_\Sigma $, Consistent Sets, and Catalan Numbers
inferredcites →https://doi.org/10.1142/s0218195993000038openalex-snapshot
VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
inferredcites →https://doi.org/10.1145/109648.109681openalex-snapshot
Distance visibility graphs
inferredcites →https://doi.org/10.1145/323233.323253openalex-snapshot
Characterizing bar line-of-sight graphs
inferredcites →https://doi.org/10.2307/2003966openalex-snapshot
Generators and Relations for Discrete Groups
inferredcites →https://doi.org/10.2307/2311524openalex-snapshot
Contemporary Mathematics
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.

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-58950-3_366openalex-snapshot
Visibility graphs and oriented matroids (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-3-030-50026-9_2openalex-snapshot
Parameterized Analysis of Art Gallery and Terrain Guarding
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-319-73915-1_8openalex-snapshot
Reconstructing Generalized Staircase Polygons with Uniform Step Length
inferred← citeshttps://doi.org/10.1007/bf01300372openalex-snapshot
Characterizing and recognizing the visibility graph of a funnel-shaped polygon
inferred← citeshttps://doi.org/10.1007/bf02770871openalex-snapshot
On recognizing and characterizing visibility graphs of simple polygons
inferred← citeshttps://doi.org/10.1007/bfb0015442openalex-snapshot
Illumination with orthogonal floodlights
inferred← citeshttps://doi.org/10.1007/bfb0054318openalex-snapshot
Short and smooth polygonal paths
inferred← citeshttps://doi.org/10.1007/s00454-002-2881-6openalex-snapshot
Visibility Graphs and Oriented Matroids
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.1007/s00493-020-4369-5openalex-snapshot
Persistent Graphs and Cyclic Polytope Triangulations
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00033-xopenalex-snapshot
Visibility graphs of towers
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50020-6openalex-snapshot
Visibility in the Plane
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.02.010openalex-snapshot
Coloring polygon visibility graphs and their generalizations
inferred← citeshttps://doi.org/10.1109/icci.1993.315398openalex-snapshot
A combinatorial view of visibility graphs of simple polygons
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/3186897openalex-snapshot
Exact Algorithms for Terrain Guarding
inferred← citeshttps://doi.org/10.13053/cys-12-4-1215openalex-snapshot
Visibilidad de Alcance Limitado en Polígonos Escalera
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.47749/t/unicamp.2013.911592openalex-snapshot
Sobre a caracterização de grafos de visibilidade de leques convexos
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.1708.09842openalex-snapshot
Reconstructing Generalized Staircase Polygons with Uniform Step Length
inferred← citeshttps://doi.org/10.48550/arxiv.1904.08746openalex-snapshot
Advancing Through Terrains
inferred← citeshttps://doi.org/10.48550/arxiv.2001.06436openalex-snapshot
On Visibility Graphs of Convex Fans and 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.