Hyun-Chan Lee

Learn More
Presented in this paper is an algorithm to compute the intersections of a parametric regular surface with a set of parallel planes. Rather than using an ordinary surface-plane intersection algorithm repeatedly, we pre-process a surface to identify points, called topology transition points (TTP's), on the surface where the topologies of intersection curves(More)
A feature is a local shape of a product directly related to the manufacturing process. In the computer aided process planning, information on manufacturing is essential. To get the manufacturing related information from CAD data, features should be recognized. In this paper, we thoroughly investigate the composite features, which consist of interacting(More)
Protein consists of a set of atoms. Given a protein, the molecular surface of the protein is defined with respect to a probe approximating a solvent molecule. This paper presents an efficient, as efficient as the realtime, algorithm to triangulate the blending surfaces which is the most critical subset of a molecular surface. For the quick evaluation of(More)
The evaluation of points and the computations of in¯ection points or cusps on a curve are often necessary in CAGD applications. When a curve is represented in a B-spline form, such computations can be made easier once it is transformed into a set of piecewise polynomial curves in power form. The usual practice of the transformation of a B-spline curve into(More)
1983, 131-159, raised several interesting questions including the time complexity of their algorithm. In this paper, the time complexity on circumscribing an n-gon by an m-gon, where m < n, is analyzed to be O(n lg n). This is a note on the time complexity analysis for circumscribing an n-sided convex polygon by an m-sided polygon with minimum area(More)