A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract).
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/compgeom/BoissonnatL96
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/compgeom/BoissonnatL96
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jean-Daniel_Boissonnat
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sylvain_Lazard
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F237218.237393
>
foaf:
homepage
<
https://doi.org/10.1145/237218.237393
>
dc:
identifier
DBLP conf/compgeom/BoissonnatL96
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F237218.237393
(xsd:string)
dcterms:
issued
1996
(xsd:gYear)
rdfs:
label
A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract).
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jean-Daniel_Boissonnat
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sylvain_Lazard
>
swrc:
pages
242-251
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/compgeom/1996
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/compgeom/BoissonnatL96/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/compgeom/BoissonnatL96
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/compgeom/compgeom96.html#BoissonnatL96
>
rdfs:
seeAlso
<
https://doi.org/10.1145/237218.237393
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/compgeom
>
dc:
title
A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract).
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document