44 search results - page 1 / 9 » Greedy drawings of triangulations |
SODA
2008
ACM
13 years 6 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...
GD
2008
Springer
13 years 5 months ago
2008
Springer
JCO
2010
13 years 3 months ago
2010
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
10
Voted
GIS
1998
ACM
13 years 9 months ago
1998
ACM
We apply an advancing front technique to the problem of simplification of dense digitized terrain models. While most simplification algorithms have been based on either incrementa...
AAAI
2011
12 years 4 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...