[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/jacm/AtallahCW91>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Danny_Z._Chen>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Hubert_Wagener>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Mikhail_J._Atallah>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1145%2F116825.116827>
foaf:homepage <https://doi.org/10.1145/116825.116827>
dc:identifier DBLP journals/jacm/AtallahCW91 (xsd:string)
dc:identifier DOI doi.org%2F10.1145%2F116825.116827 (xsd:string)
dcterms:issued 1991 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/jacm>
rdfs:label An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Danny_Z._Chen>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Hubert_Wagener>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Mikhail_J._Atallah>
swrc:number 3 (xsd:string)
swrc:pages 516-533 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/jacm/AtallahCW91/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/jacm/AtallahCW91>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/jacm/jacm38.html#AtallahCW91>
rdfs:seeAlso <https://doi.org/10.1145/116825.116827>
dc:subject computational geometry, intersections of polygonal chains, parallel computational complexity, simple polygons, visible regions (xsd:string)
dc:title An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 38 (xsd:string)