An Approximate Algorithm for Solving the Watchman Route Problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/robvis/LiK08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/robvis/LiK08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Fajie_Li
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Reinhard_Klette
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-78157-8%5F15
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-540-78157-8_15
>
dc:
identifier
DBLP conf/robvis/LiK08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-540-78157-8%5F15
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
rdfs:
label
An Approximate Algorithm for Solving the Watchman Route Problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Fajie_Li
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Reinhard_Klette
>
swrc:
pages
189-206
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/robvis/2008
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/robvis/LiK08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/robvis/LiK08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/robvis/robvis2008.html#LiK08
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-540-78157-8_15
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/robvis
>
dc:
subject
computational geometry; simple polygon; Euclidean shortest path; visual inspection; Watchman Route Problem; rubberband algorithm
(xsd:string)
dc:
title
An Approximate Algorithm for Solving the Watchman Route Problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document