Author:
Chazelle Bernard,Palios Leonidas
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. E. Arkin, R. Connelly, and J.S.B. Mitchell, “On Monotone Paths Among Obstacles, with Applications to Planning Assemblies,” Proc. 5th Annual ACM Symposium on Computational Geometry (1989), 334–343.
2. C.L. Bajaj, and T.K. Dey, “Robust Decompositions of Polyhedra,” Technical Report (1989), Dept. of Computer Science, Purdue University.
3. B.G. Baumgart, “A Polyhedron Representation for Computer Vision,” Proc. 1975 National Comput. Conference, AFIPS Conference Proceedings 44 (1975), AFIPS Press, Montvale, NJ, 589–596.
4. B. Chazelle, “Convex Partitions of Polyhedra: A Lower Bound and Worst Case Optimal Algorithm,” SIAM Journal of Computing 13 (1984), 488–507.
5. B. Chazelle, and L.J. Guibas, “Visibility and Intersection Problems in Plane Geometry,” Discrete and Computational Geometry 4 (1989), 551–581.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献