In this paper, a new method for computing intersection between a ray and a parametric surface is proposed, which finds many applications in computer graphics, robotics and geometric modeling. The method uses the second order derivative of the surface, which can handle inherent problems that Newton–Raphson and Halley methods have such as instability caused by inappropriate initial conditions and tangential intersection. Case examples are presented to demonstrate the capability of the proposed method
Point sets become an increasingly popular shape representation. Most shape processing and rendering ...
In this section, the basic ray-surface intersection algorithm based on this surface definition will ...
Point sets become an increasingly popular shape representation. Most shape processing and rendering ...
In this paper, a new method for computing intersection between a ray and a parametric surface is pro...
In this paper, we present a new geometric algorithm to compute the intersection between a ray and a ...
Over the past decades, vast research has been done on the ray-triangle intersect test but not much a...
This paper describes an algorithm that uses ray t racing techniques to display bivariate polynomial...
Presented algorithm solves the problem of finding intersection between a ray and an offset of ration...
This paper describes an algorithm that uses ray tracing techniques to display bivariate polynomial s...
With regard to ray tracing algorithms for polynomial tensor product surfaces, the most time-critical...
The problem of intersecting two parametric surfaces has been one of the main technical challenges in...
With regard to ray tracing algorithms for polynomial tensor product surfaces, the most time-critical...
The determination of the intersection curve between two surfaces may be seen as two different and se...
Intersection algorithms are very important in computation of geometrical problems. Algorithms for a...
In this section, the basic ray-surface intersection algorithm based on this surface definition will ...
Point sets become an increasingly popular shape representation. Most shape processing and rendering ...
In this section, the basic ray-surface intersection algorithm based on this surface definition will ...
Point sets become an increasingly popular shape representation. Most shape processing and rendering ...
In this paper, a new method for computing intersection between a ray and a parametric surface is pro...
In this paper, we present a new geometric algorithm to compute the intersection between a ray and a ...
Over the past decades, vast research has been done on the ray-triangle intersect test but not much a...
This paper describes an algorithm that uses ray t racing techniques to display bivariate polynomial...
Presented algorithm solves the problem of finding intersection between a ray and an offset of ration...
This paper describes an algorithm that uses ray tracing techniques to display bivariate polynomial s...
With regard to ray tracing algorithms for polynomial tensor product surfaces, the most time-critical...
The problem of intersecting two parametric surfaces has been one of the main technical challenges in...
With regard to ray tracing algorithms for polynomial tensor product surfaces, the most time-critical...
The determination of the intersection curve between two surfaces may be seen as two different and se...
Intersection algorithms are very important in computation of geometrical problems. Algorithms for a...
In this section, the basic ray-surface intersection algorithm based on this surface definition will ...
Point sets become an increasingly popular shape representation. Most shape processing and rendering ...
In this section, the basic ray-surface intersection algorithm based on this surface definition will ...
Point sets become an increasingly popular shape representation. Most shape processing and rendering ...