@inproceedings{4a335f9e17c64e4f80e3623cfc0e807d,
title = "A new subgraph of minimum weight triangulations",
abstract = "In this paper, two sufficient conditions for identifying a subgraph of minimum weight triangulation of a planar point set are presented. These conditions are based on local geometric properties of an identifying edge in the given point set. Unlike the previous known sufficient conditions for identifying subgraphs, such as Keil{\textquoteright}s β-skeleton and Yang and Xu{\textquoteright}s double circles, The local geometric requirement in our conditions is not necessary symmetric with respect to the edge to be identified. The identified subgraph is different from all the known subgraphs including the newly discovered subgraph: so-called the intersection of local-optimal triangulations by Dickerson, Montague, and Keil. An O(n3) time algorithm for finding this subgraph from a set of n points is presented.",
author = "Wang, \{Cao An\} and Francis Chin and Xu, \{Yin Feng\}",
note = "Publisher Copyright: {\textcopyright} 1996 Springer-Verlag. All rights reserved.; 7th International Symposium on Algorithms and Computation, ISAAC 1996 ; Conference date: 16-12-1996 Through 18-12-1996",
year = "1996",
language = "英语",
isbn = "3540620486",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "256--265",
editor = "Hiroshi Nagamochi and Satoru Miyano and Tetsuo Asano and Yoshihide Igarashi and Subhash Suri",
booktitle = "Algorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings",
}