Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
A note on hyperplane generation
Journal of Combinatorial Theory Series B
How good are convex hull algorithms?
Computational Geometry: Theory and Applications
On the Complexity of Some Enumeration Problems for Matroids
SIAM Journal on Discrete Mathematics
The Bergman complex of a matroid and phylogenetic trees
Journal of Combinatorial Theory Series B
On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes
Discrete & Computational Geometry
SIAM Journal on Discrete Mathematics
A Course in Computational Algebraic Number Theory
A Course in Computational Algebraic Number Theory
Computing tropical linear spaces
Journal of Symbolic Computation
| Hi-index | 0.00 |
In this paper we study algorithmic aspects of tropical intersection theory. We analyze how divisors and intersection products on tropical cycles can actually be computed using polyhedral geometry. The main focus of this paper is the study of moduli spaces, where the underlying combinatorics of the varieties involved allow a much more efficient way of computing certain tropical cycles. The algorithms discussed here have been implemented in an extension for polymake, a software for polyhedral computations.