R. Seidel

activity

20022022

most citedA better upper bound on the number of triangulations of a planar point set

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

collaborators

Showing cs.CGShow all

3 papers · 1 filter

cs.CG2019

Inserting one edge into a simple drawing is hard

Alan Arroyo, Fabian Klute, Irene Parada +3

A {\em simple drawing} $D (G)$ of a graph $G$ is one where each pair of edges share at most one point: either a common endpoint or a proper crossing. An edge $e$ in the complement o…

cs.CG2014

Counting Triangulations and other Crossing-Free Structures Approximately

Victor Alvarez, Karl Bringmann, Saurabh Ray +1

We consider the problem of counting straight-edge triangulations of a given set $P$ of $n$ points in the plane. Until very recently it was not known whether the exact number of tri…

cs.CG2005

Upper Bound on the Number of Vertices of Polyhedra with $0, 1$ -Constraint Matrices

Khaled Elbassioni, Zvi Lotker, Raimund Seidel

In this note we show that the maximum number of vertices in any polyhedron $P = {x \in R^{d} : A x \leq b}$ with $0, 1$ -constraint matrix $A$ and a real vector $b$ is at most $d…

Inserting one edge into a simple drawing is hard

Counting Triangulations and other Crossing-Free Structures Approximately

Upper Bound on the Number of Vertices of Polyhedra with 0,1-Constraint Matrices

Upper Bound on the Number of Vertices of Polyhedra with $0, 1$ -Constraint Matrices