Haavard Bakke Bjerkevik

activity

20212026

most citedFlipping Non-Crossing Spanning Trees

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

collaborators

Showing cs.CGShow all

2 papers · 1 filter

cs.CG2024★ 1 cited

Flipping Non-Crossing Spanning Trees

Håvard Bakke Bjerkevik, Linda Kleist, Torsten Ueckerdt +1

For a set $P$ of $n$ points in general position in the plane, the flip graph $F (P)$ has a vertex for each non-crossing spanning tree on $P$ and an edge between any two spanning tre…

cs.CG2021

Tighter Bounds for Reconstruction from $ε$ -samples

Håvard Bakke Bjerkevik

We show that reconstructing a curve in $R^{d}$ for $d \geq 2$ from a $0.66$ -sample is always possible using an algorithm similar to the classical NN-Crust algorithm. Previous…

Flipping Non-Crossing Spanning Trees

Tighter Bounds for Reconstruction from ε-samples

Tighter Bounds for Reconstruction from $ε$ -samples