Modeling and visualization of leaf venation patterns

被引:253
作者
Runions, A [1 ]
Fuhrer, M [1 ]
Lane, B [1 ]
Federl, P [1 ]
Rolland-Lagan, AG [1 ]
Prusinkiewicz, P [1 ]
机构
[1] Univ Calgary, Dept Comp Sci, Calgary, AB T2N 1N4, Canada
来源
ACM TRANSACTIONS ON GRAPHICS | 2005年 / 24卷 / 03期
关键词
realistic image synthesis; modeling of natural phenomena; morphogenesis; vein development; leaf growth; auxin; Voronoi diagram; relative neighborhood;
D O I
10.1145/1073204.1073251
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We introduce a class of biologically-motivated algorithms for generating leaf venation patterns. These algorithms simulate the interplay between three processes: (1) development of veins towards hormone (auxin) sources embedded in the leaf blade; (2) modification of the hormone source distribution by the proximity of veins; and (3) modification of both the vein pattern and source distribution by leaf growth. These processes are formulated in terms of iterative geometric operations on sets of points that represent vein nodes and auxin sources. In addition, a vein connection graph is maintained to determine vein widths. The effective implementation of the algorithms relies on the use of space subdivision (Voronoi diagrams) and time coherence between iteration steps. Depending on the specification details and parameters used, the algorithms can simulate many types of venation patterns, both open (tree-like) and closed (with loops). Applications of the presented algorithms include texture and detailed structure generation for image synthesis purposes, and modeling of morphogenetic processes in support of biological research.
引用
收藏
页码:702 / 711
页数:10
相关论文
共 50 条
  • [1] Gradual shifts in sites of free-auxin production during leaf-primordium development and their role in vascular differentiation and leaf morphogenesis in Arabidopsis
    Aloni, R
    Schwalm, K
    Langhans, M
    Ullrich, CI
    [J]. PLANTA, 2003, 216 (05) : 841 - 853
  • [2] Andrade D.V., 2001, P 13 CAN C COMP GEOM, P25
  • [3] [Anonymous], MORPHOLOGIE ANATOMIE
  • [4] BARANOSKI G, 2002, 26 SIGGRAPH
  • [5] OPTIMAL EXPECTED-TIME ALGORITHMS FOR CLOSEST POINT PROBLEMS
    BENTLEY, JL
    WEIDE, BW
    YAO, AC
    [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1980, 6 (04): : 563 - 580
  • [6] BLOOMENTHAL J, 1995, THESIS U CALGARY CAL
  • [7] Bohn S, 2002, PHYS REV E, V65, DOI 10.1103/PhysRevE.65.061914
  • [8] COMPUTING DIRICHLET TESSELLATIONS
    BOWYER, A
    [J]. COMPUTER JOURNAL, 1981, 24 (02) : 162 - 166
  • [9] The genetics of geometry
    Coen, E
    Rolland-Lagan, AG
    Matthews, M
    Bangham, JA
    Prusinkiewicz, P
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2004, 101 (14) : 4728 - 4735
  • [10] STOCHASTIC SAMPLING IN COMPUTER-GRAPHICS
    COOK, RL
    [J]. ACM TRANSACTIONS ON GRAPHICS, 1986, 5 (01): : 51 - 72