In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...
— This paper addresses a novel visibility-based pursuit-evasion problem in which a team of searchers with limited range sensors must coordinate to clear any evaders from an unkno...
Joseph W. Durham, Antonio Franchi, Francesco Bullo
We present a method for the reconstruction of a specular surface, using a single camera viewpoint and the reflection of a planar target placed at two different positions. Contrar...
Abstract. Recent efforts in robust estimation of the two-view relation have focused on uncalibrated cameras with no prior knowledge of pose. However, in practice robotic vehicles t...