5 papers
-covering -hypergraphs are quasi-eulerian
Mateja Šajna, Andrew Wagner
An Euler tour in a hypergraph is a closed walk that traverses each edge of exactly once, and an Euler family is a family of closed walks that jointly traverse each edge of…
Covering hypergraphs are eulerian
Mateja Šajna, Andrew Wagner
An Euler tour in a hypergraph (also called a rank-2 universal cycle or 1-overlap cycle in the context of designs) is a closed walk that traverses every edge exactly once. In this p…
Eulerian Properties of Design Hypergraphs and Hypergraphs with Small Edge Cuts
Andrew Wagner
An Euler tour of a hypergraph is a closed walk that traverses every edge exactly once; if a hypergraph admits such a walk, then it is called eulerian. Although this notion is one o…
Algebraic Relations and Triangulation of Unlabeled Image Points
André Wagner
In multiview geometry when correspondences among multiple views are unknown the image points can be understood as being unlabeled. This is a common problem in computer vision. We g…
Pictures of Combinatorial Cubes
André Wagner
We prove that the 8-point algorithm always fails to reconstruct a unique fundamental matrix independent on the camera positions, when its input are image point configurations t…