On the public citation graph

Ray Shooting, Depth Orders and Hidden Surface Removal

https://doi.org/10.1007/bfb0029813
0 signed · 72 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/bfb0029818openalex-snapshot
Ray shooting from a fixed point
inferredcites →https://doi.org/10.1007/bfb0029820openalex-snapshot
Ray shooting with arbitrary rays
inferredcites →https://doi.org/10.1007/bfb0029824openalex-snapshot
Depth orders in three dimensions
inferredcites →https://doi.org/10.1007/bfb0029828openalex-snapshot
Intersecting polyhedra
inferredcites →https://doi.org/10.1109/sfcs.1989.63541openalex-snapshot
Output-sensitive hidden surface removal

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-58218-5_1openalex-snapshot
Computing depth orders and related problems
inferred← citeshttps://doi.org/10.1007/3-540-63818-0_4openalex-snapshot
Visualization of TINs
inferred← citeshttps://doi.org/10.1007/978-3-319-09779-4_3openalex-snapshot
Static Optimal Visibility Problems
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/978-3-540-87744-8_15openalex-snapshot
Decompositions and Boundary Coverings of Non-convex Fat Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_27openalex-snapshot
The Union of Colorful Simplices Spanned by a Colored Point Set
inferred← citeshttps://doi.org/10.1007/bf02684409openalex-snapshot
Worst-case versus average case complexity of ray-shooting
inferred← citeshttps://doi.org/10.1007/bf02716578openalex-snapshot
Vertical decompositions for triangles in 3-space
inferred← citeshttps://doi.org/10.1007/pl00009378openalex-snapshot
Visibility with Multiple Reflections
inferred← citeshttps://doi.org/10.1007/s00158-014-1224-6openalex-snapshot
Alpha shape based design space decomposition for island failure regions in reliability based design
inferred← citeshttps://doi.org/10.1007/s00371-011-0670-zopenalex-snapshot
Algorithms for computing diffuse reflection paths in polygons
inferred← citeshttps://doi.org/10.1007/s00453-008-9220-0openalex-snapshot
Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra
inferred← citeshttps://doi.org/10.1007/s00454-003-2853-5openalex-snapshot
Spanning Trees Crossing Few Barriers
inferred← citeshttps://doi.org/10.1007/s00454-003-2924-7openalex-snapshot
Segment Intersection Searching Problems in General Settings
inferred← citeshttps://doi.org/10.1007/s00454-004-1089-3openalex-snapshot
Dense Point Sets Have Sparse Delaunay Triangulations or ?... But Not Too Nasty?
inferred← citeshttps://doi.org/10.1007/s00454-004-1123-5openalex-snapshot
Cutting Triangular Cycles of Lines in Space
inferred← citeshttps://doi.org/10.1007/s00454-017-9920-9openalex-snapshot
Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-019-00102-0openalex-snapshot
Removing Depth-Order Cycles Among Triangles: An Algorithm Generating Triangular Fragments
inferred← citeshttps://doi.org/10.1007/s00454-020-00221-zopenalex-snapshot
Eliminating Depth Cycles Among Triangles in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s004540010090openalex-snapshot
Common Tangents to Four Unit Balls in R 3
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00007-0openalex-snapshot
On-line construction of the upper envelope of triangles and surface patches in three dimensions
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00008-9openalex-snapshot
Generalized hidden surface removal
inferred← citeshttps://doi.org/10.1016/b978-0-08-051475-8.50019-5openalex-snapshot
REMOVED: BIBLIOGRAPHY
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50003-6openalex-snapshot
Arrangements and Their Applications**Work by PA. was supported by Army Research Office MURI grant DAAH04-96-1-0013, by a Sloan fellowship, by an NYI award, and by a grant from the U.S.–Israeli Binational Science Foundation. Work by M.S. was supported by NSF Grants CCR-91-22103 and CCR-93-11127, by…
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50008-5openalex-snapshot
Applications of Computational Geometry to Geographic Information Systems
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50011-5openalex-snapshot
Geometric Data Structures
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.comgeo.2007.10.006openalex-snapshot
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
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/j.comgeo.2009.04.003openalex-snapshot
Decompositions and boundary coverings of non-convex fat polyhedra
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.01.006openalex-snapshot
The union of colorful simplices spanned by a colored point set
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.02.001openalex-snapshot
Watchman tours for polygons with holes
inferred← citeshttps://doi.org/10.1016/j.na.2008.12.008openalex-snapshot
Optimal visibility-based path and motion planning of mobile observers for 3-D objects
inferred← citeshttps://doi.org/10.1016/s0097-8493(03)00103-1openalex-snapshot
On comparing ray shooting algorithms
inferred← citeshttps://doi.org/10.1016/s0097-8493(98)00003-xopenalex-snapshot
Analysis and construction of worst-case optimal ray shooting algorithms
inferred← citeshttps://doi.org/10.1016/s0097-8493(99)00093-xopenalex-snapshot
Interactive ray tracing with the visibility complex
inferred← citeshttps://doi.org/10.1016/s0262-8856(99)00045-1openalex-snapshot
A system to place observers on a polyhedral terrain in polynomial time
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00023-6openalex-snapshot
Spheres, molecules, and hidden surface removal
inferred← citeshttps://doi.org/10.1017/9781009701259.030openalex-snapshot
Binary Space Partitions: Recent Developments
inferred← citeshttps://doi.org/10.1023/a:1009708413602openalex-snapshot
Visibility Computations on Hierarchical Triangulated Terrain Models
inferred← citeshttps://doi.org/10.1109/2945.582339openalex-snapshot
Error and complexity of random walk Monte Carlo radiosity
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/acv.1996.572004openalex-snapshot
Placing observers to cover a polyhedral terrain in polynomial time
inferred← citeshttps://doi.org/10.1109/focs.2017.33openalex-snapshot
Removing Depth-Order Cycles among Triangles: An Efficient Algorithm Generating Triangular Fragments
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.00357openalex-snapshot
Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids
inferred← citeshttps://doi.org/10.1137/1.9781611974782.164openalex-snapshot
Eliminating Depth Cycles among Triangles in Three Dimensions
inferred← citeshttps://doi.org/10.1137/21m1408245openalex-snapshot
On Ray Shooting for Triangles in 3-Space and Related Problems
inferred← citeshttps://doi.org/10.1142/s0218195908002623openalex-snapshot
CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER
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/1064092.1064137openalex-snapshot
Vertical ray shooting for fat objects
inferred← citeshttps://doi.org/10.1145/1137856.1137872openalex-snapshot
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
inferred← citeshttps://doi.org/10.1145/1247069.1247120openalex-snapshot
Pareto envelopes in R3 under l1 and l∞ distance functions
inferred← citeshttps://doi.org/10.1145/304893.304907openalex-snapshot
Spanning trees crossing few barriers
inferred← citeshttps://doi.org/10.1145/378583.378667openalex-snapshot
Segment intersection searching problems in general settings
inferred← citeshttps://doi.org/10.1145/780542.780622openalex-snapshot
Cutting triangular cycles of lines in space
inferred← citeshttps://doi.org/10.22215/etd/1998-03954openalex-snapshot
Applications of graph partitioning algorithms to terrain visibility and shortest path problems.
inferred← citeshttps://doi.org/10.48550/arxiv.1304.4320openalex-snapshot
An Algorithm for Computing Constrained Reflection Paths in Simple Polygon
inferred← citeshttps://doi.org/10.48550/arxiv.1903.11149openalex-snapshot
Pix2Vex: Image-to-Geometry Reconstruction using a Smooth Differentiable Renderer
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0110030openalex-snapshot
Dense point sets have sparse Delaunay triangulations
inferred← citeshttps://doi.org/10.5555/236226.236228openalex-snapshot
Fast rendering of irregular grids
inferred← citeshttps://doi.org/10.5555/545381.545397openalex-snapshot
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
inferred← citeshttps://doi.org/10.82308/31561openalex-snapshot
On the three-dimensional visibility skeleton: implementation and analysis
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.