12193 search results - page 382 / 2439 » It's not all about |
168
click to vote
WADS
2007
Springer
16 years 27 days ago
2007
Springer
We consider the problem of computing the centroid of all the vertices in a non-degenerate arrangement of n lines. The trivial approach requires the enumeration of all `n 2 ´ verti...
215
Voted
ICANN
2005
Springer
16 years 10 days ago
2005
Springer
Small mobile robots typically have little on-board processing power for time-consuming vision algorithms. Here we show how they can quickly extract very dense yet highly useful inf...
175
click to vote
CCCG
2010
15 years 8 months ago
2010
By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respective...
151
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
A Steiner star for a set P of n points in Rd connects an arbitrary point in Rd to all points of P, while a star connects one of the points in P to the remaining n - 1 points of P....
161
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
It is proved that, if G is a K4-minor-free graph with maximum degree 4, then G is totally ( + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ...