A study of the LMT-skeleton

Siu Wing Cheng, Naoki Katoh, Manabu Sugai

Research output: Chapter in Book/Conference Proceeding/ReportConference Paper published in a bookpeer-review

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 languageEnglish
Title of host publicationAlgorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings
EditorsTetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri
PublisherSpringer Verlag
Pages256-265
Number of pages10
ISBN (Print)3540620486, 9783540620488
DOIs
Publication statusPublished - 1996
Event7th International Symposium on Algorithms and Computation, ISAAC 1996 - Osaka, Japan
Duration: 16 Dec 199618 Dec 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1178
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Symposium on Algorithms and Computation, ISAAC 1996
Country/TerritoryJapan
CityOsaka
Period16/12/9618/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