GridMesh: Fast and high quality 2D Mesh generation for interactive 3D shape modeling

Andrew Nealen, Justus Pett, M. Alexa, T. Igarashi
{"title":"GridMesh: Fast and high quality 2D Mesh generation for interactive 3D shape modeling","authors":"Andrew Nealen, Justus Pett, M. Alexa, T. Igarashi","doi":"10.1109/SMI.2009.5170143","DOIUrl":null,"url":null,"abstract":"In this paper we present an algorithm for watertight meshing of closed, sketched curves. The sketch is resampled as a piecewise linear (PWL) curve and placed onto a triangular grid. A small boundary (seed) that describes a closed path along grid points is placed inside the sketch and grown until it resembles the sketch. Vertices of the evolved grid boundary are projected onto the stroke to establish a bijective, ordered mapping. Finally, valences along the boundary are optimized while retaining the previously established mapping. The resulting mesh patch can be duplicated, stitched and inflated to generate a new shape, or used to fill a hole in an existing shape. We have implemented our algorithm in FiberMesh [1], an interactive sketch based interface for designing freeform surfaces, where it is used for the all mesh generation processes. The triangulation generated with our algorithm improves the quality of the model by reducing the number of irregular vertices, while running at real time rates.","PeriodicalId":237863,"journal":{"name":"2009 IEEE International Conference on Shape Modeling and Applications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Shape Modeling and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SMI.2009.5170143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper we present an algorithm for watertight meshing of closed, sketched curves. The sketch is resampled as a piecewise linear (PWL) curve and placed onto a triangular grid. A small boundary (seed) that describes a closed path along grid points is placed inside the sketch and grown until it resembles the sketch. Vertices of the evolved grid boundary are projected onto the stroke to establish a bijective, ordered mapping. Finally, valences along the boundary are optimized while retaining the previously established mapping. The resulting mesh patch can be duplicated, stitched and inflated to generate a new shape, or used to fill a hole in an existing shape. We have implemented our algorithm in FiberMesh [1], an interactive sketch based interface for designing freeform surfaces, where it is used for the all mesh generation processes. The triangulation generated with our algorithm improves the quality of the model by reducing the number of irregular vertices, while running at real time rates.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
GridMesh:快速和高质量的2D网格生成交互式3D形状建模
本文提出了一种封闭曲线的水密网格划分算法。草图作为分段线性(PWL)曲线重新采样,并放置在三角形网格上。一个描述沿网格点闭合路径的小边界(种子)被放置在草图内并不断生长,直到它与草图相似。进化的网格边界的顶点被投射到笔画上,以建立一个双客观的有序映射。最后,在保留先前建立的映射的同时,优化了边界上的价。由此产生的网状补片可以复制、缝合和膨胀,以产生新的形状,或用于填补现有形状的洞。我们已经在FiberMesh[1]中实现了我们的算法,这是一个用于设计自由曲面的基于交互草图的界面,它用于所有网格生成过程。用我们的算法生成的三角剖分通过减少不规则顶点的数量来提高模型的质量,同时以实时速率运行。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Detail-preserving axial deformation using curve pairs Interpolation to C1 boundary conditions by polynomial of degree six Feature sensitive bas relief generation Approximate shape matching and symmetry detection for 3D shapes with guaranteed error bounds Filling holes in triangular meshes by curve unfolding
×
引用
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