Scientific Work


2013

Improving Usability in Procedural Modeling

Björn Ganster
Doctoral Thesis
Definitive Source

2011

River Networks for Instant Procedural Planets

Evgenij Derzapf, Björn Ganster, Michael Guthe, Reinhard Klein
Computer Graphics Forum (Sept. 2011), 30:7(2031-2040)

Realistic terrain models are required in many applications, especially in computer games. Commonly, procedural models are applied to generate the corresponding models and let users experience a wide variety of new environments. Existing algorithms generate landscapes immediately with view-dependent resolution and without preprocessing. Unfortunately, landscapes generated by such algorithms lack river networks and therefore appear unnatural. Algorithms that integrate realistic river networks are computationally expensive and cannot be used to generate a locally adaptive high resolution landscape during a fly-through. In this paper, we propose a novel algorithm to generate realistic river networks. Our procedural algorithm creates complete planets and landscapes with realistic river networks within seconds. It starts with a coarse base geometry of a planet without further preprocessing and user intervention. By exploiting current graphics hardware, the proposed algorithm is able to generate adaptively refined landscape geometry during fly-throughs.

Download paper (pdf), BibTex, Video

2008

1-2-tree: Semantic Modeling and Editing of Trees

Björn Ganster, Reinhard Klein
in proceedings of the Vision, Modeling, and Visualization Workshop (VMV) 2008, pages 51-60

In computer graphics, procedural methods and L-systems are common approaches to model complex botanical trees. In contrast to previous tree modeling systems, we propose linking rules, parameters and geometry to semantic entities. This has the avantage that when an entity is clicked in the viewport, its parameters can be displayed immediately, and viewport editing operations can be reflected in the parameter set. Furthermore, we store the entities in a hierarchical data structure and allow the user to activate recursive traversal via selection options for all editing operations. Therefore, viewport or parameter changes can be applied to a single entity or many entities at once, and only the geometry for the affected entities needs to be updated. The proposed user interface aims at simplifying the modeling process.

Download paper (pdf), BibTex, Video

2007

An Integrated Framework for Procedural Modeling

Björn Ganster, Reinhard Klein
in proceedings of Spring Conference on Computer Graphics 2007 (SCCG 2007), pages 150-157

This paper proposes a new type of visual language to integrate the features of previous procedural modeling systems into a single modeling environment. As in a visual dataflow pipeline, we let nodes wrap operations, but instead of using pipelines to define dataflow, we use edges to define the order of execution. Models can be created efficiently without needing time-consuming compilation runs or learning an unintuitive syntax, and the new system offers a mechanism that can alter procedural models in the viewport. An example demonstrates how to use the new system to create complex models consisting of buildings, plants and landscapes procedurally without resorting to external tools.

Download paper (pdf), BibTex, Demo

2003

Effiziente Algorithmen zur bildbasierten Beleuchtung von Kleidung
(Efficient Algorithms for image-based lighting of clothes)

Björn Ganster
Diploma Thesis

Several algorithms for computing shadows are discussed and new algorithms for calculating the radiance arriving at selected points of the geometry are proposed. A new model for surface lighting suitable for objects with concavities based on a paper by James Stewart is introduced. In order to accomplish this, so-called visibility maps are used. A visibility map is an image of a scene from the point of view of a vertex of that scene. In particular, the discussed algorithms allow for image-based lighting in combination with self-shadowing. Finally, we demonstrate how to use the visibility maps to calculate shadow boundaries und how to use digital camera pictures for illuminating a scene. This makes it possible to calculate soft shadows for extended light sources.

Download report (pdf),
Sample Video

2002

Realtime shading of folded surfaces

Björn Ganster, Reinhard Klein, Mirko Sattler, Ralf Sarlette
Advances in Modelling, Animation and Rendering (CGI 2002), pages 465-480

In this paper we present a new, simple, and efficient way to illuminate folded surfaces with extended light sources in realtime including shadows. In a preprocessing step we compute the parts of the surrounding environment that are visible from a set of points on the surface and represent this information in a binary visibility map. The illumination of the scene, i.e., incoming light from different directions, is encoded in an environment map. This way, extended light sources and complex illumination conditions of the surface can be simulated. The binary visibility information stored in the visibility maps is used during runtime to calculate the incoming and outgoing radiance in the direction of the viewer for each sample point. Various reflection models like the Phong or Lafortune model can be incorporated into these calculations. After computing the radiance values in each sample point, the surface is shaded using simple Gouraud interpolation. Using the pre-computed visibility information, the whole shading and even the change of lighting conditions can be simulated in realtime by modifying the environment map. As an extension to the environment map we support additional point light sources whose parameters and positions can also be manipulated in realtime. Several examples of mesh illumination and shading are demonstrated.

Download paper (pdf)

Impressum


Mail Address: Björn Ganster
Klufterstraße 1
53175 Bonn
Germany
E-Mail:
Phone:
Fax:
mail@bjoern-ganster.de
+49 175 53 299 24
069 / 13303261672