Methods For Computing Nascar Tire/Track Intersections

ACM-SE(2011)

引用 1|浏览5
暂无评分
摘要
A problem that arises naturally in the real-time simulation of race car motion is the calculation of tire/track intersection points, given track geometry, a wheel hub position, and a wheel plane normal. The challenge arises from handling very large track models, which may comprise millions of polygons, and still meeting tight timing constraints, which require more than 5,000 lookups/second. Three methods of solution are proposed, and the performance and reliability of each is discussed.
更多
查看译文
关键词
computational geometry,plane/surface intersection,KD-tree,bounding volume hierarchy (BVH)
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要