<?xml version="1.0" encoding="UTF-8"?>
<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-07-21T11:11:05Z</responseDate>
  <request identifier="8790" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:8790</identifier>
        <datestamp>2024-03-06T10:42:39Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>VoroCrust Illustrated: Theory and Challenges (Multimedia Exposition)</dc:title>
          <dc:creator>Abdelkader, Ahmed</dc:creator>
          <dc:creator>Bajaj, Chandrajit L.</dc:creator>
          <dc:creator>Ebeida, Mohamed S.</dc:creator>
          <dc:creator>Mahmoud, Ahmed H.</dc:creator>
          <dc:creator>Mitchell, Scott A.</dc:creator>
          <dc:creator>Owens, John D.</dc:creator>
          <dc:creator>Rushdi, Ahmad A.</dc:creator>
          <dc:subject>sampling</dc:subject>
          <dc:subject>surface reconstruction</dc:subject>
          <dc:subject>polyhedral meshing</dc:subject>
          <dc:subject>Voronoi</dc:subject>
          <dc:description>Over the past decade, polyhedral meshing has been gaining popularity as a better alternative to tetrahedral meshing in certain applications. Within the class of polyhedral elements, Voronoi cells are particularly attractive thanks to their special geometric structure. What has been missing so far is a Voronoi mesher that is sufficiently robust to run automatically on complex models. In this video, we illustrate the main ideas behind the VoroCrust algorithm, highlighting both the theoretical guarantees and the practical challenges imposed by realistic inputs.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Ahmed Abdelkader and Chandrajit L. Bajaj and Mohamed S. Ebeida and Ahmed H. Mahmoud and Scott A. Mitchell and John D. Owens and Ahmad A. Rushdi</dc:contributor>
          <dc:date>2018</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.SoCG.2018.77</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-87903</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.77</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
