相关论文: On the intrinsic geometry of polyhedra: Convex pol…

This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…

In this paper we aim to bring new approach into usage of Shoelace Algorithm for area calculation in convex polygons on Cartesian coordinate system, with concentration on point in polygon concept. Generalization of usage of the concept will…

Each convex combination of extreme points of a compact convex set represents a certain point of the convex set. Barycentric coordinates provide solutions to the inverse problem of expressing an element of a compact convex set as a convex…

We propose to take a look at a new approach to the study of integral polyhedra. The main idea is to give an integral representation, or matrix model representation, for the key combinatorial characteristics of integral polytopes. Based on…

In this article, we survey the primary research on polyhedral computing methods for constrained linear control systems. Our focus is on the modeling power of convex optimization, featured to design set-based robust and optimal controllers.…

Describing the geometry of the dual amplituhedron without reference to a particular triangulation is an open problem. In this note we introduce a new way of determining the volume of the tree-level NMHV dual amplituhedron. We show that…

We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…

We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…

Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry. This paper establishes sufficient conditions under which the mixed volume of several convex polytopes exactly equals the normalized…

A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…

There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees,…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

We study three families of polyhedral cones whose sections are regular simplices, cubes, and crosspolytopes. We compute solid angles and conic intrinsic volumes of these cones. We show that several quantities appearing in stochastic…

This paper is a study of the interaction between the combinatorics of boundaries of convex polytopes in arbitrary dimension and their metric geometry. Let S be the boundary of a convex polytope of dimension d+1, or more generally let S be a…

The theory of intrinsic volumes of convex cones has recently found striking applications in areas such as convex optimization and compressive sensing. This article provides a self-contained account of the combinatorial theory of intrinsic…

Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification…

We present a real-time algorithm that finds the Penetration Depth (PD) between general polygonal models based on iterative and local optimization techniques. Given an in-collision configuration of an object in configuration space, we find…

We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…

We are introducing two methods for revealing the true inflection point of data that contains or not error. The starting point is a set of geometrical properties that follow the existence of an inflection point p for a smooth function. These…

This note wants to explain how to obtain meaningful pictures of (possibly high-dimensional) convex polytopes, triangulated manifolds, and other objects from the realm of geometric combinatorics such as tight spans of finite metric spaces…