Computability and complexity of ray tracing

DOI10.1007/BF02574009MaRDI QIDQ1327451zbMATH OpenOpenAlexFDO

Authors V. Pereyra

Publication date 1 March 1995

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/131302

zbMATH Keywords

ray-tracing problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 7361689
• scientific article; zbMATH DE number 1487791
• Efficient ray shooting and hidden surface removal
• Synthesis of images of objects with intricate shapes by ray tracing
• Worst-case versus average case complexity of ray-shooting

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 43134 (Why is no real title available?)
• scientific article; zbMATH DE number 3002291 (Why is no real title available?)
• scientific article; zbMATH DE number 194528 (Why is no real title available?)
• scientific article; zbMATH DE number 194963 (Why is no real title available?)
• A rational billiard flow is uniquely ergodic in almost every direction
• Billiards in polygons
• Deterministic Simulation of Random Processes
• Ergodic theory of chaos and strange attractors
• Logical Reversibility of Computation
• Period Three Implies Chaos
• Reducibility among combinatorial problems
• Relationships between nondeterministic and deterministic tape complexities
• Time/Space Trade-Offs for Reversible Computation
• Unpredictability and undecidability in dynamical systems

Cited in

(8)

• On the complexity of nonuniform wavelength-based machine
• scientific article; zbMATH DE number 1944482 (Why is no real title available?)
• Masking traveling beams: optical solutions for NP-complete problems, trading space for time
• Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
• scientific article; zbMATH DE number 7361689 (Why is no real title available?)
• Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• Closed-form analytic maps in one and two dimensions can simulate universal Turing machines

This page was built for publication: Computability and complexity of ray tracing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1327451)