Abstract—We want to estimate the chord length Λ of a given rational Bézier curve efficiently. Since rational Bézier are nonlinear function, it is generally impossible to evaluate its length exactly. We approximate the length by using subdivision and we investigate the accuracy of the approximation Λn. In order to improve the efficiency, we use adaptivity with some length estimator. Additionally, we will give a rigorous theoretical analysis of the rate of convergence of Λn to Λ. We analyze also the required number of subdivisions in order to attain a prescribed accuracy. At the end, we briefly describe an application in CAD surface parametrization
This paper presents an algorithm for optimal multi-degree reduction of ra-tional disk Bézier curve ...
We show that the chord length parameter assignment is exact for circle segments in standard rational...
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. The...
The length of a given rational B'ezier curve is efficiently estimated. Since a rational B'ezier fun...
ABSTRACT. In this paper, we present arc-length estimations for quadratic rational Bézier curves usi...
AbstractIt is an often used fact that the control polygon of a Bézier curve approximates the curve a...
It is frequently important to approximate a rational Bézier curve by an integral, i.e., polynomial ...
It has been recently proved that rational quadratic circles in standard Bezier form are parameterize...
Summary. In this paper the approximation of a cubic Bèzier curve by quadratic Bèzier curves is pre...
The purpose of this paper is to discuss length estimation based on digitized curves. Information on ...
In this paper, we propose a method to obtain a constrained approximation of a rational Bézier curve...
In computer graphics one often needs to convert a given Bézier curve to a polygon (i.e., to a sequen...
Properties of a parametric curve in R3 are often deter-mined by analysis of its piecewise linear (PL...
In this paper the approximation of a cubic Bèzier curve by quadratic Bèzier curves is presented. For...
The paper details two linear-time algorithms, one for the partition of the boundary line of a digita...
This paper presents an algorithm for optimal multi-degree reduction of ra-tional disk Bézier curve ...
We show that the chord length parameter assignment is exact for circle segments in standard rational...
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. The...
The length of a given rational B'ezier curve is efficiently estimated. Since a rational B'ezier fun...
ABSTRACT. In this paper, we present arc-length estimations for quadratic rational Bézier curves usi...
AbstractIt is an often used fact that the control polygon of a Bézier curve approximates the curve a...
It is frequently important to approximate a rational Bézier curve by an integral, i.e., polynomial ...
It has been recently proved that rational quadratic circles in standard Bezier form are parameterize...
Summary. In this paper the approximation of a cubic Bèzier curve by quadratic Bèzier curves is pre...
The purpose of this paper is to discuss length estimation based on digitized curves. Information on ...
In this paper, we propose a method to obtain a constrained approximation of a rational Bézier curve...
In computer graphics one often needs to convert a given Bézier curve to a polygon (i.e., to a sequen...
Properties of a parametric curve in R3 are often deter-mined by analysis of its piecewise linear (PL...
In this paper the approximation of a cubic Bèzier curve by quadratic Bèzier curves is presented. For...
The paper details two linear-time algorithms, one for the partition of the boundary line of a digita...
This paper presents an algorithm for optimal multi-degree reduction of ra-tional disk Bézier curve ...
We show that the chord length parameter assignment is exact for circle segments in standard rational...
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. The...