Computing the Minkowski Sum of Convex Polytopes in $\Re^d$

Autor: Das, Sandip, Sarvottamananda, Swami

We propose a method to efficiently compute the Minkowski sum, denoted by binary operator $\oplus$ in the paper, of convex polytopes in $\Re^d$ using their face lattice structures as input. In plane, the Minkowski sum of convex polygons can be compute

Externí odkaz: http://arxiv.org/abs/1811.05812

Linear time algorithms for Euclidean 1-center in [formula omitted] with non-linear convex constraints

Autor: Das, Sandip, Nandy, Ayan, Sarvottamananda, Swami

Publikováno v: In Discrete Applied Mathematics 15 June 2020 280:71-85

Linear Time Algorithms for Euclidean 1-Center in $$\MATHFRAK {R}^D$$ with Non-linear Convex Constraints.

Autor: Das, Sandip, Nandy, Ayan, Sarvottamananda, Swami

Publikováno v: Algorithms & Discrete Applied Mathematics: Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings; 2016, p126-138, 13p