On the public citation graph

Hierarchical decomposition of polygons with applications

https://doi.org/10.82308/18310
0 signed · 42 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 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-19487-8_10openalex-snapshot
On recognizing and characterizing visibility graphs of simple polygons
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-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/978-3-642-83069-3_24openalex-snapshot
Computational Geometry: Recent Results Relevant to Pattern Recognition
inferred← citeshttps://doi.org/10.1007/978-94-009-3757-4_47openalex-snapshot
Computational Geometry and Morphology
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/bf01840360openalex-snapshot
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
inferred← citeshttps://doi.org/10.1007/bf01901194openalex-snapshot
Parallel algorithms for shortest path problems in polygons
inferred← citeshttps://doi.org/10.1007/bf01905560openalex-snapshot
Visibility problems for orthogonal objects in two-or three-dimensions
inferred← citeshttps://doi.org/10.1007/bf01952419openalex-snapshot
Visibility between two edges of a simple polygon
inferred← citeshttps://doi.org/10.1007/bf02187729openalex-snapshot
On separating two simple polygons by a single translation
inferred← citeshttps://doi.org/10.1007/bf02770871openalex-snapshot
On recognizing and characterizing visibility graphs of simple polygons
inferred← citeshttps://doi.org/10.1007/s00453-018-0446-1openalex-snapshot
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
inferred← citeshttps://doi.org/10.1007/s00454-009-9233-8openalex-snapshot
Obstacle Numbers of Graphs
inferred← citeshttps://doi.org/10.1016/0167-8655(86)90015-2openalex-snapshot
Shortest path solves edge-to-edge visibility in a polygon
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/0196-6774(90)90026-bopenalex-snapshot
Recognizing visibility graphs of spiral polygons
inferred← citeshttps://doi.org/10.1016/0734-189x(86)90127-1openalex-snapshot
A linear time algorithm for minimum link paths inside a simple polygon
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00021-zopenalex-snapshot
Negative results on characterizing visibility graphs
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00033-xopenalex-snapshot
Visibility graphs of towers
inferred← citeshttps://doi.org/10.1016/b978-0-444-87137-4.50014-xopenalex-snapshot
Computing Visibility Properties of Polygons
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50013-9openalex-snapshot
Link Distance Problems
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50020-6openalex-snapshot
Visibility in the Plane
inferred← citeshttps://doi.org/10.1109/5.163407openalex-snapshot
Recent results in art galleries (geometry)
inferred← citeshttps://doi.org/10.1109/70.88124openalex-snapshot
On some link distance problems in a simple polygon
inferred← citeshttps://doi.org/10.1109/jra.1987.1087092openalex-snapshot
Minimizing turns for discrete movement in the interior of a polygon
inferred← citeshttps://doi.org/10.1145/109648.109681openalex-snapshot
Distance visibility graphs
inferred← citeshttps://doi.org/10.1145/152992.152994openalex-snapshot
Computational geometry column 18
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/73833.73861openalex-snapshot
Determining sector visibility of a polygon
inferred← citeshttps://doi.org/10.1145/98524.98536openalex-snapshot
Structured visibility profiles with applications to problems in simple polygons (extended abstract)
inferred← citeshttps://doi.org/10.20382/jocg.v6i1a5openalex-snapshot
On characterizing terrain visibility graphs
inferred← citeshttps://doi.org/10.2197/ipsjjip.25.621openalex-snapshot
γk(n) = max {⌊n/(2k+1)⌋, 1} for Maximal Outerplanar Graphs with n mod (2k+1) ≤ 6
inferred← citeshttps://doi.org/10.24200/sci.2024.63200.8282openalex-snapshot
Pseudo-Triangle Visibility Graph: Characterization and Reconstruction
inferred← citeshttps://doi.org/10.3850/978-981-07-1403-1_134openalex-snapshot
Finding the Visibility Matrix of an Orthogonal Polygon
inferred← citeshttps://doi.org/10.4230/lipics.swat.2016.30openalex-snapshot
Time-Space Trade-off Algorithms for Triangulating a Simple Polygon
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.1306.2978openalex-snapshot
Graphs with Plane Outside-Obstacle Representations
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.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.