Abstract
We present improvements in finding the LMT-skeleton, which is a subgraph of all minimum weight triangulations, independently proposed by Belleville et al, and Dickerson and Montague. Our improvements consist of: (1) A criteria is proposed to identify edges in all minimum weight triangulations, which is a relaxation of the definition of local minimality used in Dickerson and Montague's method to find the LMTskeleton; (2) A worst-Case efficient algorithm is presented for performing one pass of Dickerson and Moutague's method (with our new criteria); (3) Improvements in the implementation that may lead to substantial space reduction for uniformly distributed point sets.
| Original language | English |
|---|---|
| Title of host publication | Algorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings |
| Editors | Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri |
| Publisher | Springer Verlag |
| Pages | 256-265 |
| Number of pages | 10 |
| ISBN (Print) | 3540620486, 9783540620488 |
| DOIs | |
| Publication status | Published - 1996 |
| Event | 7th International Symposium on Algorithms and Computation, ISAAC 1996 - Osaka, Japan Duration: 16 Dec 1996 → 18 Dec 1996 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 1178 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 7th International Symposium on Algorithms and Computation, ISAAC 1996 |
|---|---|
| Country/Territory | Japan |
| City | Osaka |
| Period | 16/12/96 → 18/12/96 |
Bibliographical note
Publisher Copyright:© 1996 Springer-Verlag. All rights reserved.
Fingerprint
Dive into the research topics of 'A study of the LMT-skeleton'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver