Inverse Procedural Modeling by Automatic Generation of L-systems

We present an important step towards the solution of the problem of inverse procedural modeling by generating parametric context‐free L‐systems that represent an input 2D model. The L‐system rules efficiently code the regular structures and the parameters represent the properties of the structure tr...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computer graphics forum Ročník 29; číslo 2; s. 665 - 674
Hlavní autori: Št'ava, O., Beneš, B., Měch, R., Aliaga, D. G., Krištof, P.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Oxford, UK Blackwell Publishing Ltd 01.05.2010
Predmet:
and systems
Automation
Clusters
Computer graphics
Computer Graphics [I.3.5]: Computational Geometry and Object Modeling- Geometric algorithms
Computer Graphics [I.3.5]: Computational Geometry and Object Modeling— Geometric algorithms, languages, and systems
Hierarchies
Image processing systems
languages
Mathematical Logic and Formal Languages [F.4.2]: Grammars and Other Rewriting Systems-Parallel rewriting systems - L-systems
Mathematical models
Symbols
Systems development
Terminals
Transformations
Two dimensional
ISSN:0167-7055, 1467-8659
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We present an important step towards the solution of the problem of inverse procedural modeling by generating parametric context‐free L‐systems that represent an input 2D model. The L‐system rules efficiently code the regular structures and the parameters represent the properties of the structure transformations. The algorithm takes as input a 2D vector image that is composed of atomic elements, such as curves and poly‐lines. Similar elements are recognized and assigned terminal symbols of an L‐system alphabet. The terminal symbols' position and orientation are pair‐wise compared and the transformations are stored as points in multiple 4D transformation spaces. By careful analysis of the clusters in the transformation spaces, we detect sequences of elements and code them as L‐system rules. The coded elements are then removed from the clusters, the clusters are updated, and then the analysis attempts to code groups of elements in (hierarchies) the same way. The analysis ends with a single group of elements that is coded as an L‐system axiom. We recognize and code branching sequences of linearly translated, scaled, and rotated elements and their hierarchies. The L‐system not only represents the input image, but it can also be used for various editing operations. By changing the L‐system parameters, the image can be randomized, symmetrized, and groups of elements and regular structures can be edited. By changing the terminal and non‐terminal symbols, elements or groups of elements can be replaced.
Bibliografia:istex:86801DD5D1219D71D12FD7B0AABE0811D426E59B
ark:/67375/WNG-TV11RJTN-2
ArticleID:CGF1636
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/j.1467-8659.2009.01636.x