| 000 | 01901nam a22004935i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-47731-0 | ||
| 003 | DE-He213 | ||
| 005 | 20160624102025.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s1987 gw | s |||| 0|eng d | ||
| 020 |
_a9783540477310 _9978-3-540-47731-0 |
||
| 024 | 7 |
_a10.1007/3-540-17629-2 _2doi |
|
| 050 | 4 | _aT385 | |
| 072 | 7 |
_aUML _2bicssc |
|
| 072 | 7 |
_aCOM012000 _2bisacsh |
|
| 082 | 0 | 4 |
_a006.6 _223 |
| 100 | 1 |
_aAkman, Varol. _eauthor. |
|
| 245 | 1 | 0 |
_aUnobstructed Shortest Paths in Polyhedral Environments _h[electronic resource] / _cby Varol Akman. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1987. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1987. |
|
| 300 |
_aX, 106 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v251 |
|
| 505 | 0 | _aSolution 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. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 0 | _aComputer simulation. | |
| 650 | 0 | _aComputer graphics. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aComputer Graphics. |
| 650 | 2 | 4 | _aSimulation and Modeling. |
| 650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540176299 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v251 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-17629-2 |
| 942 |
_2EBK6159 _cEBK |
||
| 999 |
_c35453 _d35453 |
||