Minimal link visibility paths inside a simple polygon-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Minimal link visibility paths inside a simple polygon

Published:1993-06 Issue:1 Volume:3 Page:1-25
ISSN:0925-7721
Container-title:Computational Geometry
language:en
Short-container-title:Computational Geometry

Author:

Alsuwaiyel Muhammed H.,Lee D.T.

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications

Reference19 articles.

1. Optimum watchman routes;Chin;Inform. Process. Lett.,1988

2. Watchman routes in simple polygons;Chin;Discrete Comput. Geom.,1991

3. An O(nlogn) algorithm for computing the link center of a simple polygon;Djidjev;Discrete Comput. Geom.,1992

4. A linear algorithm for computing the visibility from a point;ElGindy;J. Algorithms,1981

5. Computers and Intractability;Garey,1979

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A heuristic algorithm for straight-line embedding of a hamiltonian cycle onto a given set of points inside simple polygons;2022-10-18

2. Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons;Iranian Journal of Mathematical Sciences and Informatics;2022-09-01

3. Spanning simple path inside a simple polygon;The Journal of Supercomputing;2022-08-22

4. On approximations to minimum link visibility paths in simple polygons;International Journal of Computer Mathematics: Computer Systems Theory;2020-10-01

5. Time complexity of two disjoint simple paths;Scientia Iranica;2017-06-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP