首页 /研究 /Finding an approximate minimum-link visibility path inside a simple polygon
OTHER

Finding an approximate minimum-link visibility path inside a simple polygon

Muhammad H. Alsuwaiyel, D.T Lee

发表年份
1995
引用次数
24

关键词

Simple polygonVisibility polygonVisibilityPolygon (computer graphics)Path (computing)Simple (philosophy)Link (geometry)Computer scienceMathematicsCombinatorics

相关论文

查看 OTHER 分类全部论文