Computational geometry for the gourmet old fare and new dishes
Identifieur interne : 001217 ( Istex/Corpus ); précédent : 001216; suivant : 001218Computational geometry for the gourmet old fare and new dishes
Auteurs : Bernard ChazelleSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1991.
English descriptors
- Teeft :
- Algorithm, Binary searches, Chazelle, Clarkson, Comp, Comput, Computational, Computational geometry, Computer graphics, Computer science, Convex, Convex hull, Convex hulls, Current understanding, Data structures, Dynamic point location, Efficient solutions, Fractional, Geom, Ieee, Ieee symp, Ieee syrup, Line segments, Linear programming, Linear time, Lower bounds, Maximum size, Open problem, Optimal algorithm, Orlhogonal range, Planar, Planar partition algorithm, Planar subdivision, Point location, Polygon, Polygonal curves, Preparata, Proc, Proe, Query, Random permutation, Random sampling, Regular cell, Restrictive assumption, Seidel, Sharir, Simple polygon, Stratification scheme, Surface removal, Symbolic comput, Symp, Triangulating, Visible scene.
Abstract
Abstract: It is time to bring this quick overview to a close. There are many interesting problems that I have not touched upon here but which deserve intense scrutiny nevertheless. Some concern important combinatorial issues in discrete geometry, such as zone theorems, and the maximum size of k-sets. Others address the practical aspects of implementing and debugging geometric algorithms, and in particular, robustness in the face of round-off errors.
Url:
DOI: 10.1007/3-540-54233-7_174
Links to Exploration step
ISTEX:AD5287C06ABB2C114BCE963E9CA597D2F49A463FLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Computational geometry for the gourmet old fare and new dishes</title><author><name sortKey="Chazelle, Bernard" sort="Chazelle, Bernard" uniqKey="Chazelle B" first="Bernard" last="Chazelle">Bernard Chazelle</name><affiliation><mods:affiliation>Department of Computer Science, Princeton University, 08544, Princeton, NJ</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:AD5287C06ABB2C114BCE963E9CA597D2F49A463F</idno><date when="1991" year="1991">1991</date><idno type="doi">10.1007/3-540-54233-7_174</idno><idno type="url">https://api.istex.fr/document/AD5287C06ABB2C114BCE963E9CA597D2F49A463F/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001217</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001217</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Computational geometry for the gourmet old fare and new dishes</title><author><name sortKey="Chazelle, Bernard" sort="Chazelle, Bernard" uniqKey="Chazelle B" first="Bernard" last="Chazelle">Bernard Chazelle</name><affiliation><mods:affiliation>Department of Computer Science, Princeton University, 08544, Princeton, NJ</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1991</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>Algorithm</term><term>Binary searches</term><term>Chazelle</term><term>Clarkson</term><term>Comp</term><term>Comput</term><term>Computational</term><term>Computational geometry</term><term>Computer graphics</term><term>Computer science</term><term>Convex</term><term>Convex hull</term><term>Convex hulls</term><term>Current understanding</term><term>Data structures</term><term>Dynamic point location</term><term>Efficient solutions</term><term>Fractional</term><term>Geom</term><term>Ieee</term><term>Ieee symp</term><term>Ieee syrup</term><term>Line segments</term><term>Linear programming</term><term>Linear time</term><term>Lower bounds</term><term>Maximum size</term><term>Open problem</term><term>Optimal algorithm</term><term>Orlhogonal range</term><term>Planar</term><term>Planar partition algorithm</term><term>Planar subdivision</term><term>Point location</term><term>Polygon</term><term>Polygonal curves</term><term>Preparata</term><term>Proc</term><term>Proe</term><term>Query</term><term>Random permutation</term><term>Random sampling</term><term>Regular cell</term><term>Restrictive assumption</term><term>Seidel</term><term>Sharir</term><term>Simple polygon</term><term>Stratification scheme</term><term>Surface removal</term><term>Symbolic comput</term><term>Symp</term><term>Triangulating</term><term>Visible scene</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: It is time to bring this quick overview to a close. There are many interesting problems that I have not touched upon here but which deserve intense scrutiny nevertheless. Some concern important combinatorial issues in discrete geometry, such as zone theorems, and the maximum size of k-sets. Others address the practical aspects of implementing and debugging geometric algorithms, and in particular, robustness in the face of round-off errors.</div></front></TEI><istex><corpusName>springer</corpusName><keywords><teeft><json:string>comput</json:string><json:string>geom</json:string><json:string>algorithm</json:string><json:string>proc</json:string><json:string>symp</json:string><json:string>proe</json:string><json:string>lower bounds</json:string><json:string>ieee</json:string><json:string>polygon</json:string><json:string>sharir</json:string><json:string>triangulating</json:string><json:string>comp</json:string><json:string>clarkson</json:string><json:string>convex</json:string><json:string>preparata</json:string><json:string>surface removal</json:string><json:string>simple polygon</json:string><json:string>chazelle</json:string><json:string>computational geometry</json:string><json:string>point location</json:string><json:string>ieee symp</json:string><json:string>random sampling</json:string><json:string>query</json:string><json:string>convex hull</json:string><json:string>ieee syrup</json:string><json:string>fractional</json:string><json:string>computational</json:string><json:string>computer science</json:string><json:string>polygonal curves</json:string><json:string>visible scene</json:string><json:string>linear time</json:string><json:string>line segments</json:string><json:string>data structures</json:string><json:string>dynamic point location</json:string><json:string>regular cell</json:string><json:string>seidel</json:string><json:string>binary searches</json:string><json:string>maximum size</json:string><json:string>random permutation</json:string><json:string>linear programming</json:string><json:string>restrictive assumption</json:string><json:string>optimal algorithm</json:string><json:string>computer graphics</json:string><json:string>convex hulls</json:string><json:string>stratification scheme</json:string><json:string>efficient solutions</json:string><json:string>planar subdivision</json:string><json:string>symbolic comput</json:string><json:string>current understanding</json:string><json:string>orlhogonal range</json:string><json:string>open problem</json:string><json:string>planar partition algorithm</json:string><json:string>planar</json:string></teeft></keywords><author><json:item><name>Bernard Chazelle</name><affiliations><json:string>Department of Computer Science, Princeton University, 08544, Princeton, NJ</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><abstract>Abstract: It is time to bring this quick overview to a close. There are many interesting problems that I have not touched upon here but which deserve intense scrutiny nevertheless. Some concern important combinatorial issues in discrete geometry, such as zone theorems, and the maximum size of k-sets. Others address the practical aspects of implementing and debugging geometric algorithms, and in particular, robustness in the face of round-off errors.</abstract><qualityIndicators><score>5.267</score><pdfWordCount>4439</pdfWordCount><pdfCharCount>25171</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>11</pdfPageCount><pdfPageSize>468 x 684 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>69</abstractWordCount><abstractCharCount>453</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Computational geometry for the gourmet old fare and new dishes</title><chapterId><json:string>54</json:string><json:string>Chap54</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>1991</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>Gerhard Goos</name></json:item><json:item><name>Juris Hartmanis</name></json:item></editor></serie><host><title>Automata, Languages and Programming</title><language><json:string>unknown</json:string></language><copyrightDate>1991</copyrightDate><doi><json:string>10.1007/3-540-54233-7</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-47516-3</json:string></eisbn><bookId><json:string>3540542337</json:string></bookId><isbn><json:string>978-3-540-54233-9</json:string></isbn><volume>510</volume><pages><first>686</first><last>696</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Javier Leach Albert</name></json:item><json:item><name>Burkhard Monien</name></json:item><json:item><name>Mario Rodríguez Artalejo</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Data Structures</value></json:item><json:item><value>Combinatorics</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Computer Graphics</value></json:item></subject></host><categories><inist><json:string>sciences appliquees, technologies et medecines</json:string><json:string>sciences exactes et technologie</json:string><json:string>sciences et techniques communes</json:string><json:string>sciences de l'information. documentation</json:string></inist></categories><publicationDate>2005</publicationDate><copyrightDate>1991</copyrightDate><doi><json:string>10.1007/3-540-54233-7_174</json:string></doi><id>AD5287C06ABB2C114BCE963E9CA597D2F49A463F</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/AD5287C06ABB2C114BCE963E9CA597D2F49A463F/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/AD5287C06ABB2C114BCE963E9CA597D2F49A463F/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/AD5287C06ABB2C114BCE963E9CA597D2F49A463F/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Computational geometry for the gourmet old fare and new dishes</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag, 1991</p></availability><date>1991</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Computational geometry for the gourmet old fare and new dishes</title><author xml:id="author-0000"><persName><forename type="first">Bernard</forename><surname>Chazelle</surname></persName><affiliation>Department of Computer Science, Princeton University, 08544, Princeton, NJ</affiliation></author><idno type="istex">AD5287C06ABB2C114BCE963E9CA597D2F49A463F</idno><idno type="DOI">10.1007/3-540-54233-7_174</idno><idno type="ChapterID">54</idno><idno type="ChapterID">Chap54</idno></analytic><monogr><title level="m">Automata, Languages and Programming</title><title level="m" type="sub">18th International Colloquium Madrid, Spain, July 8–12, 1991 Proceedings</title><idno type="DOI">10.1007/3-540-54233-7</idno><idno type="pISBN">978-3-540-54233-9</idno><idno type="eISBN">978-3-540-47516-3</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="book-title-ID">27795</idno><idno type="book-ID">3540542337</idno><idno type="book-chapter-count">60</idno><idno type="book-volume-number">510</idno><editor xml:id="book-author-0000"><persName><forename type="first">Javier</forename><forename type="first">Leach</forename><surname>Albert</surname></persName></editor><editor xml:id="book-author-0001"><persName><forename type="first">Burkhard</forename><surname>Monien</surname></persName></editor><editor xml:id="book-author-0002"><persName><forename type="first">Mario</forename><forename type="first">Rodríguez</forename><surname>Artalejo</surname></persName></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2005-06-08"></date><biblScope unit="volume">510</biblScope><biblScope unit="page" from="686">686</biblScope><biblScope unit="page" to="696">696</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor xml:id="serie-author-0000"><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName></editor><editor xml:id="serie-author-0001"><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName></editor><biblScope><date>1991</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1991</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: It is time to bring this quick overview to a close. There are many interesting problems that I have not touched upon here but which deserve intense scrutiny nevertheless. Some concern important combinatorial issues in discrete geometry, such as zone theorems, and the maximum size of k-sets. Others address the practical aspects of implementing and debugging geometric algorithms, and in particular, robustness in the face of round-off errors.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><item><term>Computer Science</term></item><label>I16048</label><item><term>Mathematical Logic and Formal Languages</term></item><label>I15017</label><item><term>Data Structures</term></item><label>M17009</label><item><term>Combinatorics</term></item><label>I16021</label><item><term>Algorithm Analysis and Problem Complexity</term></item><label>I21017</label><item><term>Artificial Intelligence (incl. Robotics)</term></item><label>I22013</label><item><term>Computer Graphics</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2005-06-08">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/AD5287C06ABB2C114BCE963E9CA597D2F49A463F/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher 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>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540542337</BookID><BookTitle>Automata, Languages and Programming</BookTitle><BookSubTitle>18th International Colloquium Madrid, Spain, July 8–12, 1991 Proceedings</BookSubTitle><BookVolumeNumber>510</BookVolumeNumber><BookDOI>10.1007/3-540-54233-7</BookDOI><BookTitleID>27795</BookTitleID><BookPrintISBN>978-3-540-54233-9</BookPrintISBN><BookElectronicISBN>978-3-540-47516-3</BookElectronicISBN><BookChapterCount>60</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1991</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16048" Priority="1" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I15017" Priority="2" Type="Secondary">Data Structures</BookSubject><BookSubject Code="M17009" Priority="3" Type="Secondary">Combinatorics</BookSubject><BookSubject Code="I16021" Priority="4" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="I21017" Priority="5" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I22013" Priority="6" Type="Secondary">Computer Graphics</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Javier</GivenName><GivenName>Leach</GivenName><FamilyName>Albert</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Burkhard</GivenName><FamilyName>Monien</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Mario</GivenName><GivenName>Rodríguez</GivenName><FamilyName>Artalejo</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap54" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>54</ChapterID><ChapterDOI>10.1007/3-540-54233-7_174</ChapterDOI><ChapterSequenceNumber>54</ChapterSequenceNumber><ChapterTitle Language="En">Computational geometry for the gourmet old fare and new dishes</ChapterTitle><ChapterCategory>Complexity And Computational Geometry (Session 17)</ChapterCategory><ChapterFirstPage>686</ChapterFirstPage><ChapterLastPage>696</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1991</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>6</Month><Day>8</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>3540542337</BookID><BookTitle>Automata, Languages and Programming</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Bernard</GivenName><FamilyName>Chazelle</FamilyName></AuthorName></Author><Affiliation ID="Aff1"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>Princeton University</OrgName><OrgAddress><Postcode>08544</Postcode><City>Princeton</City><State>NJ</State></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>It is time to bring this quick overview to a close. There are many interesting problems that I have not touched upon here but which deserve intense scrutiny nevertheless. Some concern important combinatorial issues in discrete geometry, such as zone theorems, and the maximum size of <Emphasis Type="Italic">k</Emphasis>-sets. Others address the practical aspects of implementing and debugging geometric algorithms, and in particular, robustness in the face of round-off errors.</Para></Abstract><ArticleNote Type="Misc"><SimplePara>(Invited Paper)</SimplePara></ArticleNote></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Computational geometry for the gourmet old fare and new dishes</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Computational geometry for the gourmet old fare and new dishes</title></titleInfo><name type="personal"><namePart type="given">Bernard</namePart><namePart type="family">Chazelle</namePart><affiliation>Department of Computer Science, Princeton University, 08544, Princeton, NJ</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="ReviewPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2005-06-08</dateIssued><copyrightDate encoding="w3cdtf">1991</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: It is time to bring this quick overview to a close. There are many interesting problems that I have not touched upon here but which deserve intense scrutiny nevertheless. Some concern important combinatorial issues in discrete geometry, such as zone theorems, and the maximum size of k-sets. Others address the practical aspects of implementing and debugging geometric algorithms, and in particular, robustness in the face of round-off errors.</abstract><relatedItem type="host"><titleInfo><title>Automata, Languages and Programming</title><subTitle>18th International Colloquium Madrid, Spain, July 8–12, 1991 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Javier</namePart><namePart type="given">Leach</namePart><namePart type="family">Albert</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Burkhard</namePart><namePart type="family">Monien</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Mario</namePart><namePart type="given">Rodríguez</namePart><namePart type="family">Artalejo</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">1991</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="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I15017">Data Structures</topic><topic authority="SpringerSubjectCodes" authorityURI="M17009">Combinatorics</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I22013">Computer Graphics</topic></subject><identifier type="DOI">10.1007/3-540-54233-7</identifier><identifier type="ISBN">978-3-540-54233-9</identifier><identifier type="eISBN">978-3-540-47516-3</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">27795</identifier><identifier type="BookID">3540542337</identifier><identifier type="BookChapterCount">60</identifier><identifier type="BookVolumeNumber">510</identifier><part><date>1991</date><detail type="volume"><number>510</number><caption>vol.</caption></detail><extent unit="pages"><start>686</start><end>696</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1991</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">1991</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, 1991</recordOrigin></recordInfo></relatedItem><identifier type="istex">AD5287C06ABB2C114BCE963E9CA597D2F49A463F</identifier><identifier type="DOI">10.1007/3-540-54233-7_174</identifier><identifier type="ChapterID">54</identifier><identifier type="ChapterID">Chap54</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1991</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag, 1991</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001217 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001217 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:AD5287C06ABB2C114BCE963E9CA597D2F49A463F
|texte= Computational geometry for the gourmet old fare and new dishes
}}
| This area was generated with Dilib version V0.6.33. |  |