摘要:
acm.org
elsevier.com
sci-hub.se 参考文章(17)
Christian Sohler, Markus Denny, Encoding a triangulation as a permutation of its point set. canadian conference on computational geometry. ,(1997)
Marc Noy, Ferran Hurtado, Counting triangulations of almost-convex polygons. Ars Combinatoria. ,vol. 45, ,(1997)
Gautam Das, Deborah Joseph, Which triangulations approximate the complete graph Lecture Notes in Computer Science. ,vol. 401, pp. 168- 192 ,(1989) , 10.1007/3-540-51859-2_15
G.T. Klincsek, Minimal Triangulations of Polygonal Domains Combinatorics 79. ,vol. 9, pp. 121- 123 ,(1980) , 10.1016/S0167-5060(08)70044-X
David G. Kirkpatrick, John D. Radke, A Framework for Computational Morphology Machine Intelligence and Pattern Recognition. ,vol. 2, pp. 217- 248 ,(1985) , 10.1016/B978-0-444-87806-9.50013-X
J.Mark Keil, Computing a subgraph of the minimum weight triangulation Computational Geometry: Theory and Applications. ,vol. 4, pp. 13- 26 ,(1994) , 10.1016/0925-7721(94)90014-0
Herbert Edelsbrunner, Algorithms in Combinatorial Geometry ,(1987)
David Avis, Komei Fukuda, Reverse search for enumeration Discrete Applied Mathematics. ,vol. 65, pp. 21- 46 ,(1996) , 10.1016/0166-218X(95)00026-N
F. Hurtado, M. Noy, Ears of triangulations and Catalan numbers Discrete Mathematics. ,vol. 149, pp. 319- 324 ,(1996) , 10.1016/0012-365X(94)00331-C
M. T. Dickerson, J. M. Keil, M. H. Montague, A Large Subgraph of the Minimum Weight Triangulation Discrete and Computational Geometry. ,vol. 18, pp. 289- 304 ,(1997) , 10.1007/PL00009320