Worst-case versus average case complexity of ray-shooting

DOI10.1007/BF02684409zbMath0911.65150MaRDI QIDQ1271535

K. Appert

Publication date: 26 April 1999

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmscomputational complexityworst-caseaverage casedivide-and-conquer algorithmray shootingillumination of objects

Mathematics Subject Classification ID

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

Related Items (1)

Cost prediction for ray shooting in octrees

Uses Software

• ARVO

Cites Work

• On the complexity of computations under varying sets of primitives
• Ray shooting on triangles in 3-space
• Semi-stable Markov processes. I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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