We completely solve the problem of enumerating combinatorially inequivalent d-dimensional polytopes with d + 3 vertices. A first solution of this problem, by Lloyd, was published ...
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
— The current access point (AP) association schemes in wireless LANs, such as IEEE 802.11, cause an unbalanced load which reduces the performance of both the entire network and i...
We report a new error-aware monocular visual odometry method that only uses vertical lines, such as vertical edges of buildings and poles in urban areas as landmarks. Since vertic...
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...