Geometric Modeling and Processing, 2004. Proceedings, 2004
We present efficient and robust algorithms for intersecting a freeform surface with a ringed surf... more We present efficient and robust algorithms for intersecting a freeform surface with a ringed surface or a ruled surface. A ringed surface is given as a one-parameter family of circles. By computing the intersection between a freeform surface and each circle in the family, we can solve the intersection problem. We propose two approaches which are closely related to each
Proceedings the Eighth Pacific Conference on Computer Graphics and Applications, 2000
Page 1. The Intersection of Two Ringed Surfaces Hee-Seok Heo, Sung Je Hong Dept. of Computer Scie... more Page 1. The Intersection of Two Ringed Surfaces Hee-Seok Heo, Sung Je Hong Dept. of Computer Science ... Except for some re-dundant solutions and degenerate cases, there is a rational map from each solution of X(u, U) = 0 to the intersection point Cy nC;. ...
Proceedings of the 21st spring conference on Computer graphics - SCCG '05, 2005
We review a family of related techniques for geometric computations in the parameter space of fre... more We review a family of related techniques for geometric computations in the parameter space of freeform curves and surfaces. Geometric constraint equations for freeform curves and surfaces have low degrees (often linear or quadratic) in x,y,z and considerably higher degrees in the curve or surface parameters. We eliminate x,y, and z, so that the constraints are expressed in terms of
International Conference on Shape Modeling and Applications 2005 (SMI' 05), 2005
We propose an algorithm for contouring k-manifolds (k = 1,2) embedded in an arbitrary n-dimension... more We propose an algorithm for contouring k-manifolds (k = 1,2) embedded in an arbitrary n-dimensional space. We assume (n -k) geometric constraints are represented as polynomial equations in n variables. The common zero-set of these (n-k) equations is computed as an 1-or 2-manifold, respectively, for k = 1 or k = 2. In the case of 1-manifolds, this framework is
CVGIP: Graphical Models and Image Processing, 1993
Jae-Woo Ahn Department of Computer Science, POSTECH, PO Box 125, Pohang 790-600, Korea. ... Myung... more Jae-Woo Ahn Department of Computer Science, POSTECH, PO Box 125, Pohang 790-600, Korea. ... Myung-Soo Kim Department of Computer Science, POSTECH, PO Box 125, Pohang 790-600, Korea. ... Soon-Bum Lim Printer Business Division Trigem Computer, Inc. ...
We propose a variational approach to computing an optimal segmentation of a 3D shape for computin... more We propose a variational approach to computing an optimal segmentation of a 3D shape for computing a union of tight bounding volumes. Based on an affine invariant measure of e-tightness, the resemblance to ellipsoid, a novel functional is formulated that governs an optimization process to obtain a partition with multiple components. Refinement of segmentation is driven by application-specific error measures,
Geometric Modeling and Processing, 2004. Proceedings, 2004
We present efficient and robust algorithms for intersecting a freeform surface with a ringed surf... more We present efficient and robust algorithms for intersecting a freeform surface with a ringed surface or a ruled surface. A ringed surface is given as a one-parameter family of circles. By computing the intersection between a freeform surface and each circle in the family, we can solve the intersection problem. We propose two approaches which are closely related to each
Proceedings the Eighth Pacific Conference on Computer Graphics and Applications, 2000
Page 1. The Intersection of Two Ringed Surfaces Hee-Seok Heo, Sung Je Hong Dept. of Computer Scie... more Page 1. The Intersection of Two Ringed Surfaces Hee-Seok Heo, Sung Je Hong Dept. of Computer Science ... Except for some re-dundant solutions and degenerate cases, there is a rational map from each solution of X(u, U) = 0 to the intersection point Cy nC;. ...
Proceedings of the 21st spring conference on Computer graphics - SCCG '05, 2005
We review a family of related techniques for geometric computations in the parameter space of fre... more We review a family of related techniques for geometric computations in the parameter space of freeform curves and surfaces. Geometric constraint equations for freeform curves and surfaces have low degrees (often linear or quadratic) in x,y,z and considerably higher degrees in the curve or surface parameters. We eliminate x,y, and z, so that the constraints are expressed in terms of
International Conference on Shape Modeling and Applications 2005 (SMI' 05), 2005
We propose an algorithm for contouring k-manifolds (k = 1,2) embedded in an arbitrary n-dimension... more We propose an algorithm for contouring k-manifolds (k = 1,2) embedded in an arbitrary n-dimensional space. We assume (n -k) geometric constraints are represented as polynomial equations in n variables. The common zero-set of these (n-k) equations is computed as an 1-or 2-manifold, respectively, for k = 1 or k = 2. In the case of 1-manifolds, this framework is
CVGIP: Graphical Models and Image Processing, 1993
Jae-Woo Ahn Department of Computer Science, POSTECH, PO Box 125, Pohang 790-600, Korea. ... Myung... more Jae-Woo Ahn Department of Computer Science, POSTECH, PO Box 125, Pohang 790-600, Korea. ... Myung-Soo Kim Department of Computer Science, POSTECH, PO Box 125, Pohang 790-600, Korea. ... Soon-Bum Lim Printer Business Division Trigem Computer, Inc. ...
We propose a variational approach to computing an optimal segmentation of a 3D shape for computin... more We propose a variational approach to computing an optimal segmentation of a 3D shape for computing a union of tight bounding volumes. Based on an affine invariant measure of e-tightness, the resemblance to ellipsoid, a novel functional is formulated that governs an optimization process to obtain a partition with multiple components. Refinement of segmentation is driven by application-specific error measures,
Uploads
Papers by Myung-soo Kim