Rama Hoetzlein
ABSTRACT
The modeling of trees represents a unique and classical challenge in computer graphics. Models of 3D trees must express the form, complexity, structure, growth and diversity of real trees. Presently the most common methods for the modeling of 3D trees include a) user-based creative modeling, b) direct geometric capture such as LIDAR and photogrammetry, or c) indirect methods such as machine learning from images. These techniques often require significant human effort, large amounts of data, considerable computation resources, or any of the above. While there are methods that consider the direct procedural generation of trees, current models often require some human supervision to focus on naturally plausible variants. Instead, our approach is to construct a botanically-inspired, harmonic, procedural model for trees which directly produces realistic yet diverse trees.
- Jules Bloomenthal. 1985. Modeling the Mighty Maple. SIGGRAPH Comput. Graph. 19, 3 (jul 1985), 305–311. https://doi.org/10.1145/325165.325249Google Scholar
Digital Library
- Frédéric Boudon, Alexandre Meyer, and Christophe Godin. 2006. Survey on Computer Representations of Trees for Realistic and Efficient Rendering. (2006).Google Scholar
- Alenda Chang. 2019. Between Plants and Polygons: SpeedTrees and an Even Speedier History of Digital Morphogenesis. (2019).Google Scholar
- Xuejin Chen, Boris Neubert, Ying-Qing Xu, Oliver Deussen, and Sing Bing Kang. 2008. Sketch-Based Tree Modeling Using Markov Random Field. ACM Trans. Graph. 27, 5, Article 109 (dec 2008), 9 pages. https://doi.org/10.1145/1409060.1409062Google ScholarDigital Library
- Phillippe de Reffye, Claude Edelin, Jean Françon, Marc Jaeger, and Claude Puech. 1988. Plant Models Faithful to Botanical Structure and Development. SIGGRAPH Comput. Graph. 22, 4 (jun 1988), 151–158. https://doi.org/10.1145/378456.378505Google ScholarDigital Library
- Rama Hoetzlein. 2020. Natural Structures through the Convergence of Particles and Shapes. In Proceedings of the XXII Generative Art Conference.Google Scholar
- M. Holton. 1994. Strands, Gravity and Botanical Tree Imagery. Computer Graphics Forum 13 (1994).Google Scholar
- Joseph Penn Jason Weber. 1995. Creation and Rendering of Realistic Trees. In Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques(SIGGRAPH ’95). Association for Computing Machinery, New York, NY, USA, 119–128. https://doi.org/10.1145/218380.218427Google ScholarDigital Library
- Lina Juuso. 2017. Procedural Genreation of Imaginative Trees using a Space Colonization Algorithm. Ph. D. Dissertation.Google Scholar
- Brian Karis, Rune Stubbe, and Graham Wihlidal. 2021. A Deep Dive into Unreal Engine’s 5 Nanite. Proceedings of SIGGRAPH 2021 (Aug 2021).Google Scholar
- Yoichiro Kawaguchi. 1982. A Morphological Study of the Form of Nature. SIGGRAPH Comput. Graph. 16, 3 (jul 1982), 223–232. https://doi.org/10.1145/965145.801284Google ScholarDigital Library
- Sylvain Lefebvre and Fabrice Neyret. 2002. Synthesizing Bark. In Thirteenth Eurographics Workshop on Rendering. The Eurographics Association.Google Scholar
- Aristid Lindenmayer. 1968. Mathematical models for cellular interactions in development. II. Simple and branching filaments with two-sided inputs. J Theor Biol 18, 3 (mar 1968), 300–15. https://doi.org/10.1016/0022-5193(68)90080-5Google ScholarCross Ref
- Bern Lintermann and Oliver Deussen. 1996. Interactive Modelling and Animation of Branching Botanical Structures. In Proceedings of the Eurographics Workshop on Computer Animation and Simulation ’96 (Poitiers, France). Springer-Verlag, Berlin, Heidelberg, 139–151.Google ScholarDigital Library
- Zhihao Liu, Kai Wu, Jianwei Guo, Yunhai Wang, Oliver Deussen, and Zhanglin Cheng. 2021. Single Image Tree Reconstruction via Adversarial Network. Graphical Models 117(2021), 101115. https://doi.org/10.1016/j.gmod.2021.101115Google ScholarDigital Library
- Nelson Max. 1990. Cone-Spheres. SIGGRAPH Comput. Graph. 24, 4 (sep 1990), 59–62. https://doi.org/10.1145/97880.97885Google ScholarDigital Library
- Boris Neubert, Thomas Franken, and Oliver Deussen. 2007. Approximate Image-Based Tree-Modeling Using Particle Flows. In ACM SIGGRAPH 2007 Papers (San Diego, California) (SIGGRAPH ’07). Association for Computing Machinery, New York, NY, USA, 88–es. https://doi.org/10.1145/1275808.1276487Google ScholarDigital Library
- Wojciech Palubicki, Kipp Horel, Steven Longay, Adam Runions, Brendan Lane, Radomír Měch, and Przemyslaw Prusinkiewicz. 2009. Self-Organizing Tree Models for Image Synthesis. ACM Trans. Graph. 28, 3, Article 58 (jul 2009), 10 pages. https://doi.org/10.1145/1531326.1531364Google ScholarDigital Library
- Joanna L. Power, A. J. Bernheim Brush, Przemyslaw Prusinkiewicz, and David H. Salesin. 1999. Interactive Arrangement of Botanical L-System Models. In Proceedings of the 1999 Symposium on Interactive 3D Graphics (Atlanta, Georgia, USA) (I3D ’99). Association for Computing Machinery, New York, NY, USA, 175–182. https://doi.org/10.1145/300523.300548Google ScholarDigital Library
- William T. Reeves. 1983. Particle Systems—a Technique for Modeling a Class of Fuzzy Objects. ACM Trans. Graph. 2, 2 (apr 1983), 91–108. https://doi.org/10.1145/357318.357320Google ScholarDigital Library
- Adam Runions, Brendan Lane, and Przemyslaw Prusinkiewicz. 2007. Modeling Trees with a Space Colonization Algorithm. In Proceedings of the Third Eurographics Conference on Natural Phenomena (Prague, Czech Republic) (NPH’07). Eurographics Association, Goslar, DEU, 63–70.Google ScholarDigital Library
- Deni Suwardhi, Kamal Nur Fauzan, Agung Budi Harto, Budhy Soeksmantono, Riantini Virtriana, and Arnadi Murtiyoso. 2022. 3D Modeling of Individual Trees from LiDAR and Photogrammetric Point Clouds by Explicit Parametric Representations for Green Open Space (GOS) Management. ISPRS International Journal of Geo-Information 11, 3(2022). https://doi.org/10.3390/ijgi11030174Google ScholarCross Ref
- Ke Xie, Feilong Yan, Andrei Sharf, Oliver Deussen, Hui Huang, and Baoquan Chen. 2016. Tree Modeling with Real Tree-Parts Examples. IEEE Transactions on Visualization and Computer Graphics 22, 12(2016), 2608–2618. https://doi.org/10.1109/TVCG.2015.2513409Google ScholarDigital Library
- Ling Xu and David Mould. 2012. Graphics Interaction: A Procedural Method for Irregular Tree Models. Comput. Graph. 36, 8 (dec 2012), 1036–1047. https://doi.org/10.1016/j.cag.2012.08.005Google ScholarDigital Library
- Ling Xu and David Mould. 2015. Procedural Tree Modeling with Guiding Vectors. Computer Graphics Forum 34, 7 (oct 2015). https://doi.org/10.1111/cgf.12744Google ScholarDigital Library
Index Terms
- A Procedural Model for Diverse Tree Species
Recommendations
Constructing a minimum height elimination tree of a tree in linear time
Given a graph, finding an optimal vertex ranking and constructing a minimum height elimination tree are two related problems. However, an optimal vertex ranking does not by itself provide enough information to construct an elimination tree of minimum ...
Inverse design of urban procedural models
We propose a framework that enables adding intuitive high level control to an existing urban procedural model. In particular, we provide a mechanism to interactively edit urban models, a task which is important to stakeholders in gaming, urban planning, ...
Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel
A k-tree core of a tree network is a subtree with exactly k leaves that minimizes the total distance from vertices to the subtree. A k-tree center of a tree network is a subtree with exactly k leaves that minimizes the distance from the farthest vertex ...
Comments