Tropical Convex Hull Computations
نویسنده
چکیده
This is a survey on tropical polytopes from the combinatorial point of view and with a focus on algorithms. Tropical convexity is interesting because it relates a number of combinatorial concepts including ordinary convexity, monomial ideals, subdivisions of products of simplices, matroid theory, finite metric spaces, and the tropical Grassmannians. The relationship between these topics is explained via one running example throughout the whole paper. The final section explains how the new version 2.9.4 of the software system polymake can be used to compute with tropical polytopes.
منابع مشابه
Tropical Convexity via Cellular Resolutions
The tropical convex hull of a finite set of points in tropical projective space has a natural structure of a cellular free resolution. Therefore, methods from computational commutative algebra can be used to compute tropical convex hulls. This approach is computationally competitive with combinatorial methods. Tropical cyclic polytopes are also presented.
متن کاملTropical Halfspaces
As a new concept tropical halfspaces are introduced to the (linear algebraic) geometry of the tropical semiring (R,min,+). This yields exterior descriptions of the tropical polytopes that were recently studied by Develin and Sturmfels [2004] in a variety of contexts. The key tool to the understanding is a newly defined sign of the tropical determinant, which shares remarkably many properties wi...
متن کاملAn Empirical Evaluation of Preconditioning Data for Accelerating Convex Hull Computations
The convex hull describes the extent or shape of a set of data and is used ubiquitously in computational geometry. Common algorithms to construct the convex hull on a finite set of n points (x,y) range from O(nlogn) time to O(n) time. However, it is often the case that a heuristic procedure is applied to reduce the original set of n points to a set of s < n points which contains the hull and so...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملL-CONVEX SYSTEMS AND THE CATEGORICAL ISOMORPHISM TO SCOTT-HULL OPERATORS
The concepts of $L$-convex systems and Scott-hull spaces are proposed on frame-valued setting. Also, we establish the categorical isomorphism between $L$-convex systems and Scott-hull spaces. Moreover, it is proved that the category of $L$-convex structures is bireflective in the category of $L$-convex systems. Furthermore, the quotient systems of $L$-convex systems are studied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008