Michael Balzer

Michael Balzer

Dr

About

20
Publications
8,543
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
864
Citations
Additional affiliations
September 2003 - August 2009
Universität Konstanz
Position
  • Research Assistant

Publications

Publications (20)
Article
Full-text available
Treemaps are a well-known method for the visualization of attributed hierarchical data. Previously proposed Treemap layout algorithms are limited to rectangular shapes, which causes problems with the aspect ratio of the rectangles as well as with identifying the visualized hierarchical structure. The approach of Voronoi Treemaps presented in this p...
Article
Full-text available
We present a new general-purpose method for optimizing existing point sets. The resulting distributions possess high-quality blue noise characteristics and adapt precisely to given density functions. Our method is similar to the commonly used Lloyd's method while avoiding its drawbacks. We achieve our results by utilizing the concept of capacity, w...
Conference Paper
The technical and creative challenges of The LEGO Batman Movie motivated many changes to rendering at Animal Logic. The project was the first feature animation to be entirely rendered with the studio's proprietary path-tracer, Glimpse. Brick-based modelling, animation and destruction techniques taken to the extents of Gotham City required extraordi...
Article
Full-text available
This paper presents an approach for vivid representations of foliage based on implicit surfaces. It approximates the complex lighting interaction within the foliage and enables a clear illustration of the general shape and the local density of the foliage, thus supporting the three-dimensional depth cue of the viewer. Due to its straightforward imp...
Article
Full-text available
A Voronoi diagram of a set of n sites partitions a finite set of m points into regions of different areas, called the capacities of the sites. In this paper we are interested in Voronoi diagrams in which the capacities are given as constraints. We compute such capacity-constrained Voronoi diagrams in finite spaces by starting with an arbitrary part...
Article
We present a new general-purpose method for optimizing existing point sets. The resulting distributions possess high-quality blue noise characteristics and adapt precisely to given density functions. Our method is similar to the commonly used Lloyd's method while avoiding its drawbacks. We achieve our results by utilizing the concept of capacity, w...
Article
Full-text available
A Voronoi diagram of a set of sites partitions a bounded space into regions of different areas. A capacity-constrained Voronoi diagram is a partition in which the area for each Voronoi region is predefined. In this paper, we present two approaches for computing such capacity-constrained Voronoi diagrams in continuous spaces. Our first approach is b...
Article
Full-text available
Voronoi tessellations specify a partition of a given space according to a set of sites where all points in that space are assigned to the closest site. Capacity-constrained Voronoi tessellations are special cases of Voronoi tessellations in which the region of each site has a predefined area. For example, the capacity constraint could state that ea...
Article
We use the complex logarithm as a transformation for the visualization and navigation of highly complex satellite and aerial imagery. The resulting depictions show details and context with greatly different scales in one seamless image while avoiding local distortions. We motivate our approach by showing its relations to the ordinary perspective vi...
Article
Full-text available
The level-of-detail techniques presented in this paper enable a comprehensible interactive visualization of large and complex clustered graph layouts either in 2D or 3D. Implicit surfaces are used for the visually simplified representation of vertex clusters, and so-called edge bundles are formed for the simplification of edges. Additionally, dedic...
Article
Full-text available
Commonly known detail in context techniques for the two-dimensional Euclidean space enlarge details and shrink their context using mapping functions that introduce geometrical compression. This makes it difficult or even impossible to recognize shapes for large differences in magnification factors. In this paper we propose to use the complex logari...
Conference Paper
Full-text available
Treemaps are a well known method for the visualization of attributed hierarchical data. Previously proposed treemap layout algorithms are limited to rectangular shapes, which cause problems with the aspect ratio of the rectangles as well as with identifying the visualized hierarchical structure. The approach of Voronoi treemaps presented in this pa...
Conference Paper
Full-text available
The clear and meaningful visualization of relations between software entities is an invaluable tool for the comprehension, evaluation, and reengineering of the structure of existing software systems. This paper presents an interaction and representation scheme for the visualization and exploration of complex hierarchical graphs to analyze relations...
Article
Full-text available
In this paper we present a hierarchy-based visualization approach for software metrics using Treemaps. Contrary to existing rectangle-based Treemap layout algorithms, we introduce layouts based on arbitrary polygons that are advantageous with respect to the aspect ratio between width and height of the objects and the identification of boundaries be...
Conference Paper
Full-text available
Modern object-oriented programs are hierarchical systems with many thousands of interrelated subsystems. Visualization helps developers to better comprehend these large and complex systems. This work presents a three-dimensional visualization technique that represents the static structure of object-oriented software using distributions of three-dim...
Article
Full-text available
Modern object-oriented programs are hierarchical systems with many thousands of interrelated subsystems. Visualization helps developers to better comprehend these large and complex systems. This paper presents a three-dimensional visualization technique that represents the static structure of object-oriented programs using landscape-like distributi...
Conference Paper
Full-text available
Modern object-oriented programs are hierarchical systems with many thousands of interrelated subsystems. Visualization helps developers to better comprehend these large and complex systems. This paper presents a three-dimensional visualization technique that represents the static structure of object-oriented programs using landscape-like distributi...
Article
Full-text available
Moderne objektorientierte Softwaresysteme bestehen aus Tausenden miteinander in Verbindung stehenden Komponenten. Methoden der Visualisierung können eingesetzt werden, um Entwickler beim Verstehen dieser komplexen hierarchischen Systeme zu unterstützen. Die vorliegende Arbeit stellt eine dreidimensionale Visualisierung vor, bei der die statische St...

Network

Cited By