Efficient Picking through Atomic Operations

A. Petrescu, F. Moldoveanu, A. Moldoveanu, A. Morar, V. Asavei
{"title":"Efficient Picking through Atomic Operations","authors":"A. Petrescu, F. Moldoveanu, A. Moldoveanu, A. Morar, V. Asavei","doi":"10.1109/CSCS.2013.31","DOIUrl":null,"url":null,"abstract":"Picking is the process through which a single entity or a list of entities is selected from a scene. The subject of picking is both a rendering and a collision detection problem, with the majority of research being on optimizing the ray-scene intersection problem. Several algorithms that solve the picking problem exist in the context of rasterization, but all of them lack several of the features of our proposed solution while, with one exception, all being much more expensive in terms of computational time. We propose a novel single frame method which is able to correctly select not only primitives but also any type of objects that may appear on the screen at a fragment level including hardware instanced, alpha culled, hardware tessellated, hardware animated and particle systems. The proposed technique has optimal memory requirements and offers the opportunity to pick at micro polygon level and is not limited to the first contact, offering the full intersection list per ray if required to do so. The proposed technique offers further unique opportunities such as flexible fuzzy object selection and is the only technique that selects without disregarding opacity accumulation from transparent objects.","PeriodicalId":285027,"journal":{"name":"Computer Science in Cars Symposium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science in Cars Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSCS.2013.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Picking is the process through which a single entity or a list of entities is selected from a scene. The subject of picking is both a rendering and a collision detection problem, with the majority of research being on optimizing the ray-scene intersection problem. Several algorithms that solve the picking problem exist in the context of rasterization, but all of them lack several of the features of our proposed solution while, with one exception, all being much more expensive in terms of computational time. We propose a novel single frame method which is able to correctly select not only primitives but also any type of objects that may appear on the screen at a fragment level including hardware instanced, alpha culled, hardware tessellated, hardware animated and particle systems. The proposed technique has optimal memory requirements and offers the opportunity to pick at micro polygon level and is not limited to the first contact, offering the full intersection list per ray if required to do so. The proposed technique offers further unique opportunities such as flexible fuzzy object selection and is the only technique that selects without disregarding opacity accumulation from transparent objects.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过原子操作高效拾取
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Efficient Picking through Atomic Operations Engineered Devices to Support Stroke Rehabilitation Emerging Phenomenon Associated with a Symmetry Breaking in the Case of a Structural Inflation Model Cloud Provider's Services Evaluation Using Triangular Fuzzy Numbers
×
引用
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