| Summary: | No polynomial time algorithm is known to compute the minimum weight triangulation
(MWT) of a point set. In this thesis we present an efficient implementation of the LMTskeleton
heuristic. This heuristic computes a subgraph of the MWT of a point set from
which the MWT can usually be completed. For uniformly distributed sets of tens of
thousands of points our algorithm constructs the exact MWT in expected linear time
and space.
A fast heuristic, other than being usefull in areas such as stock cutting, finite element
analysis, and terrain modeling, allows to experiment with different point sets in order to
explore the complexity of the MWT problem. We present point sets constructed with
this implementation such that the LMT-skeleton heuristic does not produce a complete
graph and can not compute the MWT in polynomial time, or that can be used to prove
the NP-Hardness of the MWT problem. === Science, Faculty of === Computer Science, Department of === Graduate
|
|---|
