1633 search results - page 228 / 327 » Planar Map Graphs |
SGP
2007
14 years 22 days ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
ATAL
2008
Springer
14 years 10 days ago
2008
Springer
Behaviors in soccer-agent domains can involve individual plays, several players involved in tactical plays or the whole team trying to follow strategies supported by specific form...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
COMBINATORICS
1998
13 years 10 months ago
1998
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...