A P‐Completeness Result for Visibility Graphs of Simple Polygons

Mathematical Logic Quarterly 46 (3):361-375 (2000)

Abstract
For each vertex of a simple polygon P an integer valued weight is given. We consider the path p1, p2, ..., pk in P which is created according to the following strategy: p1 is a designated start vertex s and pi+1 is obtained by choosing the vertex with smallest weight among all vertices visible from pi and different from p1, p2, ..., pi. If there is no such vertex the path is finished. This path is called geometric lexicographic dead end path. We shall prove the problem of determining whether a distinguished vertex t of P is on the geometric lexicographic dead end path or not to be P-complete
Keywords Computational geometry  P‐completeness  Parallel algorithms
Categories (categorize this paper)
DOI 10.1002/1521-3870(200008)46:3<361::AID-MALQ361>3.0.CO;2-0
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 42,433
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2013-12-01

Total views
18 ( #459,956 of 2,255,388 )

Recent downloads (6 months)
3 ( #567,508 of 2,255,388 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature