Author:
Chassery Jean-Marc,Coeurjolly David
Reference12 articles.
1. A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor. A linear time algorithm for computing the Voronoi diagram of a convex polygon. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 39–45, New York City, 25–27 May 1987.
2. C. Andjar, C. Saona-Vzquez, and I. Navazo. LOD visibility culling and occluder synthesis. Computer Aided Design, 32(13):773–783, November 2000.
3. J. S. Chang and C. K. Yap. A polynomial solution for the potato-peeling problem. Discrete & Computational Geometry, 1:155–182, 1986.
4. J.M. Chassery. Discrete and computational geometry approaches applied to a problem of figure approximation. In Proc. 6th Scandinzvian Conf. on Image Analysis (SCIA 89), pages 856–859, Oulu City, 19–22 june 1989.
5. K. Daniels, V. Milenkovic, and D. yRoth. Finding the largest area axis-parallel rectangle in a polygon. Computational Geometry: Theory and Applications, 7:125–148, 1997.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献