Related papers: From affine to barycentric coordinates in polytope…
Tutte's celebrated barycentric embedding theorem describes a natural way to build straight-line embeddings (crossing-free drawings) of a (3-connected) planar graph: map the vertices of the outer face to the vertices of a convex polygon, and…
A new algorithm for the efficient numerical approximation of weakly singular integrals over convex polytopes is introduced. Such integrals appear in the Galerkin discretizations of integral equations and nonlocal partial differential…
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…
Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…
Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the…
An affine version of the linear subspace concentration inequality as proposed by Wu is established for centered convex bodies. This generalizes results from Wu and Freyer, Henk, Kipp on polytopes to convex bodies.
In this article we define an algebraic vertex of a generalized polyhedron and show that it is the smallest set of points needed to define the polyhedron. We prove that the indicator function of a generalized polytope $P$ is a linear…
For each finite configuration of distinct points in the plane, there is an associated lattice of noncrossing partitions. When these points form the vertices of a convex polygon, the result is the classical noncrossing partition lattice,…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…
We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…
The computation of exact barycenters for a set of discrete measures is of interest in applications where sparse solutions are desired, and to assess the quality of solutions returned by approximate algorithms and heuristics. The task is…
In 1980, V. I. Arnold studied the classification problem for convex lattice polygons of a given area. Since then, this problem and its analogues have been studied by many authors, including B\'ar\'any, Lagarias, Pach, Santos, Ziegler and…
This article addresses a combinatorial problem with applications to algebraic geometry. To a convex lattice polytope $P$ and each of its integer dilations $kP$ one may associate the barycenter of its lattice points. This sequence of…
We propose a discretization of classical confocal coordinates. It is based on a novel characterization thereof as factorizable orthogonal coordinate systems. Our geometric discretization leads to factorizable discrete nets with a novel…
Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to union-closed antimatroids or learning spaces. We define an operation of resolution for convex geometries, which replaces each element of a base convex…
Sectors at centre of affine quadrics with point symmetry are investigated over arbitrary fields of characteristic different from two. As an application we demonstrate nice formulas for the area and the volume of such planar and spatial…
A fullerene graph can be embedded in a piecewise linear 2-manifold with each non-hexagonal carbon ring corresponding to a cone vertex. Adjacent two or three such vertices can be combined as a cluster cut out from a parent cone round a…
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials (written as sums of monomials). We give recurrence formulae…
Deleting a hyperplane from a polar space associated with a symplectic polarity we get a specific, symplectic, affine polar space. Similar geometry, called an \afsempol\ arises as a result of generalization of the notion of an alternating…