• DocumentCode
    2967645
  • Title

    Corrections to the surface area metric with respect to mail-boxing

  • Author

    Hunt, Warren A.

  • Author_Institution
    Univ. of Texas at Austin, Austin, TX
  • fYear
    2008
  • fDate
    9-10 Aug. 2008
  • Firstpage
    77
  • Lastpage
    80
  • Abstract
    The surface area heuristic is the standard method for producing high quality acceleration structures for ray-tracing. High quality acceleration structures minimize per-ray costs for ray-tracing and thus rendering times. However, the metric used by the surface area heuristic makes several assumptions that do not hold in practice. Much work has been done to analyze these assumptions and provide a more accurate cost model but no-one has analyzed the surface area metricpsilas interaction with a common ray-tracing optimization, mail-boxing. We present a correction to the surface area metric for ray-tracing systems using mail-boxing. Additionally, we provide a concrete example of how our new metric improves the quality of kd-trees as compared to the original surface area metric. Finally, we show that our correction provides a noticeable (about 30%) reduction in the number of intersection tests performed during ray-tracing as well as improving run-time performance. We conclude that this algorithmic adjustment is so simple that anyone implementing mail-boxing should consider using it.
  • Keywords
    optimisation; ray tracing; rendering (computer graphics); trees (mathematics); kd-tree; mail-boxing method; ray-tracing optimization; rendering method; surface area heuristic; surface area metric; Acceleration; Computer graphics; Concrete; Cost function; Layout; Partitioning algorithms; Performance evaluation; Ray tracing; Runtime; Testing; I.3.7 [Computing Methodologies]: COMPUTER GRAPHICS—Three-Dimensional Graphics and Realism;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Interactive Ray Tracing, 2008. RT 2008. IEEE Symposium on
  • Conference_Location
    Los Angeles, CA
  • Print_ISBN
    978-1-4244-2741-3
  • Type

    conf

  • DOI
    10.1109/RT.2008.4634625
  • Filename
    4634625