SCCG

We outline and compare two approaches for the computation of the shape diameter function (SDF) on the GPU. The SDF is a scalar function describing the local thickness of an object. It can be used for consistent mesh partitioning and skeletonization. In ...

We introduce geometric graph grammars, demonstrate how they can generate geometric structures, and introduce an algorithm for their automatic learning (inverse procedural modeling). Our approach extends the concept of graph grammars to allow for coding ...

Continuous collision detection provides very good information about the interaction between objects. In this paper, we present a new method for computing the continuous collision detection between a static and a moving triangle mesh. We target our ...

We present an improved variant of the broad phase collision-detection algorithm called Sweep and Prune (SaP) for large datasets in three-dimensional environments. Unlike previous solutions, our algorithm performs a stepwise sweep over a primary and a ...

We present a method to speedup the simulation step of a water and erosion simulation. Our system is inspired by physics, but nevertheless, achieves interactive frame-rates. We use the DirectX 11 API to accelerate the simulation on the GPU by using ...

Annotated metro maps, which are a graphic representation abstracting a city's transportation network and providing additional details about a city, can be difficult to draw because of the landmark density around many city centers. A focus+context ...

2D color maps are often used to visually encode complex data characteristics such as heat or height. The comprehension of color maps in visualization is affected by the display (e.g., a monitor) and the perceptual abilities of the viewer. People with ...

This paper proposes a technique for compression and interactive visualization. This method introduces a progressive compression technique and an interactive visualization to detect the region selected by the user. In order to enhance the performance of ...

The aim of the paper is to present the history of using random processes in art. A computer and algorithm can not work in isolation without a painter --- throughout the whole art process. At the beginning of the work is an ideological concept, idea or ...

As the volume of data that can be shown in a virtual globe increases, it becomes necessary to develop techniques which provides an unambiguous and meaningful visualization. In this paper, we propose a server-client architecture which allows the ...

The segmentation of sensory data of various domains is often crucial pre-processing step in many computer vision methods and applications. In this work, we propose a method that leverages the quantization of local feature's distributions for the depth ...

This paper deals with navigation indoors and in small-scale outdoor scenes. We propose to enhance IMU and conventional visual odometry navigation - typically used in the said contexts - by visual location estimation based on markers conveniently ...

This paper tackles the unsolved important problem of training deep models with small amounts of annotated data. We propose a semi-supervised self-training bootstrap to deep learning on small datasets by retrieving and utilizing additional images from ...