Interval arithmetic recursive subdivision for implicit functions and constructive solid geometry

Tom Duff
{"title":"Interval arithmetic recursive subdivision for implicit functions and constructive solid geometry","authors":"Tom Duff","doi":"10.1145/133994.134027","DOIUrl":null,"url":null,"abstract":"Recursive subdivision using interval arithmetic allows us to render CSG combinations of implicit function surfaces with or without anti -aliasing, Related algorithms will solve the collision detection problem for dynamic simulation, and allow us to compute mass. center of gravity, angular moments and other integral properties required for Newtonian dynamics. Our hidden surface algorithms run in ‘constant time.’ Their running times are nearly independent of the number of primitives in a scene, for scenes in which the visible details are not much smaller than the pixels. The collision detection and integration algorithms are utterly robust — collisions are never missed due 10 numerical error and we can provide guaranteed bounds on the values of integrals. CR Categories and Subject Descriptors: G. 1.0 [Numerical Analysis ] Numerical Algorithms 1.3.3 [Picture and Image Generation ] Display algorithms, Viewing algorithms, 1.3.5 [Computational Geometry and Object Modeling] Curve, surface, solid and object representations, 1.3,5 [Computational Geometry and Object Modeling] Hierarchy and geometric transformations. 1.3.7 [Three-Dimensional Graphics and Realism] Visible line/surface algorithms, Animation","PeriodicalId":196837,"journal":{"name":"Proceedings of the 19th annual conference on Computer graphics and interactive techniques","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"183","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 19th annual conference on Computer graphics and interactive techniques","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/133994.134027","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 183

Abstract

Recursive subdivision using interval arithmetic allows us to render CSG combinations of implicit function surfaces with or without anti -aliasing, Related algorithms will solve the collision detection problem for dynamic simulation, and allow us to compute mass. center of gravity, angular moments and other integral properties required for Newtonian dynamics. Our hidden surface algorithms run in ‘constant time.’ Their running times are nearly independent of the number of primitives in a scene, for scenes in which the visible details are not much smaller than the pixels. The collision detection and integration algorithms are utterly robust — collisions are never missed due 10 numerical error and we can provide guaranteed bounds on the values of integrals. CR Categories and Subject Descriptors: G. 1.0 [Numerical Analysis ] Numerical Algorithms 1.3.3 [Picture and Image Generation ] Display algorithms, Viewing algorithms, 1.3.5 [Computational Geometry and Object Modeling] Curve, surface, solid and object representations, 1.3,5 [Computational Geometry and Object Modeling] Hierarchy and geometric transformations. 1.3.7 [Three-Dimensional Graphics and Realism] Visible line/surface algorithms, Animation
隐函数和构造立体几何的区间算术递推细分
使用区间算法的递归细分允许我们在有或没有抗混叠的情况下呈现隐函数曲面的CSG组合,相关算法将解决动态仿真的碰撞检测问题,并允许我们计算质量。重心,角矩和其他牛顿动力学所需的积分性质。我们的隐曲面算法在常数时间内运行。它们的运行时间几乎与场景中原语的数量无关,因为场景中的可见细节并不比像素小多少。碰撞检测和积分算法是完全鲁棒性的-碰撞不会因为10个数值误差而错过,并且我们可以提供保证积分值的边界。CR分类和主题描述:G. 1.0[数值分析]数值算法1.3.3[图片和图像生成]显示算法,查看算法,1.3.5[计算几何和对象建模]曲线,表面,实体和对象表示,1.3,5[计算几何和对象建模]层次和几何变换。1.3.7[三维图形和真实感]可见线/面算法,动画
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信