Institute of Theoretical Computer Science

output

20052022

most citedThe Uncertainty Principle in the Presence of Quantum Memory

850 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing cs.CGShow all

5 papers · 1 filter

cs.CG2013★ 1 cited

Counting Triangulations and other Crossing-free Structures via Onion Layers

Victor Alvarez, Karl Bringmann, Radu Curticapean +1

Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$ . Examples of crossing-free structures include triangulations of $…

cs.CG2012★ 7 cited

On Universal Point Sets for Planar Graphs

Jean Cardinal, Michael Hoffmann, Vincent Kusters

A set P of points in R^2 is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no…

cs.CG2012★ 3 cited

Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons

Jérémie Chalopin, Shantanu Das, Yann Disser +2

This paper gives an introduction to the problem of mapping simple polygons with autonomous agents. We focus on minimalistic agents that move from vertex to vertex along straight li…

cs.CG2009★ 9 cited

Zone Diagrams in Euclidean Spaces and in Other Normed Spaces

Akitoshi Kawamura, Jiří Matoušek, Takeshi Tokuyama

Zone diagram is a variation on the classical concept of a Voronoi diagram. Given n sites in a metric space that compete for territory, the zone diagram is an equilibrium state in t…

cs.CG2007★ 6 cited

Maximizing Maximal Angles for Plane Straight-Line Graphs

Oswin Aichholzer, Thomas Hackl, Michael Hoffmann +5

Let $G = (S, E)$ be a plane straight-line graph on a finite point set $S \subset R^{2}$ in general position. The incident angles of a vertex $p \in S$ of $G$ are the angles between any…