Sciweavers

176 search results - page 2 / 36
» Unbalanced Points and Vertices Problem
Sort
View
COMBINATORICS
2006
118views more  COMBINATORICS 2006»
13 years 5 months ago
Counting d-Polytopes with d+3 Vertices
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 ...
Éric Fusy
GD
2007
Springer
13 years 11 months ago
Moving Vertices to Make Drawings Plane
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...
Xavier Goaoc, Jan Kratochvíl, Yoshio Okamot...
ICCCN
2008
IEEE
13 years 11 months ago
Localized Access Point Association in Wireless LANs with Bounded Approximation Ratio
— 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...
Mingming Lu, Jie Wu
AAAI
2010
13 years 6 months ago
Error Aware Monocular Visual Odometry using Vertical Line Pairs for Small Robots in Urban Areas
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...
Ji Zhang, Dezhen Song
CCCG
2006
13 years 6 months ago
An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points
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...
Asish Mukhopadhyay, Robert L. Scot Drysdale