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
关键词
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 条
  • [31] Entire Minimizers of Allen Cahn Systems with Sub-Quadratic Potentials
    Gazoulis, B. Dimitrios
    Alikakos, Nicholas D.
    Zarnescu, Arghir
    JOURNAL OF DYNAMICS AND DIFFERENTIAL EQUATIONS, 2024, 36 (SUPPL 1)
  • [32] Entire Minimizers of Allen–Cahn Systems with Sub-Quadratic Potentials
    Nicholas D. Alikakos
    Dimitrios Gazoulis
    Arghir Zarnescu
    Journal of Dynamics and Differential Equations, 2024, 36 : 253 - 285
  • [33] Three-dimensional grid drawings with sub-quadratic volume
    Dujmovic, V
    Wood, DR
    GRAPH DRAWING, 2004, 2912 : 190 - 201
  • [34] Sub-quadratic Decoding of One-Point Hermitian Codes
    Nielsen, Johan S. R.
    Beelen, Peter
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (06) : 3225 - 3240
  • [35] A sub-quadratic sequence alignment algorithm for unrestricted cost matrices
    Crochemore, M
    Landau, GM
    Ziv-Ukelson, M
    PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 679 - 688
  • [36] A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem
    Duraj, Lech
    37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 2020, 154
  • [37] ON FRACTIONAL HAMILTONIAN SYSTEMS WITH INDEFINITE SIGN SUB-QUADRATIC POTENTIALS
    Chen, Peng
    Li, Meng
    Zhang, Yuanyuan
    DIFFERENTIAL AND INTEGRAL EQUATIONS, 2021, 34 (3-4) : 165 - 182
  • [38] A simple sub-quadratic algorithm for computing the subset partial order
    Pritchard, P
    INFORMATION PROCESSING LETTERS, 1995, 56 (06) : 337 - 341
  • [39] Hölder continuity for nonlinear sub-elliptic systems with sub-quadratic growth
    Jialin Wang
    Dongni Liao
    Zhenhua Guo
    Zefeng Yu
    Shimin Wu
    Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas, 2015, 109 : 27 - 42
  • [40] A Sub-quadratic Time and Space Complexity Solution for the Dated Tree Reconciliation Problem for Select Tree Topologies
    Drinkwater, Benjamin
    Charleston, Michael A.
    ALGORITHMS IN BIOINFORMATICS (WABI 2015), 2015, 9289 : 93 - 107