AI helps you reading Science
Fast Detection of Polyhedral Intersections
Theor. Comput. Sci., no. 3 (1985): 154-165
EI
Keywords
Abstract
Methods are given for unifying and extending previous work on detecting polyhedral intersections. The technique of dynamic (vs. static) description is introduced and used to extend previous results. New upper bounds of O(log n) and O(log2n) are given on plane-polyhedron and polyhedron-polyhedron intersection problems.
Code:
Data:
Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn