Cluster-Based Generation of Hierarchical Surface Models

Bjørn Heckel, A. Uva, B. Hamann
{"title":"Cluster-Based Generation of Hierarchical Surface Models","authors":"Bjørn Heckel, A. Uva, B. Hamann","doi":"10.1109/DAGSTUHL.1997.1423107","DOIUrl":null,"url":null,"abstract":"We present a highly efficient, automatic method for the generation of hierarchical surface triangulations. Given a set of scattered points in three-dimensional space, without known connectivity information, our method reconstructs a valid triangulated surface model in a two-step procedure. First, we apply clustering to the set of given points and identify point subsets in locally nearly planar regions. Second, we construct a surface triangulation from the output of the clustering step. The output of the clustering step is a set of 2-manifold tiles, which locally approximate the underlying, unknown surface. We construct the triangulation of the entire surface by triangulating the individual tiles and triangulating the gaps between the tiles. Since we apply point clustering in a hierarchical fashion we can generate model hierarchies by triangulating various levels resulting from the hierarchical clustering step.","PeriodicalId":268314,"journal":{"name":"Scientific Visualization Conference (dagstuhl '97)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scientific Visualization Conference (dagstuhl '97)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAGSTUHL.1997.1423107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 30

Abstract

We present a highly efficient, automatic method for the generation of hierarchical surface triangulations. Given a set of scattered points in three-dimensional space, without known connectivity information, our method reconstructs a valid triangulated surface model in a two-step procedure. First, we apply clustering to the set of given points and identify point subsets in locally nearly planar regions. Second, we construct a surface triangulation from the output of the clustering step. The output of the clustering step is a set of 2-manifold tiles, which locally approximate the underlying, unknown surface. We construct the triangulation of the entire surface by triangulating the individual tiles and triangulating the gaps between the tiles. Since we apply point clustering in a hierarchical fashion we can generate model hierarchies by triangulating various levels resulting from the hierarchical clustering step.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于聚类的分层曲面模型生成
我们提出了一种高效、自动的分层曲面三角剖分生成方法。给定三维空间中一组分散的点,没有已知的连通性信息,我们的方法分两步重建一个有效的三角曲面模型。首先,对给定的点进行聚类,在局部近平面区域内识别点子集。其次,我们从聚类步骤的输出构造一个曲面三角。聚类步骤的输出是一组2流形块,它在局部近似底层未知表面。我们通过对单个瓷砖和瓷砖之间的间隙进行三角测量来构建整个表面的三角测量。由于我们以分层方式应用点聚类,我们可以通过三角化分层聚类步骤产生的各个层次来生成模型层次。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Simple, Fast, and Robust Ray Casting of Irregular Grids Visualization of Analytically Defined Dynamical Systems Using Virtual Reality to Visualize Scientific, Engineering, and Medical Data Constrained Navigation Environments Visualization over the World Wide Web
×
引用
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