On the public citation graph

Visibility between two edges of a simple polygon

https://doi.org/10.1007/bf01952419
0 signed · 53 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/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/978-3-642-46216-0openalex-snapshot
Convexity and Optimization in Finite Dimensions I
inferredcites →https://doi.org/10.1007/978-3-642-69672-5_2openalex-snapshot
Sorting
inferredcites →https://doi.org/10.1007/bf00288968openalex-snapshot
A new data structure for representing sorted lists
inferredcites →https://doi.org/10.1007/bf01890987openalex-snapshot
A linear algorithm for eliminating hidden-lines from a polygonal cylinder
inferredcites →https://doi.org/10.1007/bf02263430openalex-snapshot
Applications of a two-dimensional hidden-line algorithm to other geometric problems
inferredcites →https://doi.org/10.1016/0010-4485(78)90147-1openalex-snapshot
Bibliography of hidden - line and hidden - surface algorithms
inferredcites →https://doi.org/10.1016/0020-0190(78)90062-5openalex-snapshot
Triangulating a simple polygon
inferredcites →https://doi.org/10.1016/0020-0190(81)90101-0openalex-snapshot
Hysterical B-trees
inferredcites →https://doi.org/10.1016/0020-0190(86)90045-1openalex-snapshot
Shortest paths in the plane with convex polygonal obstacles
inferredcites →https://doi.org/10.1016/0095-8956(75)90061-1openalex-snapshot
A combinatorial theorem in plane geometry
inferredcites →https://doi.org/10.1016/0146-664x(79)90076-5openalex-snapshot
Computational models of space: Isovists and isovist fields
inferredcites →https://doi.org/10.1016/0167-8655(85)90040-6openalex-snapshot
A simple linear hidden-line algorithm for star-shaped polygons
inferredcites →https://doi.org/10.1016/0167-8655(86)90015-2openalex-snapshot
Shortest path solves edge-to-edge visibility in a polygon
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(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/0734-189x(86)90044-7openalex-snapshot
Computing the visibility polygon from an edge
inferredcites →https://doi.org/10.1017/s0263574700008924openalex-snapshot
Separation of two monotone polygons in linear time
inferredcites →https://doi.org/10.1109/pgec.1967.264724openalex-snapshot
An Algorithm for the Solution of the Two-Dimensional ``Hidden-Line'' Problem
inferredcites →https://doi.org/10.1109/sfcs.1980.32openalex-snapshot
On the priority approach to hidden-surface algorithms
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
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.1109/tit.1983.1056600openalex-snapshot
A combinational approach to polygon similarity
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/0209045openalex-snapshot
Design and Analysis of a Data Structure for Representing Sorted Lists
inferredcites →https://doi.org/10.1145/10515.10516openalex-snapshot
Linear time algorithms for visibility and shortest path problems inside simple polygons
inferredcites →https://doi.org/10.1145/12130.12170openalex-snapshot
A linear-time algorithm for triangulating simple polygons
inferredcites →https://doi.org/10.1145/322139.322142openalex-snapshot
An Optimal Algorithm for Finding the Kernel of a Polygon
inferredcites →https://doi.org/10.1145/323233.323252openalex-snapshot
Visibility and intersectin problems in plane geometry
inferredcites →https://doi.org/10.1145/323233.323259openalex-snapshot
Sorting Jordan sequences in linear time
inferredcites →https://doi.org/10.1145/359156.359164openalex-snapshot
An algorithm for planning collision-free paths among polyhedral obstacles
inferredcites →https://doi.org/10.1145/800260.809014openalex-snapshot
A solution to line-routing problems on the continuous plane
inferredcites →https://doi.org/10.21236/ada459660openalex-snapshot
A Mobile Automaton: An Application of Artificial Intelligence Techniques
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
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-54233-7_171openalex-snapshot
Computing shortest transversals
inferred← citeshttps://doi.org/10.1007/978-3-642-34191-5_5openalex-snapshot
Open Guard Edges and Edge Guards in Simple Polygons
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/bf02239165openalex-snapshot
Computing shortest transversals
inferred← citeshttps://doi.org/10.1007/bfb0030819openalex-snapshot
Three dimensional weak visibility: Complexity and applications
inferred← citeshttps://doi.org/10.1007/s00224-001-1018-2openalex-snapshot
Computing the Optimal Bridge between Two Polygons
inferred← citeshttps://doi.org/10.1007/s00454-013-9515-zopenalex-snapshot
Tracing Compressed Curves in Triangulated Surfaces
inferred← citeshttps://doi.org/10.1016/0010-4485(89)90018-3openalex-snapshot
Removal of hidden lines by recursive subdivision
inferred← citeshttps://doi.org/10.1016/0097-8493(94)90002-7openalex-snapshot
Terrain visibility
inferred← citeshttps://doi.org/10.1016/b978-0-444-70467-2.50016-3openalex-snapshot
Guard Placement in Rectilinear Polygons
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/s0304-3975(98)00132-7openalex-snapshot
Three-dimensional weak visibility: Complexity and applications
inferred← citeshttps://doi.org/10.1145/2261250.2261270openalex-snapshot
Tracing compressed curves in triangulated surfaces
inferred← citeshttps://doi.org/10.1145/91385.91416openalex-snapshot
Towards image realism with interactive update rates in complex virtual building environments
inferred← citeshttps://doi.org/10.1145/91394.91416openalex-snapshot
Towards image realism with interactive update rates in complex virtual building environments
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.