activity
20082019
most citedPlanar Visibility Counting

6 citations · 7 across the 5 of their papers we have counts for

collaborators

6 papers

cs.GR2019

Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels

Sascha Brandt, Claudius Jähn, Matthias Fischer +1

We present a technique for rendering highly complex 3D scenes in real-time by generating uniformly distributed points on the scene's visible surfaces. The technique is applicable t…

cs.DC2017

Gathering Anonymous, Oblivious Robots on a Grid

Matthias Fischer, Daniel Jung, Friedhelm Meyer auf der Heide

We consider a swarm of autonomous mobile robots, distributed on a 2-dimensional grid. A basic task for such a swarm is the gathering process: All robots have to gather at one (…

cs.DC2016

Asymptotically Optimal Gathering on a Grid

Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung +1

In this paper, we solve the local gathering problem of a swarm of indistinguishable, point-shaped robots on a two dimensional grid in asymptotically optimal time $\mathcal{O}(n…

cs.DC2015

Gathering a Closed Chain of Robots on a Grid

Sebastian Abshoff, Andreas Cord-Landwehr, Matthias Fischer +2

We consider the following variant of the two dimensional gathering problem for swarms of robots: Given a swarm of indistinguishable, point shaped robots on a two dimensional gr…

cs.PF2009★ 1 cited

Adaptive Mesh Approach for Predicting Algorithm Behavior with Application to Visibility Culling in Computer Graphics

Matthias Fischer, Claudius Jähn, Martin Ziegler

We propose a concise approximate description, and a method for efficiently obtaining this description, via adaptive random sampling of the performance (running time, memory consump…

cs.CG2008★ 6 cited

Planar Visibility Counting

Matthias Fischer, Matthias Hilbig, Claudius Jähn +2

For a fixed virtual scene (=collection of simplices) S and given observer position p, how many elements of S are weakly visible (i.e. not fully occluded by others) from p? The pres…