AI帮你理解科学
The path of a triangulation
Symposium on Computational Geometry 2013, pp.14-23, (1999)
EI
摘要
For a planar point set S let T be a triangulationof S and l a line properly intersecting T . We showthat there always exists a unique path in T withcertain properties with respect to l. This path isthen generalized to (non triangulated) point setsrestricted to the interior of simple polygons. Thisso-called triangulation path enables us t...更多
代码:
数据:
标签
评论
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn