Point clouds registration is a fundamental step of many point processing pipelines; however, most algorithms are tested on data that collected ad-hoc and not shared with the research community. These often cover only very limited set use cases; therefore, results cannot be generalised. Public datasets proposed until now, taken individually, few kinds environment mostly single sensor. For these ...

Abstract We demonstrate a quasipolynomial-time deterministic approximation algorithm for the partition function of Gibbs point process interacting via stable potential. This result holds all activities $\lambda$ which satisfies zero-free assumption in neighbourhood interval $[0,\lambda ]$ . As corollary, finiterange potentials, we obtain $\lambda \lt 1/(e^{B + 1} \hat C_\phi )$ where $\hat C_\p...

In this paper we introduce new modified implicit and explicit algorithms and prove strong convergence of the two algorithms to a common fixed point of a family of uniformly asymptotically regular asymptotically nonexpansive mappings in a real reflexive Banach space  with a uniformly G$hat{a}$teaux differentiable norm. Our result is applicable in $L_{p}(ell_{p})$ spaces, $1 < p

Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...