The arithmetic precision of ray-polygon intersection testing
نویسنده
چکیده
By looking for algorithms that require minimum arithmetic precision, we obtain a simple ray-polygon intersection test that more easily handles degenerate cases.
منابع مشابه
Toward Reliable Polygon Set Operations
Polygon intersection (clipping) and difference are among the most fundamental operations in computer graphics. To the uninitiated, these problems appear trivial; in fact, they are extremely difficult to perform reliably by computer. Although the graphics literature already provides algorithms for polygon set operations, they have two significant weaknesses: (1) they may fail because they are sp...
متن کاملAn algorithm for determining intersection segment-polygon in 3D
ÐIn the ®elds related to geometric modelling, it is fundamental to count on robust. In this work we present a new algorithm for testing the intersection between a segment and a polygon in 3D space. This algorithm is robust and ecient, and it is the basis of most operations developed in geometric modelling. After, we will apply this algorithm to a classic problem in computer graphics: determini...
متن کاملPhysical Optics Calculation of Electromagnetic Scattering From Haack Series Nose Cone
In this paper, the physical optics method is used to study the problem of electromagnetic scattering from Haack series nose cone. First, a meshing scheme is introduced which approximates the curvature of the surface by piecewise linear functions in both axial and rotational directions. This results in planar quadrilateral patches and enables efficient determination of the illuminated region and...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملWatertight Ray/Triangle Intersection
We propose a novel algorithm for ray/triangle intersection tests that, unlike most other such algorithms, is watertight at both edges and vertices for adjoining triangles, while also maintaining the same performance as simpler algorithms that are not watertight. Our algorithm is straightforward to implement, and is, in particular, robust for all triangle configurations including extreme cases, ...
متن کامل