Session 7a: Invited Presentation

Algorithms and Computation

Volume 1178 of the series Lecture Notes in Computer Science pp 256-265


A study of the LMT-skeleton

  • Siu-Wing ChengAffiliated withDepartment of Computer Science, HKUST
  • , Naoki KatohAffiliated withKobe University of Commerce
  • , Manabu SugaiAffiliated withKobe University of Commerce

* Final gross prices may vary according to local VAT.

Get Access


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 LMT-skeleton; (2) A worst-case efficient algorithm is presented for performing one pass of Dickerson and Montague's method (with our new criteria); (3) Improvements in the implementation that may lead to substantial space reduction for uniformly distributed point sets.