Author:
Ruppert Jim,Seidel Raimund
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference13 articles.
1. D. Avis and H. ElGindy. Triangulating simplicial point sets in space.Discrete Comput. Geom., 2:99–111, 1987.
2. C. L. Bajaj and T. K. Dey. Convex Decompositions of Simple Polyhedra. Technical Report CSD-TR-833, Dept. Comput. Sci., Purdue University, 1989.
3. B. Chazelle. Computational Geometry and Convexity. Ph.D. thesis, Yale University, 1980. Also available as Technical Report CMU-CS-80-150, Dept. Comput. Sci., Carnegie Mellon University, July 1980.
4. B. Chazelle. Triangulating a simple polygon in linear time. InProceedings of the 31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pages 220–230.
5. B. Chazelle and L. Palios. Triangulating a nonconvex polytope.Discrete Comput. Geom., 5:505–526, 1990.
Cited by
98 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献