利用伯恩斯坦符号分类进行快速精确的连续碰撞检测

IF 7.8 1区计算机科学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING

ACM Transactions on Graphics Pub Date : 2014-11-01 DOI:10.1145/2661229.2661237

Min Tang, Ruofeng Tong, Zhendong Wang, Dinesh Manocha

{"title":"利用伯恩斯坦符号分类进行快速精确的连续碰撞检测","authors":"Min Tang, Ruofeng Tong, Zhendong Wang, Dinesh Manocha","doi":"10.1145/2661229.2661237","DOIUrl":null,"url":null,"abstract":"We present fast algorithms to perform accurate CCD queries between triangulated models. Our formulation uses properties of the Bernstein basis and Bézier curves and reduces the problem to evaluating signs of polynomials. We present a geometrically exact CCD algorithm based on the exact geometric computation paradigm to perform reliable Boolean collision queries. Our algorithm is more than an order of magnitude faster than prior exact algorithms. We evaluate its performance for cloth and FEM simulations on CPUs and GPUs, and highlight the benefits.","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":"33 6","pages":""},"PeriodicalIF":7.8000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4283478/pdf/nihms651141.pdf","citationCount":"0","resultStr":"{\"title\":\"Fast and Exact Continuous Collision Detection with Bernstein Sign Classification.\",\"authors\":\"Min Tang, Ruofeng Tong, Zhendong Wang, Dinesh Manocha\",\"doi\":\"10.1145/2661229.2661237\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present fast algorithms to perform accurate CCD queries between triangulated models. Our formulation uses properties of the Bernstein basis and Bézier curves and reduces the problem to evaluating signs of polynomials. We present a geometrically exact CCD algorithm based on the exact geometric computation paradigm to perform reliable Boolean collision queries. Our algorithm is more than an order of magnitude faster than prior exact algorithms. We evaluate its performance for cloth and FEM simulations on CPUs and GPUs, and highlight the benefits.\",\"PeriodicalId\":50913,\"journal\":{\"name\":\"ACM Transactions on Graphics\",\"volume\":\"33 6\",\"pages\":\"\"},\"PeriodicalIF\":7.8000,\"publicationDate\":\"2014-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4283478/pdf/nihms651141.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Graphics\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1145/2661229.2661237\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Graphics","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/2661229.2661237","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}

引用次数: 0

摘要

我们提出了在三角形模型之间执行精确 CCD 查询的快速算法。我们的表述使用了伯恩斯坦基和贝塞尔曲线的特性，并将问题简化为评估多项式的符号。我们提出了一种基于精确几何计算范式的几何精确 CCD 算法，用于执行可靠的布尔碰撞查询。我们的算法比之前的精确算法快一个数量级以上。我们评估了它在 CPU 和 GPU 上进行布模拟和有限元模拟的性能，并强调了它的优势。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

Fast and Exact Continuous Collision Detection with Bernstein Sign Classification.

查看原文本刊更多论文

Fast and Exact Continuous Collision Detection with Bernstein Sign Classification.

We present fast algorithms to perform accurate CCD queries between triangulated models. Our formulation uses properties of the Bernstein basis and Bézier curves and reduces the problem to evaluating signs of polynomials. We present a geometrically exact CCD algorithm based on the exact geometric computation paradigm to perform reliable Boolean collision queries. Our algorithm is more than an order of magnitude faster than prior exact algorithms. We evaluate its performance for cloth and FEM simulations on CPUs and GPUs, and highlight the benefits.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ACM Transactions on Graphics 工程技术-计算机：软件工程

CiteScore

14.30

自引率

25.80%

发文量

193

审稿时长

12 months

期刊介绍： ACM Transactions on Graphics (TOG) is a peer-reviewed scientific journal that aims to disseminate the latest findings of note in the field of computer graphics. It has been published since 1982 by the Association for Computing Machinery. Starting in 2003, all papers accepted for presentation at the annual SIGGRAPH conference are printed in a special summer issue of the journal.