On the public citation graph
An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal
0 signed · 32 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.1007/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
inferredcites →https://doi.org/10.1007/bf01905560openalex-snapshot
Visibility problems for orthogonal objects in two-or three-dimensions
inferredcites →https://doi.org/10.1007/bf01935366openalex-snapshot
A fast line-sweep algorithm for hidden line elimination
inferredcites →https://doi.org/10.1016/0020-0190(77)90031-xopenalex-snapshot
Preserving order in a forest in less than logarithmic time and linear space
inferredcites →https://doi.org/10.1016/s0734-189x(87)80114-7openalex-snapshot
New algorithms for special cases of the hidden line elimination problem
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.1137/0215051openalex-snapshot
Filtering Search: A New Approach to Query-Answering
inferredcites →https://doi.org/10.1145/27625.27627openalex-snapshot
Worst-case optimal hidden-surface removal
inferredcites →https://doi.org/10.1145/356625.356626openalex-snapshot
A Characterization of Ten Hidden-Surface Algorithms
inferredcites →https://doi.org/10.1145/73393.73412openalex-snapshot
Hidden surface removal for rectangles
inferredcites →https://doi.org/10.1145/78964.78967openalex-snapshot
Computation of the axial view of a set of isothetic parallelepipeds
inferredcites →https://doi.org/10.1145/800057.808674openalex-snapshot
Intersecting is easier than sorting
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_174openalex-snapshot
Computational geometry for the gourmet old fare and new dishes
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_26openalex-snapshot
Restricted orientation computational geometry
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_23openalex-snapshot
Computing the Visibility Map of Fat Objects
inferred← citeshttps://doi.org/10.1007/bf01941685openalex-snapshot
Sweep Methods for Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90007-fopenalex-snapshot
Hidden surface removal for c-oriented polyhedra
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90024-mopenalex-snapshot
Efficient hidden surface removal for objects with small union size
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00008-9openalex-snapshot
Generalized hidden surface removal
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00030-5openalex-snapshot
Space reduction and an extension for a hidden line elimination algorithm
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/j.comgeo.2008.12.010openalex-snapshot
Computing the visibility map of fat objects
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00228-9openalex-snapshot
An optimal algorithm for reporting visible rectangles
inferred← citeshttps://doi.org/10.1016/s0020-0190(96)00161-5openalex-snapshot
Space-optimal hidden line elimination for rectangles
inferred← citeshttps://doi.org/10.1109/fscs.1990.89544openalex-snapshot
Hidden surface removal for axis-parallel polyhedra
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.1145/102377.112141openalex-snapshot
A simple output-sensitive algorithm for hidden surface removal
inferred← citeshttps://doi.org/10.1145/109648.109652openalex-snapshot
Efficient hidden surface removal for objects with small union size
inferred← citeshttps://doi.org/10.1145/160985.160987openalex-snapshot
Generalized hidden surface removal
inferred← citeshttps://doi.org/10.1145/97444.97695openalex-snapshot
Generalized sweep methods for parallel computational geometry
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.