Conclusion and future work
Identifieur interne : 001392 ( Main/Merge ); précédent : 001391; suivant : 001393Conclusion and future work
Auteurs : Varol AkmanSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1987.
English descriptors
- Teeft :
- Akman, Algebraic, Algebraic geometry, Algebraic methods, Algorithm, April, Artificial intelligence, August, Boundary findpath, Collision detection, Computational, Computational geometry, Computer graphics, Computer science, Computer science dept, Computer science division, Convex, Convex polygonal obstacles, Convex polyhedron, Cornell university, Data structures, Distance paths, Efficient algorithm, Euclidean, Euclidean space, Execution time, Fachbereich angewandte mathematik, February, Findpath, Findpath problem, Free space, Future work, Generalized voronoi diagrams, Geometric modeling, Goal points, Hopcroft, Ieee, Ieee transactions, Information processing letters, International journal, Invariant distribution, July, June, Lecture notes, Many obstacles, Markov, Markov chain, Massachusetts institute, Mathematical sciences, Mcgill university, Metropolis procedure, Motion planning, October, Operations research dept, Optimal line visit, Papadimitriou, Piano problem, Planar, Planar subdivision, Polygonal, Polygonal barriers, Polygonal obstacles, Polyhedral, Polyhedral obstacles, Polyhedral spaces, Polyhedron, Polynomial equations, Preliminary version, Proc, Purdue university, Rensselaer polytechnic institute, Robot, Robotics, Robotics research, Salesman problem, Sharir, Shortest, Shortest path, Shortest paths, Siam, Siam conf, Siam journal, Siam review, Single nonconvex polyhedron, Slam journal, Sofa problem, Stanford, Stanford university, System sciences, Theoretical computer science, Transition matrix, Voronoi, Voronoi diagrams, West lafayette, Workspace complexity, York university.
Url:
DOI: 10.1007/3-540-17629-2_12
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000666
- to stream Istex, to step Curation: 000634
- to stream Istex, to step Checkpoint: 001159
Links to Exploration step
ISTEX:3FCFF0A849FCBF2D36F143AA731CB45FD518166ALe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Conclusion and future work</title><author wicri:is="90%"><name sortKey="Akman, Varol" sort="Akman, Varol" uniqKey="Akman V" first="Varol" last="Akman">Varol Akman</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:3FCFF0A849FCBF2D36F143AA731CB45FD518166A</idno><date when="1987" year="1987">1987</date><idno type="doi">10.1007/3-540-17629-2_12</idno><idno type="url">https://api.istex.fr/document/3FCFF0A849FCBF2D36F143AA731CB45FD518166A/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000666</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000666</idno><idno type="wicri:Area/Istex/Curation">000634</idno><idno type="wicri:Area/Istex/Checkpoint">001159</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001159</idno><idno type="wicri:doubleKey">0302-9743:1987:Akman V:conclusion:and:future</idno><idno type="wicri:Area/Main/Merge">001392</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Conclusion and future work</title><author wicri:is="90%"><name sortKey="Akman, Varol" sort="Akman, Varol" uniqKey="Akman V" first="Varol" last="Akman">Varol Akman</name></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1987</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Akman</term><term>Algebraic</term><term>Algebraic geometry</term><term>Algebraic methods</term><term>Algorithm</term><term>April</term><term>Artificial intelligence</term><term>August</term><term>Boundary findpath</term><term>Collision detection</term><term>Computational</term><term>Computational geometry</term><term>Computer graphics</term><term>Computer science</term><term>Computer science dept</term><term>Computer science division</term><term>Convex</term><term>Convex polygonal obstacles</term><term>Convex polyhedron</term><term>Cornell university</term><term>Data structures</term><term>Distance paths</term><term>Efficient algorithm</term><term>Euclidean</term><term>Euclidean space</term><term>Execution time</term><term>Fachbereich angewandte mathematik</term><term>February</term><term>Findpath</term><term>Findpath problem</term><term>Free space</term><term>Future work</term><term>Generalized voronoi diagrams</term><term>Geometric modeling</term><term>Goal points</term><term>Hopcroft</term><term>Ieee</term><term>Ieee transactions</term><term>Information processing letters</term><term>International journal</term><term>Invariant distribution</term><term>July</term><term>June</term><term>Lecture notes</term><term>Many obstacles</term><term>Markov</term><term>Markov chain</term><term>Massachusetts institute</term><term>Mathematical sciences</term><term>Mcgill university</term><term>Metropolis procedure</term><term>Motion planning</term><term>October</term><term>Operations research dept</term><term>Optimal line visit</term><term>Papadimitriou</term><term>Piano problem</term><term>Planar</term><term>Planar subdivision</term><term>Polygonal</term><term>Polygonal barriers</term><term>Polygonal obstacles</term><term>Polyhedral</term><term>Polyhedral obstacles</term><term>Polyhedral spaces</term><term>Polyhedron</term><term>Polynomial equations</term><term>Preliminary version</term><term>Proc</term><term>Purdue university</term><term>Rensselaer polytechnic institute</term><term>Robot</term><term>Robotics</term><term>Robotics research</term><term>Salesman problem</term><term>Sharir</term><term>Shortest</term><term>Shortest path</term><term>Shortest paths</term><term>Siam</term><term>Siam conf</term><term>Siam journal</term><term>Siam review</term><term>Single nonconvex polyhedron</term><term>Slam journal</term><term>Sofa problem</term><term>Stanford</term><term>Stanford university</term><term>System sciences</term><term>Theoretical computer science</term><term>Transition matrix</term><term>Voronoi</term><term>Voronoi diagrams</term><term>West lafayette</term><term>Workspace complexity</term><term>York university</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001392 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 001392 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:3FCFF0A849FCBF2D36F143AA731CB45FD518166A
|texte= Conclusion and future work
}}
| This area was generated with Dilib version V0.6.33. |  |