15 search results - page 2 / 3 » Minimum weight triangulation is NP-hard |
FSTTCS
2004
Springer
15 years 2 months ago
2004
Springer
In this note we discuss some structural properties of minimum weight (pointed) pseudo-triangulations.
119
click to vote
COMGEO
2002
ACM
14 years 9 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
STOC
2006
ACM
15 years 3 months ago
2006
ACM
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
DCOSS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...