Faster Triangle-Triangle Intersection Tests
Year: 2002
Type: report
Abstract: This paper presents a new method for computing whether or not two triangles in three dimensions intersect. The code is very efficient and requires minimum arithmetic precision. Indeed, all branching decisions are carried out by evaluating the signs of degree three polynomials. In addition, an efficient test is proposed for the two-dimensional case.
Source: HAL
Authors: Olivier Devillers, Philippe Guigue
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2335841944
