SHORTEST PATHS WITH SINGLE-POINT VISIBILITY CONSTRAINT

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

KHOSRAVI R.; GHODSI M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: SCIENTIA IRANICA Year:2006 | Volume:13 | Issue:1 Page(s): 25-32

Download Full-Text

View:

313

Download:

113

Cites:

Information Journal Paper

Title

SHORTEST PATHS WITH SINGLE-POINT VISIBILITY CONSTRAINT

Author(s)

KHOSRAVI R. | GHODSI M. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

In this paper, the problem of finding the shortest path between two points in the presence of single-point visibility constraints is studied. In these types of constraint, there should be at least one point on the output path from which a fixed viewpoint is visible. The problem is studied in various domains, including simple polygons, polygonal domains and polyhedral surfaces. The method is based on partitioning the boundary of the visibility region of the viewpoint into a number of intervals. This is done from the combinatorial structure of the shortest paths from the source and destination to the points on the boundary. The result for the case of simple polygons is optimal with O(n) time bound. The running time for the cases of polygonal domains and convex and non-convex polyhedral surfaces are O(n2), O(n2) and O(n3), respectively.

Cites

No record.

References

No record.

Cite

APA: Copy

KHOSRAVI, R., & GHODSI, M.. (2006). SHORTEST PATHS WITH SINGLE-POINT VISIBILITY CONSTRAINT. SCIENTIA IRANICA, 13(1), 25-32. SID. https://sid.ir/paper/289319/en

Vancouver: Copy

KHOSRAVI R., GHODSI M.. SHORTEST PATHS WITH SINGLE-POINT VISIBILITY CONSTRAINT. SCIENTIA IRANICA[Internet]. 2006;13(1):25-32. Available from: https://sid.ir/paper/289319/en

IEEE: Copy

R. KHOSRAVI, and M. GHODSI, “SHORTEST PATHS WITH SINGLE-POINT VISIBILITY CONSTRAINT,” SCIENTIA IRANICA, vol. 13, no. 1, pp. 25–32, 2006, [Online]. Available: https://sid.ir/paper/289319/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops