Author： Prasad L. Iyengar S.S.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.140, Iss.2, 1995-04, pp. : 249-263
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
A necessary condition for a graph to be the visibility graph of a simple polygon
By Chen C.
Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. :
Access to resources
Recommend
On local transformation of polygons with visibility properties
By Hernando C. Houle M.E. Hurtado F.
Theoretical Computer Science, Vol. 289, Iss. 2, 2002-10 ,pp. :
Combinatorial algorithms for distributed graph coloring
By Barenboim Leonid Elkin Michael
Distributed Computing, Vol. 27, Iss. 2, 2014-04 ,pp. :