Intersection algorithms are very important in computation of geometrical problems. An intersection of a line with linear or quadratic surfaces is well done, however a line intersection with other surfaces is more complex and time consuming. In this case the object is usually closed into a simple bounding volume to speed up the cases when the given line cannot intersect the given object. In this paper a new formulation of the line-torus intersection problem is given and new specification of the bounding volume for a torus is given. The presented approach is based on an idea of a line intersection with an envelope of rotating sphere that forms a torus. Due to this approach new bounding volume can be formulated which is more effective as it en...
An efficient method to compute and represent the intersection between a plane and a surface-of revol...
Intersection problems have many applications in computational geometry and geometric modeling and d...
This thesis provides efficient and robust algorithms for the computation of the intersection curve b...
Intersection algorithms are very important in computation of geometrical problems. An intersection o...
Abstract—Intersection algorithms are very important in computation of geometrical problems. An inter...
Intersection algorithms are very important in computation of geometrical problems. Algorithms for a...
Abstract. Line intersection with convex and un-convex polygons or polyhedron algorithms are well kno...
Surface intersection is one of fundamental operations in the geometric modeling. In the past few dec...
AbstractWe present a procedure to compute all the circles in the intersection curve of two tori, bas...
The use of discrete data to represent engineering structures as derivatives from intersecting compon...
Surfaces of revolution belong to an important class of geometric models with simpler shape character...
The use of discrete data to represent engineering structures as derivatives from intersecting compon...
Simple surfaces such as planes, spheres, cylinders and cones are important in mathematics and in cer...
We present an efficient algorithm to compute the intersection of algebraic and NURBS surfaces. Our a...
Several robotic and computer vision applications depend upon the efficient determination of polygona...
An efficient method to compute and represent the intersection between a plane and a surface-of revol...
Intersection problems have many applications in computational geometry and geometric modeling and d...
This thesis provides efficient and robust algorithms for the computation of the intersection curve b...
Intersection algorithms are very important in computation of geometrical problems. An intersection o...
Abstract—Intersection algorithms are very important in computation of geometrical problems. An inter...
Intersection algorithms are very important in computation of geometrical problems. Algorithms for a...
Abstract. Line intersection with convex and un-convex polygons or polyhedron algorithms are well kno...
Surface intersection is one of fundamental operations in the geometric modeling. In the past few dec...
AbstractWe present a procedure to compute all the circles in the intersection curve of two tori, bas...
The use of discrete data to represent engineering structures as derivatives from intersecting compon...
Surfaces of revolution belong to an important class of geometric models with simpler shape character...
The use of discrete data to represent engineering structures as derivatives from intersecting compon...
Simple surfaces such as planes, spheres, cylinders and cones are important in mathematics and in cer...
We present an efficient algorithm to compute the intersection of algebraic and NURBS surfaces. Our a...
Several robotic and computer vision applications depend upon the efficient determination of polygona...
An efficient method to compute and represent the intersection between a plane and a surface-of revol...
Intersection problems have many applications in computational geometry and geometric modeling and d...
This thesis provides efficient and robust algorithms for the computation of the intersection curve b...