Worst-case versus average case complexity of ray-shooting

DOI10.1007/BF02684409MaRDI QIDQ1271535zbMATH OpenFDO

Authors K. Appert

Publication date 26 April 1999

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmscomputational complexityaverage caseworst-casedivide-and-conquer algorithmray shootingillumination of objects

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Descriptive geometry (51N05)

Recommendations

• Efficient ray shooting and hidden surface removal
• scientific article; zbMATH DE number 437551
• Ray Shooting and Parametric Search

Cites work

• scientific article; zbMATH DE number 4211552 (Why is no real title available?)
• scientific article; zbMATH DE number 3493681 (Why is no real title available?)
• scientific article; zbMATH DE number 194963 (Why is no real title available?)
• scientific article; zbMATH DE number 844577 (Why is no real title available?)
• On the complexity of computations under varying sets of primitives
• Ray shooting on triangles in 3-space
• Semi-stable Markov processes. I

Cited in

(2)

• Computability and complexity of ray tracing
• Cost prediction for ray shooting in octrees

Describes a project that uses

Uses Software

• ARVO

This page was built for publication: Worst-case versus average case complexity of ray-shooting

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