The algorithm by schwartz, sharir and collins on the piano mover's problem
Identifieur interne : 002E77 ( Istex/Corpus ); précédent : 002E76; suivant : 002E78The algorithm by schwartz, sharir and collins on the piano mover's problem
Auteurs : Joël MarchandSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: A presentation of the quantifier elimination problem, and other problems connected to it, such as the "piano mover's problem", is followed by the state of the art on the question. Afterwards are explained Schwartz', Sharir's and Collins' algorithm, based on the cylindrical algebraic decomposition, and two applications to bring out its possibilities and limitations. The tracks and views of development in this research domain, which is a useful tool for algebraic geometry, are lastly indicated. Its limitation, due to a very high cost, is an actual obstacle, which is to be removed, for its use for many classes of concrete geometric and algebraic problems.
Url:
DOI: 10.1007/3-540-51683-2_24
Links to Exploration step
ISTEX:C52D5C1576A4C872C1AA53DF20E3A70DA49C77B1Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The algorithm by schwartz, sharir and collins on the piano mover's problem</title><author><name sortKey="Marchand, Joel" sort="Marchand, Joel" uniqKey="Marchand J" first="Joël" last="Marchand">Joël Marchand</name><affiliation><mods:affiliation>Laboratorie L.I.T.P. / GRECO de Calcul Formel, Université Pierre et Marie Curie Paris VI, 4 Place Jussieu, 75252, Paris Cedex 05, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: jma@frunip11.bitnet</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C52D5C1576A4C872C1AA53DF20E3A70DA49C77B1</idno><date when="1989" year="1989">1989</date><idno type="doi">10.1007/3-540-51683-2_24</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-0XNCN3SF-1/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002E77</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002E77</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The algorithm by schwartz, sharir and collins on the piano mover's problem</title><author><name sortKey="Marchand, Joel" sort="Marchand, Joel" uniqKey="Marchand J" first="Joël" last="Marchand">Joël Marchand</name><affiliation><mods:affiliation>Laboratorie L.I.T.P. / GRECO de Calcul Formel, Université Pierre et Marie Curie Paris VI, 4 Place Jussieu, 75252, Paris Cedex 05, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: jma@frunip11.bitnet</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><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></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A presentation of the quantifier elimination problem, and other problems connected to it, such as the "piano mover's problem", is followed by the state of the art on the question. Afterwards are explained Schwartz', Sharir's and Collins' algorithm, based on the cylindrical algebraic decomposition, and two applications to bring out its possibilities and limitations. The tracks and views of development in this research domain, which is a useful tool for algebraic geometry, are lastly indicated. Its limitation, due to a very high cost, is an actual obstacle, which is to be removed, for its use for many classes of concrete geometric and algebraic problems.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Joël Marchand</name><affiliations><json:string>Laboratorie L.I.T.P. / GRECO de Calcul Formel, Université Pierre et Marie Curie Paris VI, 4 Place Jussieu, 75252, Paris Cedex 05, France</json:string><json:string>E-mail: jma@frunip11.bitnet</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-0XNCN3SF-1</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><abstract>Abstract: A presentation of the quantifier elimination problem, and other problems connected to it, such as the "piano mover's problem", is followed by the state of the art on the question. Afterwards are explained Schwartz', Sharir's and Collins' algorithm, based on the cylindrical algebraic decomposition, and two applications to bring out its possibilities and limitations. The tracks and views of development in this research domain, which is a useful tool for algebraic geometry, are lastly indicated. Its limitation, due to a very high cost, is an actual obstacle, which is to be removed, for its use for many classes of concrete geometric and algebraic problems.</abstract><qualityIndicators><score>8.26</score><pdfWordCount>5153</pdfWordCount><pdfCharCount>24899</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>18</pdfPageCount><pdfPageSize>468 x 684 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>105</abstractWordCount><abstractCharCount>670</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>The algorithm by schwartz, sharir and collins on the piano mover's problem</title><chapterId><json:string>4</json:string><json:string>Chap4</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>1989</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>G. Goos</name></json:item><json:item><name>J. Hartmanis</name></json:item><json:item><name>D. Barstow</name></json:item><json:item><name>W. Brauer</name></json:item><json:item><name>P. Brinch Hansen</name></json:item><json:item><name>D. Gries</name></json:item><json:item><name>D. Luckham</name></json:item><json:item><name>C. Moler</name></json:item><json:item><name>A. Pnueli</name></json:item><json:item><name>G. Seegmüller</name></json:item><json:item><name>J. Stoer</name></json:item><json:item><name>N. Wirth</name></json:item></editor></serie><host><title>Geometry and Robotics</title><language><json:string>unknown</json:string></language><copyrightDate>1989</copyrightDate><doi><json:string>10.1007/3-540-51683-2</json:string></doi><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><eisbn><json:string>978-3-540-46748-9</json:string></eisbn><bookId><json:string>3540516832</json:string></bookId><isbn><json:string>978-3-540-51683-5</json:string></isbn><volume>391</volume><pages><first>49</first><last>66</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>J. -D. Boissonnat</name></json:item><json:item><name>J. -P. Laumond</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Computer Graphics</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Algebraic Geometry</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-0XNCN3SF-1</json:string></ark><publicationDate>1989</publicationDate><copyrightDate>1989</copyrightDate><doi><json:string>10.1007/3-540-51683-2_24</json:string></doi><id>C52D5C1576A4C872C1AA53DF20E3A70DA49C77B1</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-0XNCN3SF-1/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-0XNCN3SF-1/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-0XNCN3SF-1/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">The algorithm by schwartz, sharir and collins on the piano mover's problem</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag</licence></availability><date when="1989">1989</date></publicationStmt><notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note><note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The algorithm by schwartz, sharir and collins on the piano mover's problem</title><author><persName><forename type="first">Joël</forename><surname>Marchand</surname></persName><email>jma@frunip11.bitnet</email><affiliation><orgName type="department">Laboratorie L.I.T.P. / GRECO de Calcul Formel</orgName><orgName type="institution">Université Pierre et Marie Curie Paris VI</orgName><address><street>4 Place Jussieu</street><postCode>75252</postCode><settlement>Paris Cedex 05</settlement><country key="FR">FRANCE</country></address></affiliation></author><idno type="istex">C52D5C1576A4C872C1AA53DF20E3A70DA49C77B1</idno><idno type="ark">ark:/67375/HCB-0XNCN3SF-1</idno><idno type="DOI">10.1007/3-540-51683-2_24</idno></analytic><monogr><title level="m" type="main">Geometry and Robotics</title><title level="m" type="sub">Workshop, Toulouse, France, May 26–28, 1988 Proceedings</title><idno type="DOI">10.1007/3-540-51683-2</idno><idno type="book-id">3540516832</idno><idno type="ISBN">978-3-540-51683-5</idno><idno type="eISBN">978-3-540-46748-9</idno><idno type="chapter-id">Chap4</idno><editor><persName><forename type="first">J.</forename><forename type="first">-D.</forename><surname>Boissonnat</surname></persName></editor><editor><persName><forename type="first">J.</forename><forename type="first">-P.</forename><surname>Laumond</surname></persName></editor><imprint><biblScope unit="vol">391</biblScope><biblScope unit="page" from="49">49</biblScope><biblScope unit="page" to="66">66</biblScope><biblScope unit="chapter-count">20</biblScope></imprint></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><editor><persName><forename type="first">G.</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">J.</forename><surname>Hartmanis</surname></persName></editor><editor><persName><forename type="first">D.</forename><surname>Barstow</surname></persName></editor><editor><persName><forename type="first">W.</forename><surname>Brauer</surname></persName></editor><editor><persName><forename type="first">P.</forename><surname>Brinch Hansen</surname></persName></editor><editor><persName><forename type="first">D.</forename><surname>Gries</surname></persName></editor><editor><persName><forename type="first">D.</forename><surname>Luckham</surname></persName></editor><editor><persName><forename type="first">C.</forename><surname>Moler</surname></persName></editor><editor><persName><forename type="first">A.</forename><surname>Pnueli</surname></persName></editor><editor><persName><forename type="first">G.</forename><surname>Seegmüller</surname></persName></editor><editor><persName><forename type="first">J.</forename><surname>Stoer</surname></persName></editor><editor><persName><forename type="first">N.</forename><surname>Wirth</surname></persName></editor><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesID">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><abstract xml:lang="en"><head>Abstract</head><p>A presentation of the quantifier elimination problem, and other problems connected to it, such as the "piano mover's problem", is followed by the state of the art on the question. Afterwards are explained Schwartz', Sharir's and Collins' algorithm, based on the cylindrical algebraic decomposition, and two applications to bring out its possibilities and limitations. The tracks and views of development in this research domain, which is a useful tool for algebraic geometry, are lastly indicated. Its limitation, due to a very high cost, is an actual obstacle, which is to be removed, for its use for many classes of concrete geometric and algebraic problems.</p></abstract><textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label><item><term type="Primary">Computer Science</term></item><label>I21017</label><item><term type="Secondary" subtype="priority-1">Artificial Intelligence (incl. Robotics)</term></item><label>I22013</label><item><term type="Secondary" subtype="priority-2">Computer Graphics</term></item><label>I16021</label><item><term type="Secondary" subtype="priority-3">Algorithm Analysis and Problem Complexity</term></item><label>M11019</label><item><term type="Secondary" subtype="priority-4">Algebraic Geometry</term></item></list></keywords></textClass><langUsage><language ident="EN"></language></langUsage></profileDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-0XNCN3SF-1/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle><SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>G.</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>D.</GivenName><FamilyName>Barstow</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>W.</GivenName><FamilyName>Brauer</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>P.</GivenName><FamilyName>Brinch Hansen</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>D.</GivenName><FamilyName>Gries</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>D.</GivenName><FamilyName>Luckham</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Moler</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>A.</GivenName><FamilyName>Pnueli</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>G.</GivenName><FamilyName>Seegmüller</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><FamilyName>Stoer</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>N.</GivenName><FamilyName>Wirth</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540516832</BookID><BookTitle>Geometry and Robotics</BookTitle><BookSubTitle>Workshop, Toulouse, France, May 26–28, 1988 Proceedings</BookSubTitle><BookVolumeNumber>391</BookVolumeNumber><BookDOI>10.1007/3-540-51683-2</BookDOI><BookTitleID>24431</BookTitleID><BookPrintISBN>978-3-540-51683-5</BookPrintISBN><BookElectronicISBN>978-3-540-46748-9</BookElectronicISBN><BookChapterCount>20</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1989</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I21017" Priority="1" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I22013" Priority="2" Type="Secondary">Computer Graphics</BookSubject><BookSubject Code="I16021" Priority="3" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="M11019" Priority="4" Type="Secondary">Algebraic Geometry</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><GivenName>-D.</GivenName><FamilyName>Boissonnat</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><GivenName>-P.</GivenName><FamilyName>Laumond</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap4" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>4</ChapterID><ChapterDOI>10.1007/3-540-51683-2_24</ChapterDOI><ChapterSequenceNumber>4</ChapterSequenceNumber><ChapterTitle Language="En">The algorithm by schwartz, sharir and collins on the piano mover's problem</ChapterTitle><ChapterFirstPage>49</ChapterFirstPage><ChapterLastPage>66</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1989</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>5</Month><Day>31</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3540516832</BookID><BookTitle>Geometry and Robotics</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Joël</GivenName><FamilyName>Marchand</FamilyName></AuthorName><Contact><Email>jma@frunip11.bitnet</Email></Contact></Author><Affiliation ID="Aff1"><OrgDivision>Laboratorie L.I.T.P. / GRECO de Calcul Formel</OrgDivision><OrgName>Université Pierre et Marie Curie Paris VI</OrgName><OrgAddress><Street>4 Place Jussieu</Street><Postcode>75252</Postcode><City>Paris Cedex 05</City><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>A presentation of the quantifier elimination problem, and other problems connected to it, such as the "piano mover's problem", is followed by the state of the art on the question. Afterwards are explained Schwartz', Sharir's and Collins' algorithm, based on the cylindrical algebraic decomposition, and two applications to bring out its possibilities and limitations. The tracks and views of development in this research domain, which is a useful tool for algebraic geometry, are lastly indicated. Its limitation, due to a very high cost, is an actual obstacle, which is to be removed, for its use for many classes of concrete geometric and algebraic problems.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>The algorithm by schwartz, sharir and collins on the piano mover's problem</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>The algorithm by schwartz, sharir and collins on the piano mover's problem</title></titleInfo><name type="personal"><namePart type="given">Joël</namePart><namePart type="family">Marchand</namePart><affiliation>Laboratorie L.I.T.P. / GRECO de Calcul Formel, Université Pierre et Marie Curie Paris VI, 4 Place Jussieu, 75252, Paris Cedex 05, France</affiliation><affiliation>E-mail: jma@frunip11.bitnet</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="ReviewPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">1989</dateIssued><copyrightDate encoding="w3cdtf">1989</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: A presentation of the quantifier elimination problem, and other problems connected to it, such as the "piano mover's problem", is followed by the state of the art on the question. Afterwards are explained Schwartz', Sharir's and Collins' algorithm, based on the cylindrical algebraic decomposition, and two applications to bring out its possibilities and limitations. The tracks and views of development in this research domain, which is a useful tool for algebraic geometry, are lastly indicated. Its limitation, due to a very high cost, is an actual obstacle, which is to be removed, for its use for many classes of concrete geometric and algebraic problems.</abstract><relatedItem type="host"><titleInfo><title>Geometry and Robotics</title><subTitle>Workshop, Toulouse, France, May 26–28, 1988 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">J.</namePart><namePart type="given">-D.</namePart><namePart type="family">Boissonnat</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="given">-P.</namePart><namePart type="family">Laumond</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1989</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I22013">Computer Graphics</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="M11019">Algebraic Geometry</topic></subject><identifier type="DOI">10.1007/3-540-51683-2</identifier><identifier type="ISBN">978-3-540-51683-5</identifier><identifier type="eISBN">978-3-540-46748-9</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">24431</identifier><identifier type="BookID">3540516832</identifier><identifier type="BookChapterCount">20</identifier><identifier type="BookVolumeNumber">391</identifier><part><date>1989</date><detail type="volume"><number>391</number><caption>vol.</caption></detail><extent unit="pages"><start>49</start><end>66</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1989</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">D.</namePart><namePart type="family">Barstow</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">W.</namePart><namePart type="family">Brauer</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">P.</namePart><namePart type="family">Brinch Hansen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">D.</namePart><namePart type="family">Gries</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">D.</namePart><namePart type="family">Luckham</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Moler</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">A.</namePart><namePart type="family">Pnueli</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Seegmüller</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Stoer</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">N.</namePart><namePart type="family">Wirth</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1989</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag, 1989</recordOrigin></recordInfo></relatedItem><identifier type="istex">C52D5C1576A4C872C1AA53DF20E3A70DA49C77B1</identifier><identifier type="ark">ark:/67375/HCB-0XNCN3SF-1</identifier><identifier type="DOI">10.1007/3-540-51683-2_24</identifier><identifier type="ChapterID">4</identifier><identifier type="ChapterID">Chap4</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1989</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource><recordOrigin>Springer-Verlag, 1989</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-0XNCN3SF-1/record.json</uri></json:item></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002E77 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002E77 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:C52D5C1576A4C872C1AA53DF20E3A70DA49C77B1
|texte= The algorithm by schwartz, sharir and collins on the piano mover's problem
}}
| This area was generated with Dilib version V0.6.33. |  |