Related papers: From affine to barycentric coordinates in polytope…
Barycentric interpolation is arguably the method of choice for numerical polynomial interpolation. The polynomial interpolant is expressed in terms of function values using the so-called barycentric weights, which depend on the…
We present a family of complete acyclic Morse matchings on the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. In a future paper we will utilize these…
We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over…
Bargraphs are a special class of convex polyominoes. They can be identified with lattice paths with unit steps north, east, and south that start at the origin, end on the $x$-axis, and stay strictly above the $x$-axis everywhere except at…
We study the problem of estimating the barycenter of a distribution given i.i.d. data in a geodesic space. Assuming an upper curvature bound in Alexandrov's sense and a support condition ensuring the strong geodesic convexity of the…
Bolytropes are bounded subsets of an affine building that consist of all points that have distance at most $r$ from some polytrope. We prove that the points of a bolytrope describe the set of all invariant lattices of a bolytrope order,…
In target tracking and sensor fusion contexts it is not unusual to deal with a large number of Gaussian densities that encode the available information (multiple hypotheses), as in applications where many sensors, affected by clutter or…
We develop exact piecewise polynomial sequences on Alfeld splits in any spatial dimension and any polynomial degree. An Alfeld split of a simplex is obtained by connecting the vertices of an $n$-simplex with its barycenter. We show that, on…
Inspired by the Weierstrass representation of smooth affine minimal surfaces with indefinite metric, we propose a constructive process producing a large class of discrete surfaces that we call discrete affine minimal surfaces. We show that…
Brenti and Welker have shown that for any simplicial complex X, the face vectors of successive barycentric subdivisions of X have roots which converge to fixed values depending only on the dimension of X. We improve and generalize this…
The mixing operation for abstract polytopes gives a natural way to construct the minimal common cover of two polytopes. In this paper, we apply this construction to the regular convex polytopes, determining when the mix is again a polytope,…
There is a long-standing problem of repeated patterns in correspondence problems, where mismatches frequently occur because of inherent ambiguity. The unique position information associated with repeated patterns makes coordinate…
A closed convex polytope in n dimensions defined by m linear inequality constraints is considered. If L is a straight line drawn in any direction from any feasible point P, then in general, it intersects every constraint at one point,…
Let X and Y be finite dimensional normed spaces, F(X,Y) a collection of all mappings from X into Y. A mapping $P\in F(X,Y)$ is said to be piecewise affine if there exists a finite family of convex polyhedral subsets covering X and such that…
Recently, K.-Y. Wu introduced affine subspace concentration conditions for the cone volumes of polytopes and proved that the cone volumes of centered, reflexive, smooth lattice polytopes satisfy these conditions. We extend the result to…
Following the author's previous works, we continue to consider the problem of counting the number of affine conjugacy classes of polynomials of one complex variable when its unordered collection of holomorphic fixed point indices is given.…
A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying between two horizontal cross-sections spaced one unit apart. We…
Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…
This work introduces a novel tool for interactive, real-time transformations of two dimensional IFS fractals. We assign barycentric coordinates (relative to an arbitrary affine basis of $\mathbb{R}^2$) to the points that constitute the…
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…