Methods for computing NASCAR tire/track intersections

Authors:
Christopher Corsi;Robert Geist;James Westall
Affiliations:
Clemson University, Clemson, SC;Clemson University, Clemson, SC;Clemson University, Clemson, SC
Venue:
Proceedings of the 49th Annual Southeast Regional Conference
Year:
2011

Citing 4
Cited 0

Multidimensional binary search trees used for associative searching

Communications of the ACM
Algorithms + Data Structures = Programs

Algorithms + Data Structures = Programs
A tracing method for parametric Bezier triangular surface/plane intersection

International Journal of Computer Applications in Technology
Instant ray tracing: the bounding interval hierarchy

EGSR'06 Proceedings of the 17th Eurographics conference on Rendering Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.