On the polynomial time computability of abstract ray-tracing problems

Shuji Isobe; Tetsuo Kuriyama; Masahiro Mambo; Hiroki Shizuya

doi:10.1093/ietfec/e88-a.5.1209

On the polynomial time computability of abstract ray-tracing problems

Shuji Isobe, Tetsuo Kuriyama, Masahiro Mambo, Hiroki Shizuya

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	1209-1213
Number of pages	5
Journal	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume	E88-A
Issue number	5
DOIs	https://doi.org/10.1093/ietfec/e88-a.5.1209
Publication status	Published - 2005 Jan 1

Keywords

Abstract ray-tracing problem (ARTP)
PSPACE-hard/complete
Ray-tracing problem
Scene

ASJC Scopus subject areas

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

Access to Document

10.1093/ietfec/e88-a.5.1209

Cite this

@article{e0f924839d5843d28ec2be3d81658473,

title = "On the polynomial time computability of abstract ray-tracing problems",

abstract = "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.",

keywords = "Abstract ray-tracing problem (ARTP), PSPACE-hard/complete, Ray-tracing problem, Scene",

author = "Shuji Isobe and Tetsuo Kuriyama and Masahiro Mambo and Hiroki Shizuya",

year = "2005",

month = jan,

day = "1",

doi = "10.1093/ietfec/e88-a.5.1209",

language = "English",

volume = "E88-A",

pages = "1209--1213",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "5",

}

TY - JOUR

T1 - On the polynomial time computability of abstract ray-tracing problems

AU - Isobe, Shuji

AU - Kuriyama, Tetsuo

AU - Mambo, Masahiro

AU - Shizuya, Hiroki

PY - 2005/1/1

Y1 - 2005/1/1

N2 - 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.

AB - 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.

KW - Abstract ray-tracing problem (ARTP)

KW - PSPACE-hard/complete

KW - Ray-tracing problem

KW - Scene

UR - http://www.scopus.com/inward/record.url?scp=24144495265&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24144495265&partnerID=8YFLogxK

U2 - 10.1093/ietfec/e88-a.5.1209

DO - 10.1093/ietfec/e88-a.5.1209

M3 - Article

AN - SCOPUS:24144495265

VL - E88-A

SP - 1209

EP - 1213

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 5

ER -

On the polynomial time computability of abstract ray-tracing problems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this