SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Creation and rendering of realistic trees
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Visual models of plants interacting with their environment
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Realistic modeling and rendering of plant ecosystems
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Interactive design of botanical trees using freehand sketches and example-based editing
ACM SIGGRAPH 2006 Courses
ACM SIGGRAPH 2007 papers
Approximate image-based tree-modeling using particle flows
ACM SIGGRAPH 2007 papers
Knowledge and heuristic-based modeling of laser-scanned trees
ACM Transactions on Graphics (TOG)
Sketch-based tree modeling using Markov random field
ACM SIGGRAPH Asia 2008 papers
Self-organizing tree models for image synthesis
ACM SIGGRAPH 2009 papers
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Automatic reconstruction of tree skeletal structures from point clouds
ACM SIGGRAPH Asia 2010 papers
Metropolis procedural modeling
ACM Transactions on Graphics (TOG)
SkelTre - fast skeletonisation for imperfect point cloud data of botanic trees
EG 3DOR'09 Proceedings of the 2nd Eurographics conference on 3D Object Retrieval
Modeling trees with a space colonization algorithm
NPH'07 Proceedings of the Third Eurographics conference on Natural Phenomena
Graphics Interaction: A procedural method for irregular tree models
Computers and Graphics
| Hi-index | 0.00 |
We present a method to generate models for trees in which we first create a weighted graph, then places endpoints and root point and plan least-cost paths from endpoints to the root point. The collection of resulting paths form a branching structure. We create a hierarchical tree structure by placing subgraphs around each endpoint and beginning again through some number of iterations. Powerful control over the global shape of the resulting tree is exerted by the shape of the initial graph, allowing users to create desired variations; more subtle variations can be accomplished by modifying parameters of the graph and subgraph creation processes and by changing the endpoint distribution mechanisms. The method is capable of matching a desired target structure with a little manual effort, and can easily generate a large group of slightly different models under the same parameter settings. The final trees are both intricate and convincingly realistic in appearance.