Add to ORKGWe study the convexity of curves defined by the combination of control points and blending functions, that are globally controlled. We provide a method using which the convexity of the curve can be determined by the location of one of its control points
A model for computing the weights of the control vertices of a rational curve with respect to the co...
The blending or filleting of sharp corners is a common requirement in geometric design applications ...
Several geometric criteria to fit a polygonal closed curve to discrete two-dimensional data are cons...
A method is presented for controlling the convexity of interpolant curves based on a rational cubic ...
Abstract—Based on the original geometrical definition of the planar parametric convex curve, the loc...
Shape descriptors are used in many computer vision tasks. Convexity is one of the most widely used s...
This report discusses the problem of modifying the shape of a cubic B-spline curve while retaining i...
AbstractWe analyze convexity preserving properties of curves from a geometric point of view. We also...
This paper presents a necessary and sufficient condition for global convexity of planar curves and s...
A scheme for generating plane curves which interpolates given data is described. A curve is obtained...
Shape descriptors are used in many computer vision tasks. Convexity is one of the most widely used s...
Convexity represents a fundamental descriptor of object shape. This paper presents a new convexity ...
The direct control mechanisms described in this dissertation allow the specification of a local or g...
We propose a method for the construction of a planar curve based on piecewise clothoids and straight...
AbstractPiecewise quartic polynomial curves with a local shape parameter are presented in this paper...
A model for computing the weights of the control vertices of a rational curve with respect to the co...
The blending or filleting of sharp corners is a common requirement in geometric design applications ...
Several geometric criteria to fit a polygonal closed curve to discrete two-dimensional data are cons...
A method is presented for controlling the convexity of interpolant curves based on a rational cubic ...
Abstract—Based on the original geometrical definition of the planar parametric convex curve, the loc...
Shape descriptors are used in many computer vision tasks. Convexity is one of the most widely used s...
This report discusses the problem of modifying the shape of a cubic B-spline curve while retaining i...
AbstractWe analyze convexity preserving properties of curves from a geometric point of view. We also...
This paper presents a necessary and sufficient condition for global convexity of planar curves and s...
A scheme for generating plane curves which interpolates given data is described. A curve is obtained...
Shape descriptors are used in many computer vision tasks. Convexity is one of the most widely used s...
Convexity represents a fundamental descriptor of object shape. This paper presents a new convexity ...
The direct control mechanisms described in this dissertation allow the specification of a local or g...
We propose a method for the construction of a planar curve based on piecewise clothoids and straight...
AbstractPiecewise quartic polynomial curves with a local shape parameter are presented in this paper...
A model for computing the weights of the control vertices of a rational curve with respect to the co...
The blending or filleting of sharp corners is a common requirement in geometric design applications ...
Several geometric criteria to fit a polygonal closed curve to discrete two-dimensional data are cons...