Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Christoph Stamm is active.

Publication


Featured researches published by Christoph Stamm.


european symposium on algorithms | 1998

Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result

Stephan Eidenbenz; Christoph Stamm; Peter Widmayer

We study the problem of minimizing the number of guards positioned at a fixed height h such that each triangle on a given 2.5- dimensional triangulated terrain T is completely visible from at least one guard. We prove this problem to be NP-hard, and we show that it cannot be approximated by a polynomial time algorithm within a ratio of (1 - ∈) 1/35 ln n for any ∈ > 0, unless NP ⊆ TIME (nO(log log n)), where n is the number of triangles in the terrain. Since there exists an approximation algorithm that achieves an approximation ratio of ln n+1, our result is close to the optimum hardness result achievable for this problem.


computer graphics international | 1998

A prototype system for light propagation in terrains

Christoph Stamm; Stephan Eidenbenz; Michael Beck; Peter Stucki; Peter Widmayer

We present a prototype system for a simple version of electromagnetic wave propagation prediction in rural areas, using a real time exploration environment for very large topographic scenes. The wave propagation prediction algorithm is based on a simple line of sight approach, realized with a modified hidden surface removal algorithm. The system serves as a transmitter management tool for interactively placing transmitters and studying the effects. Improvements according to the propagation prediction and automatic optimized placement of transmitters are current subjects of our research.


Algorithmica | 2001

Inapproximability results for guarding polygons and terrains

Stephan Eidenbenz; Christoph Stamm; Peter Widmayer


canadian conference on computational geometry | 1998

Inapproximability of some art gallery problems.

Stephan Eidenbenz; Christoph Stamm; Peter Widmayer


ifip international conference on theoretical computer science | 2000

MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs

Stephan Eidenbenz; Christoph Stamm


canadian conference on computational geometry | 1998

A Modified Longest Side Bisection Triangulation

Christoph Stamm; Stephan Eidenbenz; Renato Pajarola


algorithm engineering and experimentation | 2003

Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations.

Luzi Anderegg; Stephan Eidenbenz; Martin Gantenbein; Christoph Stamm; David Scot Taylor; Birgitta Weber; Peter Widmayer


parallel and distributed processing techniques and applications | 2000

Virtual reality and dynamic statistical graphics: A bidirectional link in a heterogeneous, distributed computing environment.

Martin Schneider; Christoph Stamm; Jürgen Symanzik; Peter Widmayer


international conference in central europe on computer graphics and visualization | 2002

PGF: a new progressive file format for lossy and lossless image compression

Christoph Stamm


Archive | 2002

Train routing algorithms

Luzi Anderegg; Stephan Eidenbenz; Martin Gantenbein; Christoph Stamm; David Scot Taylor; Birgitta Weber; Peter Widmayer

Collaboration


Dive into the Christoph Stamm's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Stephan Eidenbenz

Los Alamos National Laboratory

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge