Vissarion Fisikopoulos

4 Followers

computational geometry c++ sampling polytopes statistics experimental analysis volume computation mathematical software monte carlo combinatorics gis software computations convex polytopes polytope theory newton polytope geography boost secondary polytope algorithms marcov chains r software development experiments algorithm engineering algebraic geometry convex hull regular triangulation general dimension cgal implementation cayley trick orientation predicate experimental complexity hashing mixed subdivision point location determinant algorithms polynomial resultant resultant polynomial structural biology finance random walks integration open source trajectories engineering artificial inteligence optimization geometric predicates regular triangulations newton poly-tope of sparse resultant 2-level polytopes resultants complexity volume mathematics mysql libraries

Activity
About

Vissarion Fisikopoulos

Presentations

Combinatorics of 4-dimensional Resultant Polytopes

An algorithm for computing resultant polytopes

Faster Geometric Algorithms via Dynamic Determinant Computation

The Earth is not flat; but it's not round either (Geography on Boost.Geometry)

Geodesic algorithms: an experimental study

Volume computation and applications

A new practical algorithm for volume estimation using annealing of convex bodies

Efficient Random-Walk Methods forApproximating Polytope Volume

Volume and edge skeleton computation in high dimensions

The Newton polytope of the sparse resultant

Polyhedral computations in computational algebraic geometry and optimization

Enumeration of 2-level polytopes

High-dimensional polytopes defined by oracles: algorithms, computations and applications

Conctructing Polytopes via a Vertex Oracle

High-dimensional sampling and volume computation

Working with spatial trajectories in Boost Geometry

High-dimensional polytopes defined by oracles: algorithms, computations and applications

Efficient Edge-Skeleton Computation for Polytopes Defined by Oracles

"Combinatorics of 4-dimensional resultant polytopes"

Efficient Volume and Edge-Skeleton Computation for Polytopes Given by Oracles

Oracle-based algorithms for high-dimensional polytopes.

"Faster Geometric Algorithms via Dynamic Determinant Computation."

"An output-sensitive algorithm for computing projections of resultant polytopes."

"Exact and approximate algorithms for resultant polytopes."

"Regular triangularions and resultant polytopes."

"Mesh of Periodic Minimal Surfaces in CGAL."

High-dimensional sampling and volume computation

volesti: sampling efficiently from high dimensional distributions

Efficient sampling of constraint spaces in practice