Distinguishing 3D-Topological Configurations of Two Tori

Adrian Ion, Thomas Illetschko, Y. Haxhimusa, W. Kropatsch
{"title":"Distinguishing 3D-Topological Configurations of Two Tori","authors":"Adrian Ion, Thomas Illetschko, Y. Haxhimusa, W. Kropatsch","doi":"10.1109/SYNASC.2006.30","DOIUrl":null,"url":null,"abstract":"Most of the existing work regarding topology preserving hierarchies is mainly preoccupied with 2D domains. But recently attention has turned to 3D, and more generally, nD representations. Even more than in 2D, the necessity for reducing these representations exists and motivates the research in hierarchical structures i.e. pyramids. Using representations that support any dimension, like e.g. the combinatorial map, n dimensional irregular pyramids can be built, thus obtaining reduced representations of the original data, while preserving the topology. This paper presents 3D combinatorial maps and the primitive operations needed to simplify such representations. Minimal configurations of the three primitive topological configurations, simplex, hole, and tunnel, and two possible configurations for two tori are presented. Experimental results and possible applications show the potential of the approach","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2006.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Most of the existing work regarding topology preserving hierarchies is mainly preoccupied with 2D domains. But recently attention has turned to 3D, and more generally, nD representations. Even more than in 2D, the necessity for reducing these representations exists and motivates the research in hierarchical structures i.e. pyramids. Using representations that support any dimension, like e.g. the combinatorial map, n dimensional irregular pyramids can be built, thus obtaining reduced representations of the original data, while preserving the topology. This paper presents 3D combinatorial maps and the primitive operations needed to simplify such representations. Minimal configurations of the three primitive topological configurations, simplex, hole, and tunnel, and two possible configurations for two tori are presented. Experimental results and possible applications show the potential of the approach
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
区分两个环面三维拓扑构型
现有的关于拓扑保持层次结构的大部分工作主要集中在二维域上。但最近人们的注意力转向了3D,以及更普遍的nD表示。甚至比在二维中更有必要减少这些表示,这激发了对分层结构(即金字塔)的研究。使用支持任意维度的表示,例如组合映射,可以构建n维不规则金字塔,从而获得原始数据的简化表示,同时保留拓扑结构。本文介绍了三维组合映射和简化这种表示所需的基本操作。给出了三种基本拓扑构型的最小构型:单纯形、孔形和隧道形,以及两个环面可能的两种构型。实验结果和可能的应用表明了该方法的潜力
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Algorithms and Results in Content-Based Visual Query of the Image Databases Resulting from Dicom Files A New k-means Based Clustering Algorithm in Aspect Mining A Framework for Scheduling Image Processing Applications in MedioGRID HTML Pattern Generator--Automatic Data Extraction from Web Pages Incremental Deterministic Planning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1