A fast heuristic for finding the minimum weight triangulation
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...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
2009
|
| Online Access: | http://hdl.handle.net/2429/6380 |