M. Scheucher

activity

20182024

most citedSubgraph-universal planar graphs for trees

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing cs.CGShow all

4 papers · 1 filter

cs.CG2022

Blocking Delaunay Triangulations from the Exterior

Oswin Aichholzer, Thomas Hackl, Maarten Löffler +4

Given two distinct point sets $P$ and $Q$ in the plane, we say that $Q$ \emph{blocks} $P$ if no two points of $P$ are adjacent in any Delaunay triangulation of $P \cup Q$ . Aichholze…

cs.CG2020

Many Order Types on Integer Grids of Polynomial Size

Manfred Scheucher

Two labeled point configurations ${p_{1}, \dots, p_{n}}$ and ${q_{1}, \dots, q_{n}}$ are of the same order type if, for every $i, j, k$ , the triples $(p_{i}, p_{j}, p_{k})$ and $(q_{i}, q_{j}, q_{k})$ hav…

cs.CG2019

On the Average Complexity of the $k$ -Level

Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher +3

Let $L$ be an arrangement of $n$ lines in the Euclidean plane. The \emph{ $k$ -level} of $L$ consists of all vertices $v$ of the arrangement which have exactly $k$ line…

cs.CG2018

On L-shaped point set embeddings of trees: first non-embeddable examples

Torsten Mütze, Manfred Scheucher

An L-shaped embedding of a tree in a point set is a planar drawing of the tree where the vertices are mapped to distinct points and every edge is drawn as a sequence of two axis-al…

Blocking Delaunay Triangulations from the Exterior

Many Order Types on Integer Grids of Polynomial Size

On the Average Complexity of the k-Level

On L-shaped point set embeddings of trees: first non-embeddable examples

On the Average Complexity of the $k$ -Level