Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference26 articles.
1. T. M. Chan. Output-sensitive results on convex hulls, extreme points, and related problems.Discrete Comput. Geom., this issue, pp. 369–387.
2. T. M. Chan, J. Snoeyink, and C.-K. Yap. Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three.Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, pp. 282–291, 1995.
3. D. R. Chand and S. S. Kapur. An algorithm for convex polytopes.J. Assoc. Comput. Mach., 17:78–86, 1970.
4. B. Chazelle. An optimal algorithm for intersecting three-dimensional convex polyhedra.SIAM J. Comput., 21:671–696, 1992.
5. B. Chazelle and D. P. Dobkin. Intersection of convex objects in two and three dimensions.J. Assoc. Comput. Mach., 34:1–27, 1987.
Cited by
188 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献