scholarly journals Inverse Procedural Modeling of Branching Structures by Inferring L-Systems

2020 ◽  
Vol 39 (5) ◽  
pp. 1-13
Author(s):  
Jianwei Guo ◽  
Haiyong Jiang ◽  
Bedrich Benes ◽  
Oliver Deussen ◽  
Xiaopeng Zhang ◽  
...  
Keyword(s):  
Procedural Modeling ◽  
Branching Structures ◽  
L Systems

Modeling of Flowers with Inverse Grammar Generation Interface

2012 ◽  
Vol 3 (2) ◽  
pp. 23-41
Author(s):  
Olga Petrenko ◽  
Mateu Sbert ◽  
Olivier Terraz ◽  
Djamchid Ghazanfarpour
Keyword(s):  
Inverse Modeling ◽  
Three Dimensional ◽  
Automatic Generation ◽  
Flowering Plants ◽  
Natural Phenomena ◽  
Production Rules ◽  
Procedural Modeling ◽  
Model Based ◽  
L Systems ◽  
Generalized Maps

Flowers belong to one of the natural phenomena that cannot be captured completely, as there is enormous variety of shapes both within and between individuals. The authors propose a procedural modeling of flowering plants using an extension of L-Systems – a model based on three-dimensional generalized maps. Conventionally, in order to build a model the user has to write the grammar, which consists of the description of 3Gmaps and all the production rules. The process of writing a grammar is usually quite laborious and tedious. In order to avoid this the authors propose new interface functionality: the inverse modeling by automatic generation of L-systems. The user describes the flower he wants to model, by assigning the properties of its organs. The algorithm uses this information as an input, which is then analyzed and coded as L-systems grammar.

scholarly journals Inverse Procedural Modeling by Automatic Generation of L-systems

2010 ◽  
Vol 29 (2) ◽  
pp. 665-674 ◽  
Author(s):  
O. Št'ava ◽  
B. Beneš ◽  
R. Měch ◽  
D. G. Aliaga ◽  
P. Krištof
Keyword(s):  
Automatic Generation ◽  
Procedural Modeling ◽  
L Systems

scholarly journals Parametric L-systems-based modeling self-reconfiguration of modular robots in obstacle environments

2018 ◽  
Vol 15 (1) ◽  
pp. 172988141875447 ◽  
Author(s):  
Dongyang Bie ◽  
Yulin Wang ◽  
Yu Zhang ◽  
Che Liu ◽  
Jie zhao ◽  
...  
Keyword(s):  
The Self ◽  
Modular Robots ◽  
Lindenmayer Systems ◽  
Fundamental Function ◽  
Modeling Framework ◽  
Branching Structures ◽  
Reconfigurable Robots ◽  
L System ◽  
Key Factor ◽  
L Systems

Self-reconfiguration of modular self-reconfigurable robots is a fundamental function that can be used as part of higher-level functionality. Interaction with the environment is a key factor affecting the self-reconfiguration process of modular robots. In this article, a modeling framework that makes it possible to simulate and visualize the interactions at the level of decentralized modules will be introduced. The framework extends the formalism of Lindenmayer systems (L-systems) with constructs needed to model robotic information exchanged between decentralized modules and their surrounding environments. Both the construction of target configurations and environmental sensitive adaption can be handled by extending L-system symbols and reproduction rules. The proposed method is illustrated with simulations capturing the development of branching structures while adapting to environmental obstacles.

Automatic Scenario Generation Through Procedural Modeling for Scenario-Based Training

2009 ◽  
Author(s):  
Glenn Martin ◽  
Sae Schatz ◽  
Clint Bowers ◽  
Charles E. Hughes ◽  
Jennifer Fowlkes ◽  
...  
Keyword(s):  
Scenario Generation ◽  
Procedural Modeling

Optimal Land Use Analysis Using Lindenmayer Grammars

2013 ◽  
Vol 8 (2) ◽  
pp. 163-175
Author(s):  
Urszula Żukowska ◽  
Grażyna Kalewska
Keyword(s):  
Land Use ◽  
Urban Development ◽  
Computer Program ◽  
L System ◽  
L Systems ◽  
The City

In today's world, when it is so important to use every piece of land for a particular purpose, both economically and ecologically, identifying optimal land use is a key issue. For this reason, an analysis of the optimal land use in a section of the city of Olsztyn, using the L-system Urban Development computer program, was chosen as the aim of this paper. The program uses the theories of L-systems and the cartographic method to obtain results in the form of sequences of productions or maps. For this reason, the first chapters outline both theories, i.e. the cartographic method to identify optimal land use and Lindenmayer grammars (called L-systems). An analysis based on a fragment of the map of Olsztyn was then carried out. Two functions were selected for the analysis: agricultural and forest-industrial. The results are presented as maps and sequences in individual steps.

On metalinear ETOL systems

1980 ◽  
Vol 3 (1) ◽  
pp. 15-36
Author(s):  
Grzegorz Rozenberg ◽  
Dirk Vermeir
Keyword(s):  
Finite Index ◽  
Closure Properties ◽  
Pumping Lemma ◽  
L Systems ◽  
Structural Characterizations

The concept of metalinearity in ETOL systems is investigated. Some structural characterizations, a pumping lemma and the closure properties of the resulting class of languages are established. Finally, some applications in the theory of L systems of finite index are provided.

Information Retrieval Systems, an Algebraic Approach I1

1981 ◽  
Vol 4 (3) ◽  
pp. 551-603
Author(s):  
Zbigniew Raś
Keyword(s):  
Information Retrieval ◽  
Boolean Algebra ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Algebraic Approach ◽  
Partially Ordered ◽  
Retrieval Systems ◽  
Information Retrieval Systems ◽  
Present Part ◽  
L Systems

This paper is the first of the three parts of work on the information retrieval systems proposed by Salton (see [24]). The system is defined by the notions of a partially ordered set of requests (A, ⩽), the set of objects X and a monotonic retrieval function U : A → 2X. Different conditions imposed on the set A and a function U make it possible to obtain various classes of information retrieval systems. We will investigate systems in which (A, ⩽) is a partially ordered set, a lattice, a pseudo-Boolean algebra and Boolean algebra. In my paper these systems are called partially ordered information retrieval systems (po-systems) lattice information retrieval systems (l-systems); pseudo-Boolean information retrieval systems (pB-systems) and Boolean information retrieval systems (B-systems). The first part concerns po-systems and 1-systems. The second part deals with pB-systems and B-systems. In the third part, systems with a partial access are investigated. The present part discusses the method for construction of a set of attributes. Problems connected with the selectivity and minimalization of a set of attributes are investigated. The characterization and the properties of a set of attributes are given.

Sign in / Sign up

Export Citation Format

Share Document