Computing the planar sections of objects is a fundamental operation in solid modeling. Subdivision method is commonly used far solving such intersection problems. In this paper, a novel revolute quadric decomposition is proposed for surfaces of revolution, which are subdivided into a set of coaxial revolute quadrics along the generatrix. This reduces the intersection problem of a plane and a surface of revolution to the intersection problem of a plane and a revolute quadric, which has robust, accurate and efficient geometric solution. Further, the intersection curves can be represented with a group of G 1 conic arcs. A new concept, valid intersection interval (VII), is introduced and a new technique, cylindrical bounding shell clipping, is ...
We present the first exact, complete and efficient implementation that computes for a given set $P=\...
Site de la conférence : http://www.io.tudelft.nl/caidcd2005/In BRep geometric modeling system, the p...
We present the first exact, complete and efficient implementation that computes for a given set P = ...
Computing the planar sections of objects is a fundamental operation in solid modeling. Subdivision m...
Computing the planar sections of objects is a fundamen-tal operation in solid modeling. Subdivision ...
Surface subdivision has been one of the most efficient techniques for surface representation, render...
Surfaces of revolution belong to an important class of geometric models with simpler shape character...
Surface intersection is one of fundamental operations in the geometric modeling. In the past few dec...
A novel algorithm for computing RSIC intersection curves of two surfaces of revolution is presented,...
An efficient method to compute and represent the intersection between a plane and a surface-of revol...
This paper presents a novel method for the subdivision of surfaces of revolution. We develop a new t...
This paper presents a marching method for computing intersection curves between two solids represent...
Computer surface intersections is fundamental problem in geometric modeling. Any Boolean operation c...
The use of discrete data to represent engineering structures as derivatives from intersecting compon...
A novel algebraic method is used to determine the intersection between two bi-quadratic surfaces. Th...
We present the first exact, complete and efficient implementation that computes for a given set $P=\...
Site de la conférence : http://www.io.tudelft.nl/caidcd2005/In BRep geometric modeling system, the p...
We present the first exact, complete and efficient implementation that computes for a given set P = ...
Computing the planar sections of objects is a fundamental operation in solid modeling. Subdivision m...
Computing the planar sections of objects is a fundamen-tal operation in solid modeling. Subdivision ...
Surface subdivision has been one of the most efficient techniques for surface representation, render...
Surfaces of revolution belong to an important class of geometric models with simpler shape character...
Surface intersection is one of fundamental operations in the geometric modeling. In the past few dec...
A novel algorithm for computing RSIC intersection curves of two surfaces of revolution is presented,...
An efficient method to compute and represent the intersection between a plane and a surface-of revol...
This paper presents a novel method for the subdivision of surfaces of revolution. We develop a new t...
This paper presents a marching method for computing intersection curves between two solids represent...
Computer surface intersections is fundamental problem in geometric modeling. Any Boolean operation c...
The use of discrete data to represent engineering structures as derivatives from intersecting compon...
A novel algebraic method is used to determine the intersection between two bi-quadratic surfaces. Th...
We present the first exact, complete and efficient implementation that computes for a given set $P=\...
Site de la conférence : http://www.io.tudelft.nl/caidcd2005/In BRep geometric modeling system, the p...
We present the first exact, complete and efficient implementation that computes for a given set P = ...