An efficient distance algorithm for interval-based octree-encoded CSG objects with time-space coherence utilization

An efficient distance algorithm for interval-based octree-encoded CSG objects with time-space coherence utilization

In this paper, a new distance algorithm for octree‐encoded CSG objects is presented. Interval vectors are used to describe the nodes of the octree for a reliable and efficient realization of the hierarchical data structure. The algorithm yields the lower bounds of the distance between the objects an...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings in applied mathematics and mechanics 2007-12, Vol.7 (1), p.1023007-1023008
Hauptverfasser: Dyllong, Eva, Grimm, Cornelius
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1023008
container_issue 1
container_start_page 1023007
container_title Proceedings in applied mathematics and mechanics
container_volume 7
creator Dyllong, Eva
Grimm, Cornelius
description In this paper, a new distance algorithm for octree‐encoded CSG objects is presented. Interval vectors are used to describe the nodes of the octree for a reliable and efficient realization of the hierarchical data structure. The algorithm yields the lower bounds of the distance between the objects and is based on accurate algorithms that have been shown in [1], but involves interval arithmetic for reliable handling of rounding errors. Furthermore, time‐space coherence is utilized to increase the efficiency of sequential distance calculations. Experiments validate the approach and show its range of applicability. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
doi_str_mv 10.1002/pamm.200700567
format Article
fullrecord <record><control><sourceid>wiley_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1002_pamm_200700567</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>PAMM200700567</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2127-911160c60268d9670a4425ea5d2ade312dfeea203e769f57c4bd26fe7994c7623</originalsourceid><addsrcrecordid>eNqFkMFOAjEQhhujiYhePfcFFtvubuseyUbQAGqiBm9NaWeluLslbRXx6V2CId48zUzm__7Dh9AlJQNKCLtaq6YZMEIEITkXR6hHORWJIJwe_9lP0VkIqy5PeUp6KAxbDFVltYU2YmNDVK0GrOo3521cNrhyHts2gv9UdbJQAQx2OnqABFrtTHeWT2PsFivQMeBNx-BoG0jCWnU92i3Bw67xI9rafqtoXXuOTipVB7j4nX30Mrp5Lm-T6cP4rhxOE80oE0lBKeVEc8L4tSm4ICrLWA4qN0wZSCkzFYBiJAXBiyoXOlsYxisQRZFpwVnaR4N9r_YuBA-VXHvbKL-VlMidMrlTJg_KOqDYAxtbw_aftHwczmZ_2WTPdgrh68Aq_y67r8jl_H4seTkZTeavQmbpD5W1gUo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>An efficient distance algorithm for interval-based octree-encoded CSG objects with time-space coherence utilization</title><source>Wiley Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Dyllong, Eva ; Grimm, Cornelius</creator><creatorcontrib>Dyllong, Eva ; Grimm, Cornelius</creatorcontrib><description>In this paper, a new distance algorithm for octree‐encoded CSG objects is presented. Interval vectors are used to describe the nodes of the octree for a reliable and efficient realization of the hierarchical data structure. The algorithm yields the lower bounds of the distance between the objects and is based on accurate algorithms that have been shown in [1], but involves interval arithmetic for reliable handling of rounding errors. Furthermore, time‐space coherence is utilized to increase the efficiency of sequential distance calculations. Experiments validate the approach and show its range of applicability. (© 2008 WILEY‐VCH Verlag GmbH &amp; Co. KGaA, Weinheim)</description><identifier>ISSN: 1617-7061</identifier><identifier>EISSN: 1617-7061</identifier><identifier>DOI: 10.1002/pamm.200700567</identifier><language>eng</language><publisher>Berlin: WILEY-VCH Verlag</publisher><ispartof>Proceedings in applied mathematics and mechanics, 2007-12, Vol.7 (1), p.1023007-1023008</ispartof><rights>Copyright © 2007 WILEY‐VCH Verlag GmbH &amp; Co. KGaA, Weinheim</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2127-911160c60268d9670a4425ea5d2ade312dfeea203e769f57c4bd26fe7994c7623</citedby><cites>FETCH-LOGICAL-c2127-911160c60268d9670a4425ea5d2ade312dfeea203e769f57c4bd26fe7994c7623</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fpamm.200700567$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fpamm.200700567$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1417,27924,27925,45574,45575</link.rule.ids></links><search><creatorcontrib>Dyllong, Eva</creatorcontrib><creatorcontrib>Grimm, Cornelius</creatorcontrib><title>An efficient distance algorithm for interval-based octree-encoded CSG objects with time-space coherence utilization</title><title>Proceedings in applied mathematics and mechanics</title><addtitle>Proc. Appl. Math. Mech</addtitle><description>In this paper, a new distance algorithm for octree‐encoded CSG objects is presented. Interval vectors are used to describe the nodes of the octree for a reliable and efficient realization of the hierarchical data structure. The algorithm yields the lower bounds of the distance between the objects and is based on accurate algorithms that have been shown in [1], but involves interval arithmetic for reliable handling of rounding errors. Furthermore, time‐space coherence is utilized to increase the efficiency of sequential distance calculations. Experiments validate the approach and show its range of applicability. (© 2008 WILEY‐VCH Verlag GmbH &amp; Co. KGaA, Weinheim)</description><issn>1617-7061</issn><issn>1617-7061</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><recordid>eNqFkMFOAjEQhhujiYhePfcFFtvubuseyUbQAGqiBm9NaWeluLslbRXx6V2CId48zUzm__7Dh9AlJQNKCLtaq6YZMEIEITkXR6hHORWJIJwe_9lP0VkIqy5PeUp6KAxbDFVltYU2YmNDVK0GrOo3521cNrhyHts2gv9UdbJQAQx2OnqABFrtTHeWT2PsFivQMeBNx-BoG0jCWnU92i3Bw67xI9rafqtoXXuOTipVB7j4nX30Mrp5Lm-T6cP4rhxOE80oE0lBKeVEc8L4tSm4ICrLWA4qN0wZSCkzFYBiJAXBiyoXOlsYxisQRZFpwVnaR4N9r_YuBA-VXHvbKL-VlMidMrlTJg_KOqDYAxtbw_aftHwczmZ_2WTPdgrh68Aq_y67r8jl_H4seTkZTeavQmbpD5W1gUo</recordid><startdate>200712</startdate><enddate>200712</enddate><creator>Dyllong, Eva</creator><creator>Grimm, Cornelius</creator><general>WILEY-VCH Verlag</general><general>WILEY‐VCH Verlag</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>200712</creationdate><title>An efficient distance algorithm for interval-based octree-encoded CSG objects with time-space coherence utilization</title><author>Dyllong, Eva ; Grimm, Cornelius</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2127-911160c60268d9670a4425ea5d2ade312dfeea203e769f57c4bd26fe7994c7623</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Dyllong, Eva</creatorcontrib><creatorcontrib>Grimm, Cornelius</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><jtitle>Proceedings in applied mathematics and mechanics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Dyllong, Eva</au><au>Grimm, Cornelius</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An efficient distance algorithm for interval-based octree-encoded CSG objects with time-space coherence utilization</atitle><jtitle>Proceedings in applied mathematics and mechanics</jtitle><addtitle>Proc. Appl. Math. Mech</addtitle><date>2007-12</date><risdate>2007</risdate><volume>7</volume><issue>1</issue><spage>1023007</spage><epage>1023008</epage><pages>1023007-1023008</pages><issn>1617-7061</issn><eissn>1617-7061</eissn><abstract>In this paper, a new distance algorithm for octree‐encoded CSG objects is presented. Interval vectors are used to describe the nodes of the octree for a reliable and efficient realization of the hierarchical data structure. The algorithm yields the lower bounds of the distance between the objects and is based on accurate algorithms that have been shown in [1], but involves interval arithmetic for reliable handling of rounding errors. Furthermore, time‐space coherence is utilized to increase the efficiency of sequential distance calculations. Experiments validate the approach and show its range of applicability. (© 2008 WILEY‐VCH Verlag GmbH &amp; Co. KGaA, Weinheim)</abstract><cop>Berlin</cop><pub>WILEY-VCH Verlag</pub><doi>10.1002/pamm.200700567</doi><tpages>2</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1617-7061
ispartof Proceedings in applied mathematics and mechanics, 2007-12, Vol.7 (1), p.1023007-1023008
issn 1617-7061
1617-7061
language eng
recordid cdi_crossref_primary_10_1002_pamm_200700567
source Wiley Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals
title An efficient distance algorithm for interval-based octree-encoded CSG objects with time-space coherence utilization
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T18%3A53%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wiley_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20efficient%20distance%20algorithm%20for%20interval-based%20octree-encoded%20CSG%20objects%20with%20time-space%20coherence%20utilization&rft.jtitle=Proceedings%20in%20applied%20mathematics%20and%20mechanics&rft.au=Dyllong,%20Eva&rft.date=2007-12&rft.volume=7&rft.issue=1&rft.spage=1023007&rft.epage=1023008&rft.pages=1023007-1023008&rft.issn=1617-7061&rft.eissn=1617-7061&rft_id=info:doi/10.1002/pamm.200700567&rft_dat=%3Cwiley_cross%3EPAMM200700567%3C/wiley_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true