GPU快速和鲁棒的计算质心坐标和平面的相交使用投影表示

2014 4th World Congress on Information and Communication Technologies (WICT 2014) Pub Date : 2014-12-01 DOI:10.1109/WICT.2014.7077298

V. Skala

{"title":"GPU快速和鲁棒的计算质心坐标和平面的相交使用投影表示","authors":"V. Skala","doi":"10.1109/WICT.2014.7077298","DOIUrl":null,"url":null,"abstract":"This paper describes algorithms for fast and robust GPU computation of barycentric coordinates and intersection of two planes. The presented algorithms are based on matrix-vector operations which make the algorithms convenient for GPU or SSE based architectures. Also a new formula for finding the closest point of two planes intersection to the given point is given.","PeriodicalId":439852,"journal":{"name":"2014 4th World Congress on Information and Communication Technologies (WICT 2014)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"GPU fast and robust computation for barycentric coordinates and intersection of planes using projective representation\",\"authors\":\"V. Skala\",\"doi\":\"10.1109/WICT.2014.7077298\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes algorithms for fast and robust GPU computation of barycentric coordinates and intersection of two planes. The presented algorithms are based on matrix-vector operations which make the algorithms convenient for GPU or SSE based architectures. Also a new formula for finding the closest point of two planes intersection to the given point is given.\",\"PeriodicalId\":439852,\"journal\":{\"name\":\"2014 4th World Congress on Information and Communication Technologies (WICT 2014)\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 4th World Congress on Information and Communication Technologies (WICT 2014)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WICT.2014.7077298\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 4th World Congress on Information and Communication Technologies (WICT 2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WICT.2014.7077298","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文介绍了一种快速、鲁棒的质心坐标和两平面交点的GPU计算算法。所提出的算法是基于矩阵-向量运算的，这使得算法对基于GPU或SSE的架构很方便。同时给出了求两个平面交点离给定点最近的点的新公式。

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

查看原文本刊更多论文

GPU fast and robust computation for barycentric coordinates and intersection of planes using projective representation

This paper describes algorithms for fast and robust GPU computation of barycentric coordinates and intersection of two planes. The presented algorithms are based on matrix-vector operations which make the algorithms convenient for GPU or SSE based architectures. Also a new formula for finding the closest point of two planes intersection to the given point is given.

求助全文

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

来源期刊

2014 4th World Congress on Information and Communication Technologies (WICT 2014)

自引率

0.00%

发文量