Author:
Chazelle Bernard,Palios Leonidas
Reference44 articles.
1. T. Asano, and T. Asano, Partitioning Polygonal Regions into Trapezoids, Proc. 24th Annual IEEE Symposium on Foundations of Computer Science (1983), 233–241.
2. T. Asano, T. Asano, and H. Imai, Partitioning a Polygonal Region into Trapezoids, Journal of the ACM 33 (1986), 290–312.
3. C. L. Bajaj, and T. K. Dey, Convex Decompositions of Polyhedra and Robustness,SIAM Journal on Computing 21 (1992), 339–364.
4. J. L. Bentley, and T. Ottmann, Algorithms for Reporting and Counting Geometric Intersections, IEEE Transactions on Computing C-28 (1979), 643–647.
5. K. Q. Brown, Comments on “Algorithms for Reporting and Counting Geometric Intersections,”IEEE Transactions on Computing C30 (1981), 147–148.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Minimum Star Partitions of Simple Polygons in Polynomial Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Covering Polygons is Even Harder;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
3. SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition;International Journal of Computational Geometry & Applications;2021-12
4. AN ALTERNATIVE DECOMPOSITION OF CATALAN NUMBER;Facta Universitatis, Series: Mathematics and Informatics;2018-04-15
5. Part-Based Mesh Segmentation: A Survey;Computer Graphics Forum;2018-02-01