<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-20T19:15:59Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/20105" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/20105</identifier>
        <datestamp>2023-07-10</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_10755</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Edelsbrunner, Herbert</dc:contributor>
          <dc:creator>Shah, Nimish Rameshbhai</dc:creator>
          <dc:date>2011-05-07T12:28:56Z</dc:date>
          <dc:date>2011-05-07T12:28:56Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>1994</dc:date>
          <dc:description>Simplicial complexes are useful for modeling shape of a discrete geometric domain and for discretizing continuous domains. A geometric triangulation of a point set S is a simplicial complex whose vertex set is contained in S and whose underlying space is the convex hull of S. In this thesis we study different approaches for constructing subcomplexes of a geometric triangulation to obtain a good model of a given domain. The work described in this thesis is about regular triangulations, weighted $\alpha$-shapes and homeomorphic triangulations.</dc:description>
          <dc:description>We develop the notion of a regular triangulation of a set on n weighted points in general position in $\IR\sp{d}$. Regular triangulations generalise Delaunay triangulations, and are related to convex hulls in $\IR\sp{d+1}$. We present an efficient randomized incremental algorithm for computing the regular triangulation of a finite weighted point set in $\IR\sp{d}$. The expected running time for the worst set of n points in $\IR\sp{d}$ is O($n\log n$ + $n\sp{\lceil d/2\rceil}$). We also discuss some implementation issues related to degenerate point sets.</dc:description>
          <dc:description>For $\alpha$ $\in$ $\IR$, a weighted $\alpha$-shape of a finite set of weighted points in $\IR\sp{d}$ is obtained from a subcomplex of the regular triangulation of the point set. Weighted $\alpha$-shapes are useful for molecular modeling and surface reconstruction. We present a definition for weighted $\alpha$-shapes that applies to any input, including degenerate data. We also give a straightforward algorithm to compute them.</dc:description>
          <dc:description>Finally, we introduce the Delaunay simplicial complex of a point set S restricted by a given topological space, a subset of $\IR\sp{d}$. This concept is useful in discretizing continuous domains, especially when the dimension of the domain and the imbedding dimension are different. The restricted Delaunay simplicial complex is a subcomplex of the Delaunay triangulation of S. We present sufficient conditions for the underlying space of the restricted Delaunay simplicial complex to be homeomorphic to the given topological space.</dc:description>
          <dc:description>Made available in DSpace on 2011-05-07T12:28:56Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9512544.pdf: 3514755 bytes, checksum: 92974ac470c9cc1b03b87dedcb994a30 (MD5)
  Previous issue date: 1994</dc:description>
          <dc:description>Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:41:36Z
Item is restricted indefinitely.</dc:description>
          <dc:description>Restriction data tranferred 2014-07-01T11:18:01-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permission</dc:description>
          <dc:description>ETDs are only available to UIUC Users without author permission</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:identifier>AAI9512544</dc:identifier>
          <dc:identifier>(UMI)AAI9512544</dc:identifier>
          <dc:identifier>http://hdl.handle.net/2142/20105</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>Copyright 1994 Shah, Nimish Rameshbhai</dc:rights>
          <dc:subject>Computer Science</dc:subject>
          <dc:title>Topological modeling with simplicial complexes</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Computer Science</department>
            <discipline>Computer Science</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
