On the public citation graph
Computability and complexity of ray tracing
0 signed · 68 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/978-0-387-21830-4_6openalex-snapshot
Period Three Implies Chaos
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0378-4754(90)90191-kopenalex-snapshot
The mathematical structure of Raster graphics
inferredcites →https://doi.org/10.1016/b978-0-12-336156-1.50041-0openalex-snapshot
Introduction to Ray Tracing
inferredcites →https://doi.org/10.1016/c2013-0-10664-2openalex-snapshot
The Mathematical Structure of Raster Graphics
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1080/00029890.1975.11994008openalex-snapshot
Period Three Implies Chaos
inferredcites →https://doi.org/10.1088/0031-9112/37/9/035openalex-snapshot
QED – The Strange Theory of Light and Matter
inferredcites →https://doi.org/10.1090/s0025-5718-1963-0149640-3openalex-snapshot
Deterministic Simulation of Random Processes
inferredcites →https://doi.org/10.1090/s0273-0979-1985-15398-4openalex-snapshot
A rational billiard flow is uniquely ergodic in almost every direction
inferredcites →https://doi.org/10.1103/physrevlett.64.2354openalex-snapshot
Unpredictability and undecidability in dynamical systems
inferredcites →https://doi.org/10.1103/revmodphys.57.617openalex-snapshot
Ergodic theory of chaos and strange attractors
inferredcites →https://doi.org/10.1109/fscs.1990.89529openalex-snapshot
The computability and complexity of optical beam tracing
inferredcites →https://doi.org/10.1126/science.244.4901.166openalex-snapshot
Light Reflection Models for Computer Graphics
inferredcites →https://doi.org/10.1137/0218053openalex-snapshot
Time/Space Trade-Offs for Reversible Computation
inferredcites →https://doi.org/10.1145/358876.358882openalex-snapshot
An improved illumination model for shaded display
inferredcites →https://doi.org/10.1145/360825.360839openalex-snapshot
Illumination for computer generated pictures
inferredcites →https://doi.org/10.1147/rd.176.0525openalex-snapshot
Logical Reversibility of Computation
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.2307/1575357openalex-snapshot
Fundamentals of Three-Dimensional Computer Graphics
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_325openalex-snapshot
Mechanical Computing: The Computational Complexity of Physical Devices
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_118openalex-snapshot
Mechanical Computing: The Computational Complexity of Physical Devices
inferred← citeshttps://doi.org/10.1007/978-1-4939-6883-1_325openalex-snapshot
Mechanical Computing: The Computational Complexity of Physical Devices
inferred← citeshttps://doi.org/10.1007/978-3-319-65826-1_11openalex-snapshot
Computability and Complexity of Unconventional Computing Devices
inferred← citeshttps://doi.org/10.1007/978-3-540-72914-3_12openalex-snapshot
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-10442-8_7openalex-snapshot
Optical Designs for Non-deterministic Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-22494-2_10openalex-snapshot
Nanotechnology Based Optical Solution for NP-Hard Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_325-3openalex-snapshot
Mechanical Computing: The Computational Complexity of Physical Devices
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_325-4openalex-snapshot
Mechanical Computing: The Computational Complexity of Physical Devices
inferred← citeshttps://doi.org/10.1007/978-3-642-39074-6_10openalex-snapshot
Light Ray Concentration Reduces the Complexity of the Wavelength-Based Machine on PSPACE Languages
inferred← citeshttps://doi.org/10.1007/pl00009378openalex-snapshot
Visibility with Multiple Reflections
inferred← citeshttps://doi.org/10.1007/s11047-014-9412-2openalex-snapshot
On the complexity of nonuniform wavelength-based machine
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50020-6openalex-snapshot
Visibility in the Plane
inferred← citeshttps://doi.org/10.1016/j.amc.2009.04.062openalex-snapshot
Physically-relativized Church–Turing Hypotheses: Physical foundations of computing and complexity theory of computational physics
inferred← citeshttps://doi.org/10.1016/j.solener.2019.09.041openalex-snapshot
From video games to solar energy: 3D shading simulation for PV using GPU
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.10.010openalex-snapshot
Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.06.030openalex-snapshot
Masking traveling beams: Optical solutions for NP-complete problems, trading space for time
inferred← citeshttps://doi.org/10.1017/etds.2024.135openalex-snapshot
On the algorithmic descriptive complexity of attractors in topological dynamics
inferred← citeshttps://doi.org/10.1073/pnas.2026818118openalex-snapshot
Constructing Turing complete Euler flows in dimension 3
inferred← citeshttps://doi.org/10.1088/1742-6596/574/1/012067openalex-snapshot
Parallelization of shadow projection in synthetic three-dimensional scenes
inferred← citeshttps://doi.org/10.1093/imrn/rnab233openalex-snapshot
Turing Universality of the Incompressible Euler Equations and a Conjecture of Moore
inferred← citeshttps://doi.org/10.1103/physrevlett.115.098701openalex-snapshot
Space-Bounded Church-Turing Thesis and Computational Tractability of Closed Systems
inferred← citeshttps://doi.org/10.1109/csp66295.2025.00014openalex-snapshot
Cryptography Based on 2D Ray Tracing
inferred← citeshttps://doi.org/10.1109/ojcoms.2024.3463963openalex-snapshot
Toward Real-Time Digital Twins of EM Environments: Computational Benchmark for Ray Launching Software
inferred← citeshttps://doi.org/10.1109/tap.2018.2876680openalex-snapshot
A Bidirectional Ray-Tracing Method for Antenna Coupling Evaluation Based on the Reciprocity Theorem
inferred← citeshttps://doi.org/10.1109/tvt.2025.3604343openalex-snapshot
Polarized Wireless Channel Modeling for Automotive Applications
inferred← citeshttps://doi.org/10.1111/cgf.12026openalex-snapshot
Path Space Regularization for Holistic and Robust Light Transport
inferred← citeshttps://doi.org/10.1145/237218.237394openalex-snapshot
d 1 -optimal motion for a rod (extended abstract)
inferred← citeshttps://doi.org/10.1145/2451236.2451242openalex-snapshot
Adaptive progressive photon mapping
inferred← citeshttps://doi.org/10.1364/josaa.30.001845openalex-snapshot
Optical solver of combinatorial problems: nanotechnological approach
inferred← citeshttps://doi.org/10.18154/rwth-2018-223459openalex-snapshot
Modelling Machine Tools using Structure Integrated Sensors for Fast Calibrationin
inferred← citeshttps://doi.org/10.3390/jmmp2010014openalex-snapshot
Modelling Machine Tools using Structure Integrated Sensors for Fast Calibration
inferred← citeshttps://doi.org/10.4204/eptcs.143.3openalex-snapshot
Ray tracing — computing the incomputable?
inferred← citeshttps://doi.org/10.48550/arxiv.1702.02980openalex-snapshot
Computability and Complexity of Unconventional Computing Devices
inferred← citeshttps://doi.org/10.5287/ora-6rbaxj8rzopenalex-snapshot
A model-independent theory of computational complexity: from patience to precision and beyond
inferred← citeshttps://doi.org/10.5821/dissertation-2117-349573openalex-snapshot
The geometry and topology of steady Euler flows, integrability and singular geometric structures
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.