• International Journal of CAD/CAM
• /
• v.5 no.1
• /
• pp.91-98
• /
• 2005

This paper presents a scheme for interpolating intersecting uniform cubic B-spline curves by Catmull-Clark subdivision surfaces. The curves are represented by polygonal complexes and the neighborhoods of intersection points are modeled by X-Configurations. When these structures are embedded within a control polyhedron, the corresponding curves will automatically be interpolated by the surface limit of subdivision of the polyhedron. The paper supplies a construction which clearly shows that interpolation can still be guaranteed even in the absence of symmetry at the X-configurations. In this sense, this scheme generalizes an already existing technique by the same authors, thereby allowing more freedom to designers.

• Journal of Computing Science and Engineering
• /
• v.4 no.3
• /
• pp.240-252
• /
• 2010

One of the important open problems in modeling plants is the extension of subdivision algorithms to branching structures. Most of the applications use the concept of L-system to produce branching structures as a sequence of lines and apply the subdivision scheme to appear as curves. In this paper, we explain how L-systems can be modified to produce branching structures. This is also very useful for generating the geometry of various shapes. The proposed technique, called an adaptive L-System, describes branching forms and leaves by making local curve without applying the subdivision steps. Advantages of the suggested algorithm over previous techniques are given. Validation of the algorithm are discussed, analyzed and illustrated by some experimental results.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.235-246
• /
• 2005

We present an interpolating, univariate subdivision scheme which preserves the discrete curvature and tangent direction at each step of subdivision. Since the polygon have a geometric information of some original(in some sense) curve as a discrete curvature, we can expect that the limit curve has the same curvature at each vertex as the control polygon. We estimate the curvature bound of odd vertices and give an error estimate for restoring a curve from sampled vertices on curves.

• Journal of the Korean Society for information Management
• /
• v.25 no.3
• /
• pp.357-375
• /
• 2008

With the rapid distribution and active usage of the Internet, information search and retrieval through Internet has become a primary form of information access. This ubiquity of information access through Internet means the increased significance of search performance offered by Internet portals, since the optimization of search performance by portal has strong implication for the effective access of information through Internet in general. In this context, this paper investigates the classification scheme used in the directory service of internet portals, which provides selected and organized access to Internet information. First, the author analyzes the deployment of directory classification of standard subdivision topics used in traditional library classification system, with emphasis on the table composed of the form and approach, which are applicable to diverse subject areas. Then, based on this analysis, he proposed a method of applying certain subdivisions of the standard subdivision to directory service of Internet portals.

• ETRI Journal
• /
• v.35 no.6
• /
• pp.1115-1125
• /
• 2013

This paper presents a scheme for geometric correction of projected content for planar and quadratic projection surfaces. The scheme does not require the projection surface to be perfectly quadratic or planar and is therefore suitable for uneven low-cost commercial and home projection surfaces. An approach based on the recursive subdivision of second-order B$\acute{e}$zier patches is proposed for the estimation of projection distortion owing to surface imperfections. Unlike existing schemes, the proposed scheme is completely automatic, requires no prior knowledge of the projection surface, and uses a single uncalibrated camera without requiring any physical markers on the projection surface. Furthermore, the scheme is scalable for geometric calibration of multi-projector setups. The efficacy of the proposed scheme is demonstrated using simulations and via practical experiments on various surfaces. A relative distortion error metric is also introduced that provides a quantitative measure of the suppression of geometric distortions, which occurs as the result of an imperfect projection surface.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.17 no.2
• /
• pp.151-160
• /
• 2004

In the present study, Loop scheme is applied to generate smooth surfaces. To be consistent with the limit points of target surface, the initial sampling points are properly rearranged. The pointwise errors of curvature and position in the sequence of subdivision process are evaluated in the Loop subdivision scheme. A first-order shear deformable Loop subdivision triangular element which can handle transverse shear deformation of moderately thick shell are developed. The developed element is more general than the previous one based on classical shell theory, since the new one includes the effect of transverse shear deformation and has standard six degrees of freedom per node. The quartic box spline function is used as interpolation basis function. Numerical examples for the benchmark static shell problems are analyzed to assess the performance of the developed subdivision shell element and locking trouble.

• East Asian mathematical journal
• /
• v.38 no.3
• /
• pp.365-377
• /
• 2022

In this paper, we present a new class of interpolatory Hermite subdivision schemes of order 2 reproducing polynomials. Each member in this class, denoted by H_n for n ≥ 1, preserves polynomials of degree up to 4n + 1 admitting the approximation order of 4n + 2. Furthermore, it has free parameters which provide flexibility in designing curves/surfaces. H₁, the simplest and the most attractive scheme in this class, achieves C⁴ smoothness with the parameters in certain ranges, and its performance is demonstrated with numerical examples.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.3
• /
• pp.184-192
• /
• 2001

In this paper we present a remeshing algorithm for irregular meshes with boundaries. The irregular meshes are approximated by regular meshes where the topological regularity is essential for the multiresolutional analysis of the given meshes. Normal meshes are utilized to reduce the necessary data size at each resolution level of the regularized meshes. The normal mesh uses one scalar value, i.e., normal offset value which is based on the regular rule of a uniform subdivision, while other remeshing schemes use one 3D vector at each vertex. Since the normal offset cannot be properly used for the boundaries of meshes, we use a combined subdivision scheme which resolves a problem of the proposed normal offset method at the boundaries. Finally, we show an example to see the effectiveness of the proposed scheme to reduce the data size of a mesh model.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.9 s.186
• /
• pp.190-199
• /
• 2006

A new approach which combines implicit surface scheme and recursive subdivision method is suggested in order to fill the holes with complex shapes in the polygon model. In the method, a base surface is constructed by creating smooth implicit surface from the points selected in the neighborhood of holes. In order to assure C$^1$ continuity between the newly generated surface and the original polygon model, offset points of same number as the selected points are used as the augmented constraint conditions in the calculation of implicit surface. In this paper the well-known recursive subdivision method is used in order to generate the triangular net with good quality using the hole boundary curve and generated base implicit surface. An efficient anisotropic smoothing algorithm is introduced to eliminate the unwanted noise data and improve the quality of polygon model. The effectiveness and validity of the proposed method are demonstrated by performing numerical experiments for the various types of holes and polygon model.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.8
• /
• pp.547-553
• /
• 2006

We present a new geometry coding method for 3D meshes, an adaptive subdivision. Previous localized geometry coding methods have demonstrated better compression ratios than the global approach but they are considered hard to use in practice partly due to time - consuming quantization. Our new localized scheme replaces this quantization with an adaptive subdivision of the localized range. The deeper level a user chooses, the closer to the original the mesh will be restored. We also present an improved connectivity coder upon the current leading Angle-Analyzer's by applying a context-modeling. As a result, our new coder provides reliable and intuitive controls between bit-rate and distortion without losing efficiency.