Radiosity algorithms running in sub-quadratic time

被引：0
|
作者：
Szirmay-Kalos, L [1 ]
Foris, T [1 ]
机构：
[1] Tech Univ Budapest, Dept Proc Control, H-1111 Budapest, Hungary
来源：
WSCG '97: THE FIFTH INTERNATIONAL CONFERENCE IN CENTRAL EUROPE ON COMPUTER GRAPHICS AND VISUALIZATION '97, CONFERENCE PROCEEDINGS, VOL 1-4 | 1997年
关键词：
radiosity method; iterative techniques; transillumination; complexity; painter's algorithm;
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
This par,er presents an iterative radiosity algorithm that is capable to determine the radiosity of the patches in O(n log n) time and using only O(n) space. The basic idea is to compute the radiosity updates of all patches in a single direction parallely, requiring only one complete solution of the visibility problem per directions. The visibility problem is solved by painter's algorithm that is responsible for the O(n log n) time complexity, and thus it does not require large amount of z-buffer memory.
引用
收藏
页码：552 / 561
页数：10
相关论文
共 50 条
  • [1] Sub-Quadratic Objectives in Quadratic Placement
    Struzyna, Markus
    DESIGN, AUTOMATION & TEST IN EUROPE, 2013, : 1867 - 1872
  • [2] Markovian Quadratic BSDEs with an Unbounded Sub-quadratic Growth
    Ju, Jingnan
    Tang, Shanjian
    CHINESE ANNALS OF MATHEMATICS SERIES B, 2024, 45 (03) : 441 - 462
  • [3] Learning directed acyclic graph SPNs in sub-quadratic time
    Ghose, Amur
    Jaini, Priyank
    Poupart, Pascal
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2020, 120 : 48 - 73
  • [4] Interaction Hard Thresholding: Consistent Sparse Quadratic Regression in Sub-quadratic Time and Space
    Yang, Shuo
    Shen, Yanyao
    Sanghavi, Sujay
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [5] Markovian Quadratic BSDEs with an Unbounded Sub-quadratic Growth
    Jingnan JU
    Shanjian TANG
    ChineseAnnalsofMathematics,SeriesB, 2024, (03) : 441 - 462
  • [6] Sub-Quadratic Decoding of Gabidulin Codes
    Puchinger, Sven
    Wachter-Zeh, Antonia
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 2554 - 2558
  • [7] A Sub-Quadratic Exact Medoid Algorithm
    Newling, James
    Fleuret, Francois
    ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 54, 2017, 54 : 185 - 193
  • [8] Completing gene trees without species trees in sub-quadratic time
    Mai, Uyen
    Mirarab, Siavash
    BIOINFORMATICS, 2022, 38 (06) : 1532 - 1541
  • [9] Detecting the large entries of a sparse covariance matrix in sub-quadratic time
    Shwartz, Ofer
    Nadler, Boaz
    INFORMATION AND INFERENCE-A JOURNAL OF THE IMA, 2016, 5 (03) : 304 - 330
  • [10] Models of gradient type with sub-quadratic actions
    Ye, Zichun
    JOURNAL OF MATHEMATICAL PHYSICS, 2019, 60 (07)
12345