Interactive Geometric Simulation of 4D Cities

Weber, Basil; Müller, Pascal; Wonka, Peter; Groß, Markus

doi:10.1111/j.1467-8659.2009.01387.x

Cited by 95 publications

(97 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…population size, function). Weber et al [29] present an interactive simulation system for cities growing over time, by expanding streets in the city's road network. A dynamic system that connects geometrical with behavioral modeling is proposed by Vanegas et al [30].…”

Section: Extending Traditional Procedural Methodsmentioning

confidence: 99%

A declarative approach to procedural modeling of virtual worlds

Smelik

Tutenel

Kraker

et al. 2011

Computers & Graphics

View full text Add to dashboard Cite

With the ever increasing costs of manual content creation for virtual worlds, the potential of creating it automatically becomes too attractive to ignore. However, for most designers, traditional procedural content generation methods are complex and unintuitive to use, hard to control, and generated results are not easily integrated into a complete and consistent virtual world.We introduce a novel declarative modeling approach that enables designers to concentrate on stating what they want to create instead of on describing how they should model it. It aims at reducing the complexity of virtual world modeling by combining the strengths of semantics-based modeling with manual and procedural approaches. This article describes two of its main contributions to procedural modeling of virtual worlds: interactive procedural sketching and virtual world consistency maintenance. We discuss how these techniques, integrated in our modeling framework SketchaWorld, build up to enable designers to create a complete 3D virtual world in minutes. Procedural sketching provides a fast and more intuitive way to model virtual worlds, by letting designers interactively sketch their virtual world using high-level terrain features, which are then procedurally expanded using a variety of integrated procedural methods. Consistency maintenance guarantees that the semantics of all terrain features is preserved throughout the modeling process. In particular, it automatically solves conflicts possibly emerging from interactions between terrain features.We believe that these contributions together represent a significant step towards providing more user control and flexibility in procedural modeling of virtual worlds. It can therefore be expected that by further reducing its complexity, virtual world modeling will become accessible to an increasingly broad group of users.

show abstract

Section: Extending Traditional Procedural Methodsmentioning

confidence: 99%

A declarative approach to procedural modeling of virtual worlds

Smelik

Tutenel

Kraker

et al. 2011

Computers & Graphics

View full text Add to dashboard Cite

show abstract

“…Planners prefer robust and reliable methods to fulfill economic and social requirements. Shape grammars can satisfy these requirements and still remain adaptive to different scenarios (Jacobi et al 2009;Marshall 2005;Weber et al 2009). …”

Section: Advantages and Disadvantagesmentioning

confidence: 99%

“…• e application of shape grammars permits low computational costs (Parish and Müller 2001;Watson et al 2008) and can be implemented in interactive planning tools (Jacobi et al 2009;Weber et al 2009) given limited staffing resources. erefore, grammars are in contrast with spatial optimization, such as bi-level network optimization, regarding computational requirements.…”

Section: Advantages and Disadvantagesmentioning

confidence: 99%

See 1 more Smart Citation

Shape grammars overview and assessment for transport and urban design: Review, terminology, assessment, and application

Vitins

Axhausen²

2016

JTLU

View full text Add to dashboard Cite

Shape grammars for urban design have attracted much interest in research and practice. Transport and urban planners increasingly deploy shape grammars, especially in simulations and procedural models. Shape grammars have multiple advantages due to their interdisciplinary and straightforward approach and low computational requirements. In addition, a rulebased design method and underlying fundamental research knowledge can potentially support future planning and design guidelines for handbooks and norms. However, little is known about the effectiveness of shape grammars in transport networks and urban environments. e proposed methodology aims at a future development of a robust and effective language for sustainable urban development. e theory of different fields is consolidated for a general grammar definition. Grammars require specified and corresponding objectives and application specifications for enhanced implementation. e proposed methodology for grammar rule assessment is based on elasticities to gain more insights in the effect of the rules. Elasticities allow comprehensive comparisons and verification between grammar rules. e paper reviews and highlights the key achievements and applications of shape grammars in cognate fields of science. Terminology sheds light on the definitions of most relevant terms including a general definition for grammar rules embedded in the language context. e paper differentiates methodological approaches in grammar design assessment and emphasizes a standardized approach for shape grammar definitions. e paper concludes with a detailed example for grammar rule assessment and potential future research.

show abstract

“…SG-DEF-1974 falls within this category. A recent series of notable shape grammar implementations based on the CGA shape falls within the rigid category of shape grammars (Müller et al, 2007;Pascal Müller et al, 2006;Watson et al, 2008;Weber et al, 2009). …”

Section: Sg-def-1975 Epb 138-227mentioning

confidence: 99%

Tractable Shape Grammars

Yue

Krishnamurti

2013

Environ Plann B Plann Des

View full text Add to dashboard Cite

This paper explores the theoretical basis for a concept of "computation-friendly" shape grammars, through a formal examination of tractability of the grammar formalism.Although a variety of shape grammar definitions have evolved over time, it is possible to unify these to be backwards compatible. Under this unified definition, a shape grammar can be constructed to simulate any Turing machine from which it follows that: a shape grammar may not halt; its language space can be exponentially large; and in general, its membership problem is unsolvable. Moreover, parametric subshape recognition is shown to be NP. This implies that it is unlikely in general to find a polynomial time algorithm to interpret parametric shape grammars, and that more pragmatic approaches need to be sought. Factors that influence the tractability of shape grammars are identified and discussed.

show abstract

Interactive Geometric Simulation of 4D Cities

Cited by 95 publications

References 38 publications

A declarative approach to procedural modeling of virtual worlds

A declarative approach to procedural modeling of virtual worlds

Shape grammars overview and assessment for transport and urban design: Review, terminology, assessment, and application

Tractable Shape Grammars

Contact Info

Product

Resources

About