Fast and Flexible Tree Rendering with Enhanced Visibility Estimation

被引:1
|
作者
Lee, Jessy [1 ]
Kuo, C. -C. Jay [1 ]
机构
[1] Univ Southern Calif, Ming Hsieh Dept Elect Engn, Los Angeles, CA 90089 USA
关键词
D O I
10.1109/ISM.2008.23
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We present a set of techniques to simplify tree models for faster rendering while retaining their visual resemblance to the original model. This goal is achieved by setting a budget constraint of how many leaves shall be rendered, and we select leaves with higher possibilities to be visible to generate a simplified model for rendering. We first examine how leaf objects can be prioritized to provide a tree model suitable for a single viewing angle. The camera's projected screen space is partitioned into several small regions to ensure that each region is guaranteed to be filled with a certain number of leaves. Each region selects higher priority leaves by utilizing the leaf objects' spatial relationship to the camera. Then, an iterative algorithm is proposed to allocate leaf objects at different viewing angles. The algorithm chooses different viewing positions for leaf allocation at each iteration with the goal of maximizing the resemblance to the original tree model at all possible angles. Three criteria taken in consideration for viewing angle selection are: distance, leaf normal, and unfilled pixel. Experimental results are provided to demonstrate time efficiency of the proposed techniques at the cost of little visual degradation.
引用
收藏
页码:452 / +
页数:3
相关论文
共 50 条
  • [1] Binary Space Partitioning Visibility Tree for Polygonal Light Rendering
    Okuno, Hiroki
    Iwasaki, Kei
    SA'19: SIGGRAPH ASIA 2019 TECHNICAL BRIEFS, 2019, : 79 - 82
  • [2] Fast Estimation and Rendering of Indirect Highlights
    Laurijssen, J.
    Wang, R.
    Dutre, Ph
    Brown, B. J.
    COMPUTER GRAPHICS FORUM, 2010, 29 (04) : 1305 - 1313
  • [3] Binary space partitioning visibility tree for polygonal and environment light rendering
    Hiroki Okuno
    Kei Iwasaki
    The Visual Computer, 2021, 37 : 2499 - 2511
  • [4] Binary space partitioning visibility tree for polygonal and environment light rendering
    Okuno, Hiroki
    Iwasaki, Kei
    VISUAL COMPUTER, 2021, 37 (9-11): : 2499 - 2511
  • [5] Adaptive Matrix Completion for Fast Visibility Computations with Many Lights Rendering
    Wang, S.
    Holzschuch, N.
    COMPUTER GRAPHICS FORUM, 2020, 39 (04) : 47 - 58
  • [6] A Hybrid Mutiresolution Representation for Fast Tree Modeling and Rendering
    Lluch, Javier
    Camahort, Emilio
    Luis Hidalgo, Jose
    Vivo, Roberto
    ICCS 2010 - INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, PROCEEDINGS, 2010, 1 (01): : 485 - 494
  • [7] The Fast Contour Tree-Based Medical Volume Rendering Method
    Wang, Lei
    Guo, Quan
    Zhao, Jianqiao
    Zhang, Shengnan
    Yang, Lisu
    JOURNAL OF MEDICAL IMAGING AND HEALTH INFORMATICS, 2018, 8 (07) : 1451 - 1455
  • [8] Fast and flexible estimation of effective migration surfaces
    Marcus, Joseph
    Ha, Wooseok
    Barber, Rina Foygel
    Novembre, John
    ELIFE, 2021, 10
  • [9] Fast and Flexible Human Pose Estimation with HyperPose
    Guo, Yixiao
    Liu, Jiawei
    Li, Guo
    Mai, Luo
    Dong, Hao
    PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON MULTIMEDIA, MM 2021, 2021, : 3763 - 3766
  • [10] Kd-tree Based Fast Facet Visibility Test in Iterative Physical
    Ding, Hao
    Gao, Pengcheng
    Tao, Yubo
    Lin, Hai
    2013 IEEE ANTENNAS AND PROPAGATION SOCIETY INTERNATIONAL SYMPOSIUM (APSURSI), 2013, : 1788 - 1789