Volume warping for adaptive isosurface extraction

L. Balmelli, Christopher J. Morris, G. Taubin, F. Bernardini
{"title":"Volume warping for adaptive isosurface extraction","authors":"L. Balmelli, Christopher J. Morris, G. Taubin, F. Bernardini","doi":"10.1109/VISUAL.2002.1183809","DOIUrl":null,"url":null,"abstract":"Polygonal approximations of isosurfaces extracted from uniformly sampled volumes are increasing in size due to the availability of higher resolution imaging techniques. The large number of I primitives represented hinders the interactive exploration of the dataset. Though many solutions have been proposed to this problem, many require the creation of isosurfaces at multiple resolutions or the use of additional data structures, often hierarchical, to represent the volume. We propose a technique for adaptive isosurface extraction that is easy to implement and allows the user to decide the degree of adaptivity as well as the choice of isosurface extraction algorithm. Our method optimizes the extraction of the isosurface by warping the volume. In a warped volume, areas of importance (e.g. containing significant details) are inflated while unimportant ones are contracted. Once the volume is warped, any extraction algorithm can be applied. The extracted mesh is subsequently unwarped such that the warped areas are rescaled to their initial proportions. The resulting isosurface is represented by a mesh that is more densely sampled in regions decided as important.","PeriodicalId":196064,"journal":{"name":"IEEE Visualization, 2002. VIS 2002.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Visualization, 2002. VIS 2002.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VISUAL.2002.1183809","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

Abstract

Polygonal approximations of isosurfaces extracted from uniformly sampled volumes are increasing in size due to the availability of higher resolution imaging techniques. The large number of I primitives represented hinders the interactive exploration of the dataset. Though many solutions have been proposed to this problem, many require the creation of isosurfaces at multiple resolutions or the use of additional data structures, often hierarchical, to represent the volume. We propose a technique for adaptive isosurface extraction that is easy to implement and allows the user to decide the degree of adaptivity as well as the choice of isosurface extraction algorithm. Our method optimizes the extraction of the isosurface by warping the volume. In a warped volume, areas of importance (e.g. containing significant details) are inflated while unimportant ones are contracted. Once the volume is warped, any extraction algorithm can be applied. The extracted mesh is subsequently unwarped such that the warped areas are rescaled to their initial proportions. The resulting isosurface is represented by a mesh that is more densely sampled in regions decided as important.
自适应等值面提取的体积翘曲
由于高分辨率成像技术的可用性,从均匀取样体积中提取的多边形近似等面的尺寸正在增加。表示的大量I原语阻碍了数据集的交互式探索。虽然针对这个问题已经提出了许多解决方案,但许多解决方案都需要在多个分辨率下创建等值面,或者使用额外的数据结构(通常是分层的)来表示体积。我们提出了一种易于实现的自适应等值面提取技术,允许用户决定自适应程度以及等值面提取算法的选择。我们的方法通过扭曲体积来优化等值面的提取。在弯曲的体积中,重要的区域(例如包含重要细节的区域)膨胀,而不重要的区域收缩。一旦体积被扭曲,任何提取算法都可以应用。提取的网格随后被解除扭曲,这样扭曲的区域被重新缩放到它们的初始比例。所得等值面由网格表示,该网格在确定为重要的区域中更密集地采样。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信