An O(n³) Algorithm for Finding the Minimal Opaque Forest of a Convex Polygon.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/ipl/Dublish88
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/ipl/Dublish88
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Pratul_Dublish
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2F0020-0190%2888%2990122-6
>
foaf:
homepage
<
https://doi.org/10.1016/0020-0190(88)90122-6
>
dc:
identifier
DBLP journals/ipl/Dublish88
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2F0020-0190%2888%2990122-6
(xsd:string)
dcterms:
issued
1988
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/ipl
>
rdfs:
label
An O(n³) Algorithm for Finding the Minimal Opaque Forest of a Convex Polygon.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Pratul_Dublish
>
swrc:
number
5
(xsd:string)
swrc:
pages
275-276
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/ipl/Dublish88/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/ipl/Dublish88
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/ipl/ipl29.html#Dublish88
>
rdfs:
seeAlso
<
https://doi.org/10.1016/0020-0190(88)90122-6
>
dc:
title
An O(n³) Algorithm for Finding the Minimal Opaque Forest of a Convex Polygon.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
29
(xsd:string)