<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>Triangulating topological spaces</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Herbert</namePart>
  <namePart type="family">Edelsbrunner</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">3FB178DA-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-9823-6833</description></name>
<name type="personal">
  <namePart type="given">Nimish</namePart>
  <namePart type="family">Shah</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>














<abstract lang="eng">Given a subspace X subset of or equal to R-d and a finite set S subset of or equal to R-d, we introduce the Delaunay complex, D-X, restricted by X. Its simplices are spanned by subsets T subset of or equal to S for which the common intersection of Voronoi cells meets X in a non-empty set. By the nerve theorem, boolean OR D-X and X are homotopy equivalent if all such sets are contractible. This paper proves a sufficient condition for boolean OR D-X and X be homeomorphic.</abstract>

<originInfo><publisher>World Scientific Publishing</publisher><dateIssued encoding="w3cdtf">1997</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>International Journal of Computational Geometry &amp; Applications</title></titleInfo>
  <identifier type="issn">0925-7721</identifier><identifier type="doi">10.1142/S0218195997000223</identifier>
<part><detail type="volume"><number>7</number></detail><detail type="issue"><number>4</number></detail><extent unit="pages">365 - 378</extent>
</part>
</relatedItem>

<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<chicago>Edelsbrunner, Herbert, and Nimish Shah. “Triangulating Topological Spaces.” &lt;i&gt;International Journal of Computational Geometry &amp;#38; Applications&lt;/i&gt;. World Scientific Publishing, 1997. &lt;a href=&quot;https://doi.org/10.1142/S0218195997000223&quot;&gt;https://doi.org/10.1142/S0218195997000223&lt;/a&gt;.</chicago>
<mla>Edelsbrunner, Herbert, and Nimish Shah. “Triangulating Topological Spaces.” &lt;i&gt;International Journal of Computational Geometry &amp;#38; Applications&lt;/i&gt;, vol. 7, no. 4, World Scientific Publishing, 1997, pp. 365–78, doi:&lt;a href=&quot;https://doi.org/10.1142/S0218195997000223&quot;&gt;10.1142/S0218195997000223&lt;/a&gt;.</mla>
<ieee>H. Edelsbrunner and N. Shah, “Triangulating topological spaces,” &lt;i&gt;International Journal of Computational Geometry &amp;#38; Applications&lt;/i&gt;, vol. 7, no. 4. World Scientific Publishing, pp. 365–378, 1997.</ieee>
<ista>Edelsbrunner H, Shah N. 1997. Triangulating topological spaces. International Journal of Computational Geometry &amp;#38; Applications. 7(4), 365–378.</ista>
<short>H. Edelsbrunner, N. Shah, International Journal of Computational Geometry &amp;#38; Applications 7 (1997) 365–378.</short>
<apa>Edelsbrunner, H., &amp;#38; Shah, N. (1997). Triangulating topological spaces. &lt;i&gt;International Journal of Computational Geometry &amp;#38; Applications&lt;/i&gt;. World Scientific Publishing. &lt;a href=&quot;https://doi.org/10.1142/S0218195997000223&quot;&gt;https://doi.org/10.1142/S0218195997000223&lt;/a&gt;</apa>
<ama>Edelsbrunner H, Shah N. Triangulating topological spaces. &lt;i&gt;International Journal of Computational Geometry &amp;#38; Applications&lt;/i&gt;. 1997;7(4):365-378. doi:&lt;a href=&quot;https://doi.org/10.1142/S0218195997000223&quot;&gt;10.1142/S0218195997000223&lt;/a&gt;</ama>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>4018</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-12-11T12:06:28Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2022-08-19T08:32:23Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
