Author:
Chen Chiuyuan,Chang Ruei-Chuan
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference10 articles.
1. T. Asano, T. Asano, and Y. Ohsuga,Partitioning a polygonal region into a minimum number of triangles, The Transactions of the IECE of Japan, Vol. E 67, No. 4 (1984), pp. 232–233.
2. T. Asano, T. Asano, and R. Y. Pinter,Polygon triangulation: efficiency and minimality, Journal of Algorithms, Vol. 7, No. 2 (1986), pp. 221–231.
3. B. M. Chazelle,A theorem for polygon cutting with applications, Proceedings of the 23rd IEEE Annual Symposium on the Foundations of Computer Science (1983), pp. 339–349.
4. B. M. Chazelle and L. J. Guibas,Visibility and intersection problems in plane geometry, Discrete Computational Geometry, Vol. 4, No. 6 (1989), pp. 551–581.
5. A. Fournier and D. Y. Montuno,Triangulating simple polygons and equivalent problems, ACM Transactions on Graphics, Vol. 3, No. 2 (1984), pp. 153–174.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Software algorithm and route planning;Selective Laser Sintering Additive Manufacturing Technology;2021
2. Beyond Triangulation: Covering Polygons with Triangles;Lecture Notes in Computer Science;2011
3. MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN;International Journal of Computational Geometry & Applications;1999-12
4. On convex partitions of polygonal regions;Discrete Mathematics;1999-01
5. Minimum Convex Partitions of Polygonal Domains;Geometric Methods and Optimization Problems;1999