On the public citation graph
Efficient ray shooting and hidden surface removal
0 signed · 81 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/3-540-54233-7_172openalex-snapshot
Ray shooting in polygons using geodesic triangulations
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/978-3-642-83539-1_42openalex-snapshot
Ray Tracing Algorithms — Theory and Practice
inferredcites →https://doi.org/10.1007/bf01931656openalex-snapshot
Storing line segments in partition trees
inferredcites →https://doi.org/10.1007/bf02187747openalex-snapshot
Visibility and intersection problems in plane geometry
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferredcites →https://doi.org/10.1007/bf02189317openalex-snapshot
On the zone of a surface in a hyperplane arrangement
inferredcites →https://doi.org/10.1007/bfb0028245openalex-snapshot
On the zone of a surface in a hyperplane arrangement
inferredcites →https://doi.org/10.1007/bfb0028277openalex-snapshot
Applications of a new space partitioning technique
inferredcites →https://doi.org/10.1016/0196-6774(85)90007-0openalex-snapshot
A linear algorithm for determining the separation of convex polyhedra
inferredcites →https://doi.org/10.1016/0196-6774(87)90015-0openalex-snapshot
Space searching for intersecting objects
inferredcites →https://doi.org/10.1016/0925-7721(92)90007-fopenalex-snapshot
Hidden surface removal for c-oriented polyhedra
inferredcites →https://doi.org/10.1016/0925-7721(92)90009-hopenalex-snapshot
Counting and cutting cycles of lines and rods in space
inferredcites →https://doi.org/10.1016/s0747-7171(89)80003-3openalex-snapshot
Visibility problems for polyhedral terrains
inferredcites →https://doi.org/10.1109/fscs.1990.89544openalex-snapshot
Hidden surface removal for axis-parallel polyhedra
inferredcites →https://doi.org/10.1109/sfcs.1989.63541openalex-snapshot
Output-sensitive hidden surface removal
inferredcites →https://doi.org/10.1109/sfcs.1991.185345openalex-snapshot
An optimal convex hull algorithm and new results on cuttings
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1145/109648.109653openalex-snapshot
Intersection queries for curved objects (extended abstract)
inferredcites →https://doi.org/10.1145/129712.129763openalex-snapshot
Ray shooting and parametric search
inferredcites →https://doi.org/10.1145/142675.142708openalex-snapshot
Computing and verifying depth orders
inferredcites →https://doi.org/10.1145/142675.142734openalex-snapshot
Ray shooting in convex polytopes
inferredcites →https://doi.org/10.1145/27625.27627openalex-snapshot
Worst-case optimal hidden-surface removal
inferredcites →https://doi.org/10.1145/73007.73044openalex-snapshot
Lines in space-combinators, algorithms and applications
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/98524.98532openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferredcites →https://doi.org/10.1145/98524.98563openalex-snapshot
Stabbing and ray shooting in 3 dimensional space
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
inferredcites →https://doi.org/10.5555/127787.127797openalex-snapshot
Space-efficient ray-shooting and intersection searching: algorithms, dynamization, and 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/11841036_70openalex-snapshot
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
inferred← citeshttps://doi.org/10.1007/3-540-60392-1_18openalex-snapshot
Updating visibility information on multiresolut ion terrain models
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_13openalex-snapshot
Polygon Queries for Convex Hulls of Points
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_43openalex-snapshot
Ray Shooting and Stone Throwing
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_16openalex-snapshot
Processing an Offline Insertion-Query Sequence with Applications
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/bf01187036openalex-snapshot
Ray shooting on triangles in 3-space
inferred← citeshttps://doi.org/10.1007/bf01293267openalex-snapshot
An improved technique for output-sensitive hidden surface removal
inferred← citeshttps://doi.org/10.1007/bf02189304openalex-snapshot
Applications of a new space-partitioning technique
inferred← citeshttps://doi.org/10.1007/bf02573975openalex-snapshot
On ray shooting in convex polytopes
inferred← citeshttps://doi.org/10.1007/bf02716578openalex-snapshot
Vertical decompositions for triangles in 3-space
inferred← citeshttps://doi.org/10.1007/pl00009479openalex-snapshot
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90025-5openalex-snapshot
The power of parallel projection
inferred← citeshttps://doi.org/10.1016/0895-7177(95)00016-uopenalex-snapshot
An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
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)90024-mopenalex-snapshot
Efficient hidden surface removal for objects with small union size
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90024-zopenalex-snapshot
On vertical ray shooting in arrangements
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00005-8openalex-snapshot
Computing depth orders for fat objects and related problems
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/j.cad.2006.08.007openalex-snapshot
The spherical visibility map
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.10.001openalex-snapshot
Ray shooting and stone throwing with near-linear storage
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115461openalex-snapshot
Combinatorial characterizations and algorithms for trajectory planning of an articulated robotic probe in three dimensions
inferred← citeshttps://doi.org/10.1080/02693799408902019openalex-snapshot
Parallelizing visibility computations on triangulated terrains
inferred← citeshttps://doi.org/10.1080/02693799608902096openalex-snapshot
Representing the visibility structure of a polyhedral terrain through a horizon map
inferred← citeshttps://doi.org/10.1109/2945.597797openalex-snapshot
The lazy sweep ray casting algorithm for rendering irregular grids
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.1109/sfcs.2001.959880openalex-snapshot
Almost tight upper bounds for vertical decompositions in four dimensions
inferred← citeshttps://doi.org/10.1109/svv.1996.558038openalex-snapshot
Fast rendering of irregular grids
inferred← citeshttps://doi.org/10.1109/svv.1998.729589openalex-snapshot
An exact interactive time visibility ordering algorithm for polyhedral cell complexes
inferred← citeshttps://doi.org/10.1111/1467-8659.1530387openalex-snapshot
BOXTREE: A Hierarchical Representation for Surfaces in 3D
inferred← citeshttps://doi.org/10.1137/21m1408245openalex-snapshot
On Ray Shooting for Triangles in 3-Space and Related Problems
inferred← citeshttps://doi.org/10.1137/s0097539793244368openalex-snapshot
Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
inferred← citeshttps://doi.org/10.1137/s0097539793252080openalex-snapshot
Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
inferred← citeshttps://doi.org/10.1142/s0218195998000023openalex-snapshot
An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
inferred← citeshttps://doi.org/10.1142/s0218195999000145openalex-snapshot
THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL
inferred← citeshttps://doi.org/10.1145/1017460.1017461openalex-snapshot
Almost tight upper bounds for vertical decompositions in four dimensions
inferred← citeshttps://doi.org/10.1145/177424.177427openalex-snapshot
Vertical decompositions for triangles in 3-space
inferred← citeshttps://doi.org/10.1145/276884.276891openalex-snapshot
Raising roofs, crashing cycles, and playing pool
inferred← citeshttps://doi.org/10.1145/288126.288170openalex-snapshot
An exact interactive time visibility ordering algorithm for polyhedral cell complexes
inferred← citeshttps://doi.org/10.1145/3721290openalex-snapshot
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems
inferred← citeshttps://doi.org/10.1145/383259.383299openalex-snapshot
The randomized z-buffer algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1910.08717openalex-snapshot
Polygon Queries for Convex Hulls of Points
inferred← citeshttps://doi.org/10.5555/1070432.1070502openalex-snapshot
Pianos are not flat: rigid motion planning in three dimensions
inferred← citeshttps://doi.org/10.5555/236226.236228openalex-snapshot
Fast rendering of irregular grids
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.