We present a new fairing method for planar curves, which is particularly well suited for the regularization of the medial axis of a planar domain. It is based on the concept of total variation regularization. The original boundary (given as a closed B-spline curve or several such curves for multiply connected domains) is approximated by another curve that possesses a smaller number of curvature...

Adaptive algorithms for load-sharing usually comprise two basic functions: state information dissemination and decision making (control). This paper describes a flexible load-sharing algorithm, FLS, which includes a third function introduced for scalability purposes, that of partitioning into domains. The system partitioning function at a node is responsible for the selection of other nodes to ...

This paper presents two new algorithms for computing a planar homography from conic correspondences. Firstly, we propose a linear algorithm for computing the homography when there are three or more conic correspondences. In this case, we get an overdetermined set of linear equations and the solution that minimizes the algebraic distance is obtained by the singular value decomposition. Secondly,...

A new method to fit specific types of conics to scattered data points is introduced. Direct, specific fitting of ellipses and hyperbolae is achieved by imposing a quadratic constraint on the conic coefficients, whereby an improved partitioning of the design matrix is devised so as to improve computational efficiency and numerical stability by eliminating redundant aspects of the fitting procedu...

We present a convex conic relaxation for a problem of maximizing an indefinite quadratic form over a set of convex constraints on the squared variables. We show that for all these problems we get at least 12 37 -relative accuracy of the approximation. In the second part of the paper we derive the conic relaxation by another approach based on the second order optimality conditions. We show that ...

Privacy-preserving computational geometry is a special secure multi-party computation and has many applications. In recent years, many scholars have focused on privacy-preserving computational geometry problems which are based on circle and polygon. However, as a branch of computational geometry problems, the private-computing on conic sections must be considered. Consequently, we study secure ...