On the public citation graph
Ray shooting on triangles in 3-space
0 signed · 95 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-15198-2_9openalex-snapshot
Fast searching in a real algebraic manifold with applications to geometric complexity
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/bf01377182openalex-snapshot
Efficient ray shooting and hidden surface removal
inferredcites →https://doi.org/10.1007/bf02187805openalex-snapshot
Partitioning arrangements of lines I: An efficient deterministic algorithm
inferredcites →https://doi.org/10.1007/bf02187809openalex-snapshot
Partitioning arrangements of lines II: Applications
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferredcites →https://doi.org/10.1007/bfb0028245openalex-snapshot
On the zone of a surface in a hyperplane arrangement
inferredcites →https://doi.org/10.1007/bfb0028246openalex-snapshot
Ray-shooting and isotopy classes of lines in 3-dimensional space
inferredcites →https://doi.org/10.1007/bfb0028277openalex-snapshot
Applications of a new space partitioning technique
inferredcites →https://doi.org/10.1007/bfb0028837openalex-snapshot
Intersecting two polyhedra one of which is convex
inferredcites →https://doi.org/10.1007/bfb0032047openalex-snapshot
Determining the separation of preprocessed polyhedra — A unified approach
inferredcites →https://doi.org/10.1016/0020-0190(88)90120-2openalex-snapshot
The shortest watchtower and related problems for polyhedral terrains
inferredcites →https://doi.org/10.1016/0146-664x(82)90169-1openalex-snapshot
Ray casting for modeling solids
inferredcites →https://doi.org/10.1016/0196-8858(83)90014-3openalex-snapshot
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
inferredcites →https://doi.org/10.1016/0304-3975(78)90051-8openalex-snapshot
Finding the intersection of two convex polyhedra
inferredcites →https://doi.org/10.1016/s0747-7171(08)80065-xopenalex-snapshot
An algorithm for generalized point location and its applications
inferredcites →https://doi.org/10.1016/s0747-7171(89)80003-3openalex-snapshot
Visibility problems for polyhedral terrains
inferredcites →https://doi.org/10.1038/133967a0openalex-snapshot
Analytical Geometry of Three Dimensions
inferredcites →https://doi.org/10.1109/sfcs.1988.21975openalex-snapshot
An optimal algorithm for intersecting line segments in the plane
inferredcites →https://doi.org/10.1109/sfcs.1989.63539openalex-snapshot
An optimal algorithm for intersecting three-dimensional convex 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/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1137/0217052openalex-snapshot
A Randomized Algorithm for Closest-Point Queries
inferredcites →https://doi.org/10.1145/109648.109651openalex-snapshot
Efficient ray shooting and hidden surface removal
inferredcites →https://doi.org/10.1145/109648.109682openalex-snapshot
On the sum of squares of cell complexities in hyperplane arrangements
inferredcites →https://doi.org/10.1145/12130.12172openalex-snapshot
Constructing higher-dimensional convex hulls at logarithmic cost per face
inferredcites →https://doi.org/10.1145/37401.37409openalex-snapshot
Fast ray tracing by ray classification
inferredcites →https://doi.org/10.1145/73007.73044openalex-snapshot
Lines in space-combinators, algorithms and applications
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/73393.73399openalex-snapshot
The complexity of many faces in arrangements of lines of segments
inferredcites →https://doi.org/10.1145/73393.73412openalex-snapshot
Hidden surface removal for rectangles
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/73393.73431openalex-snapshot
Arrangements of lines in 3-space: a data structure with applications
inferredcites →https://doi.org/10.1145/73833.73836openalex-snapshot
Binary partitions with applications to hidden surface removal and solid modelling
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/320176.320188openalex-snapshot
Visibility with a moving point of view
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1996.0038openalex-snapshot
Repetitive Hidden Surface Removal for Polyhedra
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_278openalex-snapshot
Repetitive hidden-surface-removal for polyhedral scenes
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_27openalex-snapshot
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
inferred← citeshttps://doi.org/10.1007/bf02574015openalex-snapshot
On range searching with semialgebraic sets
inferred← citeshttps://doi.org/10.1007/bf02574376openalex-snapshot
On lines missing polyhedral sets in 3-space
inferred← citeshttps://doi.org/10.1007/bf02684409openalex-snapshot
Worst-case versus average case complexity of ray-shooting
inferred← citeshttps://doi.org/10.1007/pl00009297openalex-snapshot
Monte carlo approximation of form factors with error bounded a priori
inferred← citeshttps://doi.org/10.1007/pl00009427openalex-snapshot
Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions
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/s00453-024-01284-7openalex-snapshot
Line Intersection Searching Amid Unit Balls in 3-Space
inferred← citeshttps://doi.org/10.1007/s00454-024-00656-8openalex-snapshot
Intersection Searching amid Tetrahedra in Four Dimensions
inferred← citeshttps://doi.org/10.1007/s10589-010-9354-2openalex-snapshot
A local search algorithm for ray-convex polyhedron intersection
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.08.004openalex-snapshot
Local polyhedra and geometric graphs
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.2012.02.001openalex-snapshot
Watchman tours for polygons with holes
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.1016/s0097-8493(99)00093-xopenalex-snapshot
Interactive ray tracing with the visibility complex
inferred← citeshttps://doi.org/10.1090/conm/223/03131openalex-snapshot
Geometric range searching and its relatives
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/focs.2012.32openalex-snapshot
On Range Searching with Semialgebraic Sets II
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.1137/060672261openalex-snapshot
Vertical Ray Shooting and Computing Depth Orders for Fat Objects
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/s0097539702419662openalex-snapshot
The Expected Number of 3D Visibility Events Is Linear
inferred← citeshttps://doi.org/10.1137/s0097539792229404openalex-snapshot
On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
inferred← citeshttps://doi.org/10.1137/s0097539793244368openalex-snapshot
Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
inferred← citeshttps://doi.org/10.1142/s0218195907002380openalex-snapshot
ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX
inferred← citeshttps://doi.org/10.1142/s1793830910000899openalex-snapshot
A SUCCINCT 3D VISIBILITY SKELETON
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/160985.160990openalex-snapshot
On lines missing polyhedral sets in 3-space
inferred← citeshttps://doi.org/10.1145/220279.220310openalex-snapshot
Monte Carlo approximation of form factors with error bounded a priori
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/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
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/777792.777820openalex-snapshot
Local polyhedra and geometric graphs
inferred← citeshttps://doi.org/10.52843/cassyni.nglyd8openalex-snapshot
Recent Developments on Intersection Searching
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/1109557.1109612openalex-snapshot
Vertical ray shooting and computing depth orders for fat objects
inferred← citeshttps://doi.org/10.5555/236226.236228openalex-snapshot
Fast rendering of irregular grids
inferred← citeshttps://doi.org/10.5555/314161.314368openalex-snapshot
Line transversals of balls and smallest enclosing cylinders in three dimensions
inferred← citeshttps://doi.org/10.70675/7e3f57f6z4175z4a22za02dzf83ca4e3ecfcopenalex-snapshot
Partition spatiale contrainte et convexe pour la simulation basée rayons
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.