SearcharxivSearch

arXiv subjects

Jim Lawrence

Publications and source records attributed to Jim Lawrence.

10 recordsLinked to original sources

Minkowski ideals and rings

\emph{Minkowski rings} are certain rings of simple functions on the Euclidean space $W = {\mathbb{R}}^d$ with multiplicative structure derived from Minkowski addition of convex polytopes. When the ring is (finitely) generated by a set ${\cal{P}}$ of indicator functions of $n$ polytopes then the ring can be presented as ${\mathbb{C}}[x_1,\ldots,x_n]/I$ when viewed as a ${\mathbb{C}}$-algebra, where $I$ is the ideal describing all the relations implied by identities among Minkowski sums of elements of ${\cal{P}}$. We discuss in detail the $1$-dimensional case, the $d$-dimensional box case and the affine Coxeter arrangement in ${\mathbb{R}}^2$ where the convex sets are formed by closed half-planes with bounding lines making the regular triangular grid in ${\mathbb{R}}^2$. We also consider, for a given polytope $P$, the Minkowski ring $M^\pm_F(P)$ of the collection ${\cal{F}}(P)$ of the nonempty faces of $P$ and their multiplicative inverses. Finally we prove some general properties of identities in the Minkowski ring of ${\cal{F}}(P)$; in particular, we show that Minkowski rings behave well under Cartesian product, namely that $M^\pm_F(P\times Q) \cong M^{\pm}_F(P)\otimes M^{\pm}_F(Q)$ as ${\mathbb{C}}$-algebras where $P$ and $Q$ are polytopes.

math.CO

Elastic Shape Registration of Surfaces in 3D Space with Gradient Descent and Dynamic Programming

Algorithms based on gradient descent for computing the elastic shape registration of two simple surfaces in 3-dimensional space and therefore the elastic shape distance between them have been proposed by Kurtek, Jermyn, et al., and more recently by Riseth. Their algorithms are designed to minimize a distance function between the surfaces by rotating and reparametrizing one of the surfaces, the minimization for reparametrizing based on a gradient descent approach that may terminate at a local solution. On the other hand, Bernal and Lawrence have proposed a similar algorithm, the minimization for reparametrizing based on dynamic programming thus producing a partial not necessarily optimal elastic shape registration of the surfaces. Accordingly, Bernal and Lawrence have proposed to use the rotation and reparametrization computed with their algorithm as the initial solution to any algorithm based on a gradient descent approach for reparametrizing. Here we present results from doing exactly that. We also describe and justify the gradient descent approach that is used for reparametrizing one of the surfaces.

cs.GR

On Computing Elastic Shape Distances between Curves in d-dimensional Space

The computation of the elastic registration of two simple curves in higher dimensions and therefore of the elastic shape distance between them has been investigated by Srivastava et al. Assuming the first curve has one or more starting points, and the second curve has only one, they accomplish the computation, one starting point of the first curve at a time, by minimizing an L2 type distance between them based on alternating computations of optimal diffeomorphisms of the unit interval and optimal rotation matrices that reparametrize and rotate, respectively, one of the curves. We recreate the work by Srivastava et al., but in contrast to it, again for curves in any dimension, we present a Dynamic Programming algorithm for computing optimal diffeomorphisms that is linear, and justify in a purely algebraic manner the usual algorithm for computing optimal rotation matrices, the Kabsch-Umeyama algorithm, which is based on the computation of the singular value decomposition of a matrix. In addition, we minimize the L2 type distance with a procedure that alternates computations of optimal diffeomorphisms with successive computations of optimal rotation matrices for all starting points of the first curve. Carrying out computations this way is not only more efficient all by itself, but, if both curves are closed, allows applications of the Fast Fourier Transform for computing successively in an even more efficient manner, optimal rotation matrices for all starting points of the first curve.

math.DG

Partial Elastic Shape Registration of 3D Surfaces using Dynamic Programming

The computation of the elastic shape registration of two simple surfaces in 3-dimensional space and therefore of the elastic shape distance between them has been investigated by Kurtek, Jermyn, et al. who have proposed algorithms to carry out this computation. These algorithms accomplish this by minimizing a distance function between the surfaces in terms of rotations and reparametrizations of one of the surfaces, the optimization over reparametrizations using a gradient approach that may produce a local solution. Now minimizing in terms of rotations and a special subset of the set of reparametrizations, we propose an algorithm for minimizing the distance function, the optimization over reparametrizations based on dynamic programming. This approach does not necessarily produce an optimal solution for the registration and distance problem, but perhaps a solution closer to optimal than the local solution that an algorithm with a gradient approach for optimizing over the entire set of reparametrizations may produce. In fact we propose that when computing the elastic shape registration of two simple surfaces and the elastic shape distance between them with an algorithm based on a gradient approach for optimizing over the entire set of reparametrizations, to use as the input initial solution the optimal rotation and reparametrization computed with our proposed algorithm.

math.DG

Power-closed ideals of polynomial and Laurent polynomial rings

We investigate the structure of power-closed ideals of the complex polynomial ring $R = \mathbb{C}[x_1,\ldots,x_d]$ and the Laurent polynomial ring $R^{\pm} = \mathbb{C}[x_1,\ldots,x_d]^{\pm} = M^{-1}\mathbb{C}[x_1,\ldots,x_d]$, where $M$ is the multiplicative sub-monoid $M = [x_1,\ldots,x_d]$ of $R$. Here, an ideal $I$ is {\em power-closed} if $f(x_1,\ldots,x_d)\in I$ implies $f(x_1^i,\ldots,x_d^i)\in I$ for each natural $i$. In particular, we investigate related closure and interior operators on the set of ideals of $R$ and $R^{\pm}$. Finally, we give a complete description of principal power-closed ideals and of the radicals of general power-closed ideals of $R$ and $R^{\pm}$.

math.AC

Homotheties and Coverings by Convex Sets

It is shown that, for any function $g$ that is weakly increasing on compact convex sets and has the property that if $\lambda\ge 0$ and $K^\prime$ is a translate of $\lambda K$ then $g(K^\prime) =\lambda g(K)$, then for any covering $\bigcup_i X_i\supseteq X$ of a compact convex set $X$ by finitely many compact convex sets $X_i$, the inequality $g(X) \leq \sum_i g(X_i)$ holds. Among the consequences is an affirmative solution of Bang's Plank Problem.

math.MG

Gegenbauer expansions and addition theorems for a binomial and logarithmic fundamental solution of the even-dimensional Euclidean polyharmonic equation

On even-dimensional Euclidean space for integer powers of the Laplace operator greater than or equal to half the dimension, a fundamental solution of the polyharmonic equation has binomial and logarithmic behavior. Gegenbauer polynomial expansions of these fundamental solutions are obtained through a limit applied to Gegenbauer expansions of a power-law fundamental solution of the polyharmonic equation. This limit is accomplished through parameter differentiation. By combining these results with previously derived azimuthal Fourier series expansions for these binomial and logarithmic fundamental solutions, we are able to obtain addition theorems for the azimuthal Fourier coefficients. These logarithmic and binomial addition theorems are expressed in Vilenkin polyspherical geodesic polar coordinate systems and as well in generalized Hopf coordinates on spheres in arbitrary even dimensions.

math.CA

Characterization and Computation of Matrices of Maximal Trace over Rotations

The constrained orthogonal Procrustes problem is the least-squares problem that calls for a rotation matrix that optimally aligns two corresponding sets of points in d-dimensional Euclidean space. This problem generalizes to the so-called Wahba's problem which is the same problem with nonnegative weights. Given a dxd matrix M, solutions to these problems are intimately related to the problem of finding a dxd rotation matrix U that maximizes the trace of UM, i.e., that makes UM a matrix of maximal trace over rotations, and it is well known this can be achieved with a method based on the computation of the singular value decomposition (SVD) of M. As the main goal of this paper, we characterize dxd matrices of maximal trace over rotation matrices in terms of their eigenvalues, and for d = 2, 3, we show how this characterization can be used to determine whether a matrix is of maximal trace over rotation matrices. Finally, although depending only slightly on the characterization, as a secondary goal of the paper, for d = 2, 3, we identify alternative ways, other than the SVD, of obtaining solutions to the aforementioned problems.

math.OC

A Purely Algebraic Justification of the Kabsch-Umeyama Algorithm

The constrained orthogonal Procrustes problem is the least-squares problem that calls for a rotation matrix that optimally aligns two matrices of the same order. Over past decades, the algorithm of choice for solving this problem has been the Kabsch-Umeyama algorithm, which is effectively no more than the computation of the singular value decomposition of a particular matrix. Its justification, as presented separately by Kabsch and Umeyama, is not totally algebraic since it is based on solving the minimization problem via Lagrange multipliers. In order to provide a more transparent alternative, it is the main purpose of this paper to present a purely algebraic justification of the algorithm through the exclusive use of simple concepts from linear algebra. For the sake of completeness, a proof is also included of the well known and widely used fact that the orientation-preserving rigid motion problem, i.e., the least-squares problem that calls for an orientation-preserving rigid motion that optimally aligns two corresponding sets of points in d-dimensional Euclidean space, reduces to the constrained orthogonal Procrustes problem.

math.OC

The odd-even invariant and Hamiltonian circuits in tope graphs

In this paper we consider the question of the existence of Hamiltonian circuits in the tope graphs of central arrangements of hyperplanes. Some of the results describe connections between the existence of Hamiltonian circuits in the arrangement and the odd-even invariant of the arrangement. In conjunction with this, we present some results concerning bounds on the odd-even invariant. The results given here can be formulated more generally for oriented matroids and are still valid in that setting.

math.CO