Merging of Bézier curves with box constraints

12/11/2014
by   Przemysław Gospodarczyk, et al.
0

In this paper, we present a novel approach to the problem of merging of Bézier curves with respect to the L_2-norm. We give illustrative examples to show that the solution of the conventional merging problem may not be suitable for further modification and applications. As in the case of the degree reduction problem, we apply the so-called restricted area approach -- proposed recently in (P. Gospodarczyk, Computer-Aided Design 62 (2015), 143--151) -- to avoid certain defects and make the resulting curve more useful. A method of solving the new problem is based on box-constrained quadratic programming approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/13/2015

G^k,l-constrained multi-degree reduction of Bézier curves

We present a new approach to the problem of G^k,l-constrained (k,l ≤ 3) ...
research
12/14/2012

Approximating rational Bezier curves by constrained Bezier curves of arbitrary degree

In this paper, we propose a method to obtain a constrained approximation...
research
04/10/2023

A generalization of tangent-based implicit curves

An approach to defining quadratic implicit curves is to prescribe two ta...
research
03/17/2016

Degree reduction of composite Bézier curves

This paper deals with the problem of multi-degree reduction of a composi...
research
01/10/2013

A Forgetting-based Approach to Merging Knowledge Bases

This paper presents a novel approach based on variable forgetting, which...
research
04/04/2022

Adaptive Merging on Phase Change Memory

Indexing is a well-known database technique used to facilitate data acce...
research
08/22/2015

Gaussian Mixture Reduction Using Reverse Kullback-Leibler Divergence

We propose a greedy mixture reduction algorithm which is capable of prun...

Please sign up or login with your details

Forgot password? Click here to reset