J.-W. Ahn, M.-S. Kim, and S.-B. Lim, Approximate general sweep boundary of a 2D curved object, Comput. Vision, Graph. & Image Proc., 55(2): 98--128, 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....calligraphic fonts that are useful in printing and displaying Chinese. The method must have a way of representing characters in the computer, such as using cubic Bezier curves and straight lines [2, 3] or skeletal strokes [4] One could also base the representation on the brush stroke s boundary [5, 6, 7, 8] or its trajectory [9] Shamir and Rappoport have introduced a parametric method to compactly represent existing outline based oriental fonts [10] Ip et al. discussed a method to encode Chinese calligraphic characters using automatic fractal shape coding [11] Given the representation of a ....

J.-W. Ahn, M.-S. Kim, and S.-B. Lim, Approximate general sweep boundary of a 2D curved object, Comput. Vision, Graph. & Image Proc., 55(2): 98--128, 1993.

....work pertaining to analysis and formulations for swept volume techniques, we cite those that have appeared in recent years and refer the reader to visit the web page dedicated to swept volumes research and applications [www.icaen.uiowa.ed am sweep sweept] Recent work in the field include Refs. [3 16]. The consecutive sweep of a geometric entity in a Computer Aided Design (CAD) environment is a very effective method for producing complex solids as was shown in recent work by [17] In this paper, we present an effective method to formulate the sweep equation for multiple revolve and extrude ....

Ahn JC, Kim MS, Lim SB. Approximate general sweep boundary of 2D curved object. CVGIP: Computer Vision Graphics and Image Processing 1997;55:98--128.

....to the convolution curve C 1 C 2 . Kaul and Farouki [23] suggested another piecewise linear approximation. Without using any preprocessing, they generated a sequence of discrete points along the convolution curve on the fly, by computing Equation (3.5) for two input curve segments. Ahn et al. [1] considered the general sweep in which the moving object may change its shape and orientation dynamically while tracing along a trajectory curve. They computed the boundary of a general sweep by approximating the sweep envelope curve with line segments. As in the case of offset computation, it is ....

Ahn, J.-W., Kim, M.-S., and Lim, S.-B. (1993): Approximate general sweep boundary of a 2D curved object. CVGIP: Graphical Models and Image Processing, 55(2):98--128.

....robust implementation today involves using polygonal approximations of the convolution curve segments and determining the arrangement of resulting line segments. See Guibas and Marimont [9] for the state of the art of robust arrangement algorithms for line segments in the plane. Ahn et al. [1] demonstrated the e ciency and robustness of an arrangement technique for line segments in approximating the boundary of a 2D general sweep. General sweep is the most general form of sweep in which the moving object changes its shape dynamically while moving along a trajectory curve. Minkowski sum ....

....boundary of a 2D general sweep. General sweep is the most general form of sweep in which the moving object changes its shape dynamically while moving along a trajectory curve. Minkowski sum computation is a special case of general sweep computation. Therefore, the general technique of Ahn et al. [1] can be applied to the case of the Minkowski sum computation. However, there are some computational shortcuts in the special case of the Minkowski sum computation [14] In this section we consider other x y O 1 O 2 (a) b) c) curve segment vertex vertex convex concave convex concave Type 1 ....

J.-W. Ahn, M.-S. Kim, and S.-B. Lim. Approximate general sweep boundary of a 2D curved object. CVGIP: Graphical Models and Image Processing, 55(2):98-128, 1993.

....Figure 4(c) The object O 1 ( O 2 ) is called the Con guration space (C space) obstacle of O 1 with respect to the moving object O 2 . The Minkowski sum has many other applications. In Figure 5, an outline font is designed by sweeping an ellipse (with a xed orientation) along a skeleton curve [1, 15, 16]. The Minkowski sum can be used in shape transformation (i.e. metamorphosis or morphing) between two objects [24] Figure 6 shows such an example of shape transformation between two planar objects. The intermediate shapes are the Minkowski sums of the character shapes T and M while scaling ....

....paramount importance of the Minkowski sum operation in practice, conventional convolution curve computation methods have many limitations. Exact methods [3, 15, 27] generate convolution curves which are algebraic analytic curves; however, they are not rational, in general. Approximation methods [1, 25, 29] generate polygonal approximations, which may not be acceptable in many CAD systems due to data proliferation. Moreover, error analysis has not been seriously considered in the conventional approximation methods. The Minkowski sum boundary construction requires an algorithm which can determine the ....

[Article contains additional citation context not shown here]

J.-W. Ahn, M.-S. Kim, and S.-B. Lim. Approximate general sweep boundary of a 2D curved object. CVGIP: Graphical Models and Image Processing, 55(2):98-128, March 1993.

....approximation to the convolution curve C 1 C 2 . Kaul and Farouki [22] suggested another piecewise linear approximation. Without using any preprocessing, they generated a sequence of discrete points along the convolution curve on the y, by computing (21) for two input curve segments. Ahn et al. [1] considered the general sweep in which the moving object may change its shape and orientation dynamically while tracing along a trajectory curve. They computed the boundary of a general sweep by approximating the sweep envelope curve with line segments. As in the case of o set computation, it is ....

Ahn, J.-W., Kim, M.-S., and Lim, S.-B.: Approximate general sweep boundary of a 2D curved object. CVGIP: Graphical Models and Image Processing, 55 (1993) 98-128

....[14] The only reliable robust implementation today is to use polygonal approximations of the o set curve segments and determine the arrangement of resulting line segments. See Reference [12] for the current state of the art of robust line segments arrangement in the plane. Ahn, Kim, and Lim [1] demonstrated the e ciency and robustness (a) b) c) d) e) f) g) h) i) Global Loop Local Loops Figure 10: Elimination of Self Intersection Loops of this technique in approximating the boundary of a 2D general sweep. The general sweep is the most general form of sweep in which the ....

....boundary of a 2D general sweep. The general sweep is the most general form of sweep in which the moving object changes its shape dynamically while moving along a trajectory curve. The o set computation is a special case of general sweep computation. Therefore, the general technique of Reference [1] can be applied to the case of o setting. There are also some computational shortcuts to be applied in the special case of o setting [20] The input curve is approximated by discrete points and their connecting piecewise line segments (Figure 10 (b) The o set curve is then approximated by the ....

[Article contains additional citation context not shown here]

Ahn, J.-W., Kim, M.-S., and Lim, S.-B., (1993), \Approximate General Sweep Boundary of a 2D Curved Object," CVGIP: Graphical Models and Image Processing , Vol. 55, No. 2, pp. 98-128.

....approximation to the convolution curve C 1 C 2 . Kaul and Farouki [22] suggested another piecewise linear approximation. Without using any preprocessing, they generated a sequence of discrete points along the convolution curve on the fly, by computing (21) for two input curve segments. Ahn et al. [1] considered the general sweep in which the moving object may change its shape and orientation dynamically while tracing along a trajectory curve. They computed the boundary of a general sweep by approximating the sweep envelope curve with line segments. As in the case of offset computation, it is ....

Ahn, J.-W., Kim, M.-S., and Lim, S.-B.: Approximate general sweep boundary of a 2D curved object. CVGIP: Graphical Models and Image Processing, 55 (1993) 98--128

....The object O 1 Phi ( GammaO 2 ) is called the Configuration space (C space) obstacle of O 1 with respect to the moving object O 2 . The Minkowski sum has many other applications. In Figure 5, an outline font is designed by sweeping an ellipse (with a fixed orientation) along a skeleton curve [1, 15, 16]. The Minkowski sum can be used in shape transformation (i.e. metamorphosis or morphing) between two objects [24] Figure 6 shows such an example of shape transformation between two planar objects. The intermediate shapes are the Minkowski sums of the character shapes T and M while scaling ....

....paramount importance of the Minkowski sum operation in practice, conventional convolution curve computation methods have many limitations. Exact methods [3, 15, 27] generate convolution curves which are algebraic analytic curves; however, they are not rational, in general. Approximation methods [1, 25, 29] generate polygonal approximations, which may not be acceptable in many CAD systems due to data proliferation. Moreover, error analysis has not been seriously considered in the conventional approximation methods. The Minkowski sum boundary construction requires an algorithm which can determine the ....

[Article contains additional citation context not shown here]

J.-W. Ahn, M.-S. Kim, and S.-B. Lim. Approximate general sweep boundary of a 2D curved object. CVGIP: Graphical Models and Image Processing, 55(2):98--128, March 1993.

No context found.

Ahn, J. W., Kim, M. S. and Lim, S. B., Approximate general sweep boundary of a 2D curved object. Computer Vision, Graphics and Image Processing, 1993, 55(2), 98--128.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC