Point-Based Minkowski Sum Boundary

Jyh-Ming Lien
{"title":"Point-Based Minkowski Sum Boundary","authors":"Jyh-Ming Lien","doi":"10.1109/PG.2007.49","DOIUrl":null,"url":null,"abstract":"Minkowski sum is a fundamental operation in many geometric applications, including robotics, penetration depth estimation, solid modeling, and virtual prototyping. However, due to its high computational complexity and several nontrivial implementation issues, computing the exact boundary of the Minkowski sum of two arbitrary polyhedra is generally a difficult task. In this work, we propose to represent the boundary of the Minkowski sum approximately using only points. Our results show that this point-based representation can be generated efficiently. An important feature of our method is its straightforward implementation and parallelization. We also demonstrate that the point-based representation of the Minkowski sum boundary can indeed provide similar functionality as mesh-based representations can. We show several applications in motion planning, penetration depth approximation and modeling.","PeriodicalId":376934,"journal":{"name":"15th Pacific Conference on Computer Graphics and Applications (PG'07)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"70","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"15th Pacific Conference on Computer Graphics and Applications (PG'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PG.2007.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 70

Abstract

Minkowski sum is a fundamental operation in many geometric applications, including robotics, penetration depth estimation, solid modeling, and virtual prototyping. However, due to its high computational complexity and several nontrivial implementation issues, computing the exact boundary of the Minkowski sum of two arbitrary polyhedra is generally a difficult task. In this work, we propose to represent the boundary of the Minkowski sum approximately using only points. Our results show that this point-based representation can be generated efficiently. An important feature of our method is its straightforward implementation and parallelization. We also demonstrate that the point-based representation of the Minkowski sum boundary can indeed provide similar functionality as mesh-based representations can. We show several applications in motion planning, penetration depth approximation and modeling.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于点的Minkowski和边界
闵可夫斯基和是许多几何应用中的基本运算,包括机器人,渗透深度估计,实体建模和虚拟原型。然而,由于其较高的计算复杂度和一些重要的实现问题,计算任意两个多面体的Minkowski和的精确边界通常是一项困难的任务。在这项工作中,我们提出用点近似表示闵可夫斯基和的边界。结果表明,这种基于点的表示可以有效地生成。我们的方法的一个重要特点是它的简单实现和并行化。我们还证明了基于点的闵可夫斯基和边界表示确实可以提供与基于网格的表示类似的功能。我们展示了几个应用在运动规划,渗透深度近似和建模。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A New Volumetric Implicit Surface Data Structure and Its Triangulation Algorithm Applied to Mesh Integration Simple and Efficient Mesh Editing with Consistent Local Frames Visualisation of Implicit Algebraic Curves Fast and Faithful Geometric Algorithm for Detecting Crest Lines on Meshes Radiometric Compensation through Inverse Light Transport
×
引用
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