曲面简化中距离优化与体积优化的统一

Dongryeol Kim, Jinsoo Kim, Hyeong-Seok Ko
{"title":"曲面简化中距离优化与体积优化的统一","authors":"Dongryeol Kim,&nbsp;Jinsoo Kim,&nbsp;Hyeong-Seok Ko","doi":"10.1006/gmip.1999.0506","DOIUrl":null,"url":null,"abstract":"<div><p>A popular method for simplifying a surface is to repeatedly contract an edge into a vertex and take concomitant actions. In such edge contraction algorithms, the position of the new vertex plays an important role in preserving the original shape. Two methods among them are distance optimization and volume optimization. Even though the two methods were independently developed by different groups and were regarded as two different branches, we found that they are unifiable. In this paper we show that they can be expressed with the same formula, and the only differences are in the weights. We prove that volume optimization is actually a distance optimization weighted by the area of triangles adjacent to the contracted edge.</p></div>","PeriodicalId":100591,"journal":{"name":"Graphical Models and Image Processing","volume":"61 6","pages":"Pages 363-367"},"PeriodicalIF":0.0000,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/gmip.1999.0506","citationCount":"6","resultStr":"{\"title\":\"Unification of Distance and Volume Optimization in Surface Simplification\",\"authors\":\"Dongryeol Kim,&nbsp;Jinsoo Kim,&nbsp;Hyeong-Seok Ko\",\"doi\":\"10.1006/gmip.1999.0506\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A popular method for simplifying a surface is to repeatedly contract an edge into a vertex and take concomitant actions. In such edge contraction algorithms, the position of the new vertex plays an important role in preserving the original shape. Two methods among them are distance optimization and volume optimization. Even though the two methods were independently developed by different groups and were regarded as two different branches, we found that they are unifiable. In this paper we show that they can be expressed with the same formula, and the only differences are in the weights. We prove that volume optimization is actually a distance optimization weighted by the area of triangles adjacent to the contracted edge.</p></div>\",\"PeriodicalId\":100591,\"journal\":{\"name\":\"Graphical Models and Image Processing\",\"volume\":\"61 6\",\"pages\":\"Pages 363-367\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1006/gmip.1999.0506\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Graphical Models and Image Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1077316999905063\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graphical Models and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1077316999905063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

简化曲面的一种常用方法是将一条边反复收缩成一个顶点,并采取相应的动作。在这种边缘收缩算法中,新顶点的位置对保持原始形状起着重要作用。其中两种方法是距离优化和体积优化。虽然这两种方法是由不同的群体独立开发的,被视为两个不同的分支,但我们发现它们是统一的。在本文中,我们证明了它们可以用相同的公式表示,唯一的区别是权值。我们证明了体积优化实际上是一种距离优化,它是由靠近收缩边的三角形面积加权得到的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Unification of Distance and Volume Optimization in Surface Simplification

A popular method for simplifying a surface is to repeatedly contract an edge into a vertex and take concomitant actions. In such edge contraction algorithms, the position of the new vertex plays an important role in preserving the original shape. Two methods among them are distance optimization and volume optimization. Even though the two methods were independently developed by different groups and were regarded as two different branches, we found that they are unifiable. In this paper we show that they can be expressed with the same formula, and the only differences are in the weights. We prove that volume optimization is actually a distance optimization weighted by the area of triangles adjacent to the contracted edge.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
ERRATUM Two-Dimensional Direction-Based Interpolation with Local Centered Moments On Computing Contact Configurations of a Curved Chain Unification of Distance and Volume Optimization in Surface Simplification REVIEWER ACKNOWLEDGMENT
×
引用
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