On the public citation graph
New algorithms for special cases of the hidden line elimination problem
0 signed · 24 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.1016/0020-0190(83)90010-8openalex-snapshot
Stabbing c-oriented polygons
inferredcites →https://doi.org/10.1016/0196-6774(82)90016-5openalex-snapshot
Rectilinear line segment intersection, layered segment trees, and dynamization
inferredcites →https://doi.org/10.1016/s0019-9958(84)80011-xopenalex-snapshot
Dynamic C-oriented polygonal intersection searching
inferredcites →https://doi.org/10.1080/00207168508803482openalex-snapshot
A worst-case efficient algorithm for hidden-line elimination†
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.1982.1675973openalex-snapshot
Counting and Reporting Intersections of d-Ranges
inferredcites →https://doi.org/10.1145/356625.356626openalex-snapshot
A Characterization of Ten Hidden-Surface Algorithms
inferredcites →https://doi.org/10.1145/358656.358681openalex-snapshot
Plane-sweep algorithms for intersecting geometric figures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01901191openalex-snapshot
Hidden-surface removal in polyhedral cross-sections
inferred← citeshttps://doi.org/10.1007/bf01905560openalex-snapshot
Visibility problems for orthogonal objects in two-or three-dimensions
inferred← citeshttps://doi.org/10.1007/bf01941685openalex-snapshot
Sweep Methods for Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90018-gopenalex-snapshot
Hidden surface removal for rectangles
inferred← citeshttps://doi.org/10.1016/0734-189x(86)90046-0openalex-snapshot
Space-economical plane-sweep algorithms
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80011-xopenalex-snapshot
Dynamic C-oriented polygonal intersection searching
inferred← citeshttps://doi.org/10.1016/s0734-189x(87)80114-7openalex-snapshot
New algorithms for special cases of the hidden line elimination problem
inferred← citeshttps://doi.org/10.1080/00207168508803482openalex-snapshot
A worst-case efficient algorithm for hidden-line elimination†
inferred← citeshttps://doi.org/10.1109/iceeict.2014.6919150openalex-snapshot
An easier approach to visible edge determination from moving viewpoint
inferred← citeshttps://doi.org/10.1109/ipps.1998.669913openalex-snapshot
An improved output-size sensitive parallel algorithm for hidden-surface removal for terrains
inferred← citeshttps://doi.org/10.1142/s0129054120500240openalex-snapshot
A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles
inferred← citeshttps://doi.org/10.1145/73393.73412openalex-snapshot
Hidden surface removal for rectangles
inferred← citeshttps://doi.org/10.1145/97444.97695openalex-snapshot
Generalized sweep methods for parallel computational geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1109.0389openalex-snapshot
A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles
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.