<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Collection:</title>
    <link>http://hdl.handle.net/2117/3566</link>
    <description />
    <pubDate>Fri, 24 May 2013 06:09:45 GMT</pubDate>
    <dc:date>2013-05-24T06:09:45Z</dc:date>
    <itunes:owner>
      <itunes:email>webmaster.bupc@upc.edu</itunes:email>
      <itunes:name>Universitat Politècnica de Catalunya. Servei de Biblioteques i Documentació</itunes:name>
    </itunes:owner>
    <itunes:explicit>no</itunes:explicit>
    <itunes:keywords />
    <item>
      <title>A topological comparison of surface extraction algorithms</title>
      <link>http://hdl.handle.net/2117/10821</link>
      <description>Title: A topological comparison of surface extraction algorithms
Authors: Andújar Gran, Carlos Antonio; Brunet Crosa, Pere; Fairén González, Marta; Navazo Álvaro, Isabel; Vinacua Pla, Álvaro
Abstract: In many application areas, it is useful to convert the discrete information stored in the nodes of a regular grid into a continuous boundary model. Isosurface extraction algorithms di er on how the discrete information in the grid is generated, on what information does the grid store and on the properties of the output surface.</description>
      <pubDate>Wed, 29 Dec 2010 13:01:53 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/10821</guid>
      <dc:date>2010-12-29T13:01:53Z</dc:date>
      <itunes:author>Andújar Gran, Carlos Antonio; Brunet Crosa, Pere; Fairén González, Marta; Navazo Álvaro, Isabel; Vinacua Pla, Álvaro</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Surface extraction, Marching cubes algorithm, Topologically&#xD;
consistent isosurfaces, Rectangular grids, Discrete volume models, Topology optimization</itunes:keywords>
      <itunes:summary>In many application areas, it is useful to convert the discrete information stored in the nodes of a regular grid into a continuous boundary model. Isosurface extraction algorithms di er on how the discrete information in the grid is generated, on what information does the grid store and on the properties of the output surface.</itunes:summary>
    </item>
    <item>
      <title>Piecewise algebraic surface computation and fairing from a discrete model</title>
      <link>http://hdl.handle.net/2117/9735</link>
      <description>Title: Piecewise algebraic surface computation and fairing from a discrete model
Authors: Esteve Cusiné, Jordi; Vinacua Pla, Álvaro; Brunet Crosa, Pere
Abstract: This paper describes a constrained fairing method for implicit surfaces defined on a voxelization. This method is suitable for computing a closed smooth surface that approximates an initial set of face connected voxels.</description>
      <pubDate>Fri, 15 Oct 2010 12:43:07 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/9735</guid>
      <dc:date>2010-10-15T12:43:07Z</dc:date>
      <itunes:author>Esteve Cusiné, Jordi; Vinacua Pla, Álvaro; Brunet Crosa, Pere</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>This paper describes a constrained fairing method for implicit surfaces defined on a voxelization. This method is suitable for computing a closed smooth surface that approximates an initial set of face connected voxels.</itunes:summary>
    </item>
  </channel>
</rss>

