On the public citation graph

An improved technique for output-sensitive hidden surface removal

https://doi.org/10.1007/bf01293267
0 signed · 38 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.1006/inco.1993.1059openalex-snapshot
Output-Sensitive Methods for Rectilinear Hidden Surface Removal
inferredcites →https://doi.org/10.1007/3-540-19487-8_7openalex-snapshot
Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf01377182openalex-snapshot
Efficient ray shooting and hidden surface removal
inferredcites →https://doi.org/10.1007/bf01933260openalex-snapshot
Dynamic partition trees
inferredcites →https://doi.org/10.1007/bf01935366openalex-snapshot
A fast line-sweep algorithm for hidden line elimination
inferredcites →https://doi.org/10.1007/bf02187747openalex-snapshot
Visibility and intersection problems in plane geometry
inferredcites →https://doi.org/10.1007/bf02187784openalex-snapshot
The complexity and construction of many faces in arrangements of lines and of segments
inferredcites →https://doi.org/10.1007/bf02187805openalex-snapshot
Partitioning arrangements of lines I: An efficient deterministic algorithm
inferredcites →https://doi.org/10.1016/0022-0000(90)90018-gopenalex-snapshot
Hidden surface removal for rectangles
inferredcites →https://doi.org/10.1016/0196-6774(87)90015-0openalex-snapshot
Space searching for intersecting objects
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/sfcs.1989.63541openalex-snapshot
Output-sensitive hidden surface removal
inferredcites →https://doi.org/10.1145/102377.112141openalex-snapshot
A simple output-sensitive algorithm for hidden surface removal
inferredcites →https://doi.org/10.1145/10515.10544openalex-snapshot
Quadratic bounds for hidden line elimination
inferredcites →https://doi.org/10.1145/129712.129763openalex-snapshot
Ray shooting and parametric search
inferredcites →https://doi.org/10.1145/27625.27627openalex-snapshot
Worst-case optimal hidden-surface removal
inferredcites →https://doi.org/10.1145/323233.323252openalex-snapshot
Visibility and intersectin problems in plane geometry
inferredcites →https://doi.org/10.1145/356625.356626openalex-snapshot
A Characterization of Ten Hidden-Surface Algorithms
inferredcites →https://doi.org/10.1145/73393.73413openalex-snapshot
An efficient output-sensitive hidden surface removal algorithm and its parallelization
inferredcites →https://doi.org/10.1145/73833.73868openalex-snapshot
Ray shooting and other applications of spanning trees with low stabbing number
inferredcites →https://doi.org/10.1145/74333.74372openalex-snapshot
An efficient algorithm for hidden surface removal
inferredcites →https://doi.org/10.1145/74334.74372openalex-snapshot
An efficient algorithm for hidden surface removal
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.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.2312/eg.19811005openalex-snapshot
TIME AND SPACE BOUNDS FOR HIDDEN LINE AND HIDDEN SURFACE ALGORITHMS

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-52846-6_108openalex-snapshot
Dynamic partition trees
inferred← citeshttps://doi.org/10.1007/978-3-642-21931-3_2openalex-snapshot
An Optimal Hidden-Surface Algorithm and Its Parallelization
inferred← citeshttps://doi.org/10.1007/bf01933260openalex-snapshot
Dynamic partition trees
inferred← citeshttps://doi.org/10.1007/bf02189304openalex-snapshot
Applications of a new space-partitioning technique
inferred← citeshttps://doi.org/10.1007/bfb0028277openalex-snapshot
Applications of a new space partitioning technique
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90004-copenalex-snapshot
Dynamic output-sensitive hidden surface removal for c-oriented polyhedra
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90007-fopenalex-snapshot
Hidden surface removal for c-oriented polyhedra
inferred← citeshttps://doi.org/10.1109/fscs.1990.89544openalex-snapshot
Hidden surface removal for axis-parallel polyhedra
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.2312/egt.20141024openalex-snapshot
Efficient Sorting and Searching in Rendering Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9910017openalex-snapshot
Finite-resolution hidden surface removal
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.