skip to content
Unobstructed shortest paths in polyhedral environments Preview this item
ClosePreview this item
Checking...

Unobstructed shortest paths in polyhedral environments

Author: Varol Akman
Publisher: Berlin ; New York : Springer-Verlag, ©1987.
Series: Lecture notes in computer science, 251.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Summary:

Presents algebraic and geometric algorithms to deal with a specific problem, which frequently occurs in model-based robotics systems and is of utmost importance in calibrating the complexity of  Read more...

Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Additional Physical Format: Print version:
Akman, Varol.
Unobstructed shortest paths in polyhedral environments.
Berlin ; New York : Springer-Verlag, ©1987
(DLC) 87004693
(OCoLC)15316298
Print version:
Akman, Varol.
Unobstructed shortest paths in polyhedral environments.
Berlin ; New York : Springer-Verlag, ©1987
(OCoLC)871481930
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Varol Akman
ISBN: 9783540477310 3540477314
OCLC Number: 571816935
Reproduction Notes: Electronic reproduction. [S.l.] : HathiTrust Digital Library, 2010. MiAaHDL
Description: 1 online resource (103 pages) : illustrations.
Details: Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
Contents: Solution of the general instance of FINDPATH.- Solutions of two specific instances of FINDPATH.- Two Voronoi-based techniques for FINDPATH.- Desirable functionalities of a geometer's workbench.- Conclusion and future work.
Series Title: Lecture notes in computer science, 251.
Responsibility: Varol Akman.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/571816935> # Unobstructed shortest paths in polyhedral environments
    a schema:MediaObject, schema:CreativeWork, schema:Book ;
   library:oclcnum "571816935" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
   schema:about <http://id.worldcat.org/fast/1070519> ; # Polyhedral functions
   schema:about <http://id.worldcat.org/fast/805020> ; # Algorithms
   schema:about <http://id.worldcat.org/fast/1098997> ; # Robotics
   schema:about <http://experiment.worldcat.org/entity/work/data/10098948#Topic/polyeder> ; # Polyeder
   schema:about <http://dewey.info/class/629.892/e19/> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/10098948#Topic/algorithmes> ; # Algorithmes
   schema:about <http://experiment.worldcat.org/entity/work/data/10098948#Topic/kurzester_weg_problem> ; # Kürzester-Weg-Problem
   schema:about <http://experiment.worldcat.org/entity/work/data/10098948#Topic/robotique> ; # Robotique
   schema:bookFormat schema:EBook ;
   schema:creator <http://viaf.org/viaf/8007183> ; # Varol Akman
   schema:datePublished "1987" ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/10098948> ;
   schema:genre "Electronic books"@en ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/10098948#Series/lecture_notes_in_computer_science> ; # Lecture notes in computer science ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/15316298> ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/871481930> ;
   schema:name "Unobstructed shortest paths in polyhedral environments"@en ;
   schema:productID "571816935" ;
   schema:url <http://link.springer.com/10.1007/3-540-17629-2> ;
   schema:url <http://dx.doi.org/10.1007/3-540-17629-2> ;
   schema:url <http://catalog.hathitrust.org/api/volumes/oclc/15316298.html> ;
   schema:url <http://books.google.com/books?id=qTBSAAAAMAAJ> ;
   schema:url <http://books.google.com/books?id=-pCFAAAAIAAJ> ;
   schema:workExample <http://worldcat.org/isbn/9783540477310> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/571816935> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/10098948#Series/lecture_notes_in_computer_science> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/571816935> ; # Unobstructed shortest paths in polyhedral environments
   schema:name "Lecture notes in computer science ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/10098948#Topic/kurzester_weg_problem> # Kürzester-Weg-Problem
    a schema:Intangible ;
   schema:name "Kürzester-Weg-Problem"@en ;
    .

<http://id.worldcat.org/fast/1070519> # Polyhedral functions
    a schema:Intangible ;
   schema:name "Polyhedral functions"@en ;
    .

<http://id.worldcat.org/fast/1098997> # Robotics
    a schema:Intangible ;
   schema:name "Robotics"@en ;
    .

<http://id.worldcat.org/fast/805020> # Algorithms
    a schema:Intangible ;
   schema:name "Algorithms"@en ;
    .

<http://viaf.org/viaf/8007183> # Varol Akman
    a schema:Person ;
   schema:familyName "Akman" ;
   schema:givenName "Varol" ;
   schema:name "Varol Akman" ;
    .

<http://worldcat.org/isbn/9783540477310>
    a schema:ProductModel ;
   schema:isbn "3540477314" ;
   schema:isbn "9783540477310" ;
    .

<http://www.worldcat.org/oclc/15316298>
    a schema:CreativeWork ;
   rdfs:label "Unobstructed shortest paths in polyhedral environments." ;
   schema:description "Print version:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/571816935> ; # Unobstructed shortest paths in polyhedral environments
    .

<http://www.worldcat.org/oclc/871481930>
    a schema:CreativeWork ;
   rdfs:label "Unobstructed shortest paths in polyhedral environments." ;
   schema:description "Print version:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/571816935> ; # Unobstructed shortest paths in polyhedral environments
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.