On the public citation graph

Solving visibility problems by using skeleton structures

https://doi.org/10.1007/bfb0030329
0 signed · 25 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-10828-9_53openalex-snapshot
Trees as data and file structures
inferredcites →https://doi.org/10.1007/bfb0014927openalex-snapshot
The Design of Dynamic Data Structures
inferredcites →https://doi.org/10.1016/0020-0190(84)90058-9openalex-snapshot
The contour problem for rectilinear polygons
inferredcites →https://doi.org/10.1016/0196-6774(80)90011-5openalex-snapshot
Finding the contour of a union of iso-oriented rectangies
inferredcites →https://doi.org/10.1016/0196-6774(84)90013-0openalex-snapshot
An optimal contour algorithm for iso-oriented rectangles
inferredcites →https://doi.org/10.1016/0734-189x(83)90062-2openalex-snapshot
On translating a set of line segments
inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
inferredcites →https://doi.org/10.1109/tc.1980.1675628openalex-snapshot
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
inferredcites →https://doi.org/10.1109/tc.1981.6312179openalex-snapshot
Comments on “algorithms for reporting and counting geometric intersections”
inferredcites →https://doi.org/10.1137/0206043openalex-snapshot
Location of a Point in a Planar Subdivision and Its Applications
inferredcites →https://doi.org/10.1137/0208043openalex-snapshot
A Note on Locating a Set of Points in a Planar Subdivision
inferredcites →https://doi.org/10.1145/358656.358681openalex-snapshot
Plane-sweep algorithms for intersecting geometric figures
inferredcites →https://doi.org/10.1145/800141.804663openalex-snapshot
On translating a set of rectangles

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-70087-3_6openalex-snapshot
Geometrische Probleme beim VLSI-Design
inferred← citeshttps://doi.org/10.1007/bf01935050openalex-snapshot
Reconstructing visible regions from visible segments
inferred← citeshttps://doi.org/10.1007/bf01935366openalex-snapshot
A fast line-sweep algorithm for hidden line elimination
inferred← citeshttps://doi.org/10.1007/bf02240065openalex-snapshot
On some union and intersection problems for polygons with fixed orientations
inferred← citeshttps://doi.org/10.1007/bfb0030285openalex-snapshot
Mathematical Foundations of Computer Science 1984
inferred← citeshttps://doi.org/10.1016/0734-189x(85)90159-8openalex-snapshot
A fast algorithm for the Boolean masking problem
inferred← citeshttps://doi.org/10.1016/0734-189x(86)90046-0openalex-snapshot
Space-economical plane-sweep algorithms
inferred← citeshttps://doi.org/10.1016/1049-9652(92)90029-wopenalex-snapshot
A polygonal approach to hidden-line and hidden-surface elimination
inferred← citeshttps://doi.org/10.1016/s0734-189x(86)80028-7openalex-snapshot
On translating a set of objects in 2- and 3-dimensional space
inferred← citeshttps://doi.org/10.1080/00207168508803482openalex-snapshot
A worst-case efficient algorithm for hidden-line elimination†
inferred← citeshttps://doi.org/10.1080/00207168708803553openalex-snapshot
Reporting Intersections of Polygons
inferred← citeshttps://doi.org/10.1145/78964.78967openalex-snapshot
Computation of the axial view of a set of isothetic parallelepipeds
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.