<?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-20T12:09:17Z</responseDate>
  <request identifier="1440" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1440</identifier>
        <datestamp>2024-03-06T11:07:52Z</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>A Note on Some Applications of Interval Arithmetic in Hierarchical Solid Modeling</dc:title>
          <dc:creator>Dyllong, Eva</dc:creator>
          <dc:subject>Reliable solid modeling</dc:subject>
          <dc:subject>hierarchical data structure</dc:subject>
          <dc:description>Techniques of reliable computing like interval arithmetic can be used to&#13;
guarantee a reliable solution even in the presence of numerical round-off&#13;
errors. The need to trace bounds for the error function separately can be &#13;
eliminated using these techniques. In this talk, we focus on some &#13;
demonstrations how the techniques and algorithms of reliable computing &#13;
can be applied to the construction and further processing of hierarchical &#13;
solid representations using the octree model as an example.&#13;
&#13;
An octree is a common hierarchical data structure to represent 3D &#13;
geometrical objects in solid modeling systems or to reconstruct a real &#13;
scene. The solid representation is based on recursive cell decompositions &#13;
of the space. Unfortunately, the data structure may require a large amount &#13;
of memory when it uses a set of very small cubic nodes to approximate a &#13;
solid.&#13;
&#13;
In this talk, we present a novel generalization of the octree model created &#13;
from a CSG object that uses interval arithmetic and allows us to extend the &#13;
tests for classifying points in space as inside, on the boundary or outside &#13;
the object to handle whole sections of the space at once. Tree nodes with &#13;
additional information about relevant parts of the CSG object are &#13;
introduced in order to reduce the depth of the required subdivision. &#13;
Furthermore, this talk is concerned with interval-based algorithms for &#13;
reliable proximity queries between the extended octrees and with further &#13;
processing of the structure. We conclude the talk with some examples of &#13;
implementations.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Eva Dyllong</dc:contributor>
          <dc:date>2008</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 8021, Numerical Validation in Current Hardware Architectures (2008)</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/DagSemProc.08021.5</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-14408</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08021.5</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
