On the polynomial time computability of abstract ray-tracing problems

Shuji Isobe, Tetsuo Kuriyama, Masahiro Mambo, Hiroki Shizuya

    研究成果: Article査読

    抄録

    The abstract ray-tracing problem asks, for a given scene consisting of a light source, a light receiver and finitely many obstacles in a space, and a given positive integer ε +~ 0, whether a ray going out from the light source could reach the light receiver with intensity at least ε. The problem is known to be PSPACE-hard, and it is very unlikely that there exists an efficient algorithm to solve the problem without adding any restriction. In this paper, we show that the problem can be solved in polynomial time under some weak practical restrictions.

    本文言語English
    ページ(範囲)1209-1213
    ページ数5
    ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    E88-A
    5
    DOI
    出版ステータスPublished - 2005 1 1

    ASJC Scopus subject areas

    • Signal Processing
    • Computer Graphics and Computer-Aided Design
    • Electrical and Electronic Engineering
    • Applied Mathematics

    フィンガープリント 「On the polynomial time computability of abstract ray-tracing problems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル