Swami Sarvattomananda

According to our database, Swami Sarvattomananda authored at least 16 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes.

Sandip Das, Subhadeep Ranjan Dev, Swami Sarvattomananda

Discret. Appl. Math., 2024

2023

Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane.

Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022

Preface: CALDAM 2019.

Swami Sarvattamananda, Sudebkumar Prasant Pal

Discret. Appl. Math., 2022

Voronoi Games Using Geodesics.

Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

Voronoi game on polygons.

Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda

Theor. Comput. Sci., 2021

Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions.

Sandip Das, Ayan Nandy, Swami Sarvottamananda

Discret. Appl. Math., 2021

2020

Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints.

Sandip Das, Ayan Nandy, Swami Sarvottamananda

Discret. Appl. Math., 2020

Optimizing movement in convex and non-convex path-networks to establish connectivity.

Sandip Das, Ayan Nandy, Swami Sarvottamananda

Discret. Appl. Math., 2020

Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints.

Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvottamananda

Proceedings of the Combinatorial Optimization and Applications, 2020

2018

Computing the Minkowski Sum of Convex Polytopes in R^d.

Sandip Das, Swami Sarvottamananda

CoRR, 2018

2016

Linear Time Algorithm for 1-Center in R^d Under Convex Polyhedral Distance Function.

Sandip Das, Ayan Nandy, Swami Sarvottamananda

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

Linear Time Algorithms for Euclidean 1-Center in \mathfrak R^d with Non-linear Convex Constraints.

Sandip Das, Ayan Nandy, Swami Sarvottamananda

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2013

An Algorithm for Computing Constrained Reflection Paths in Simple Polygon

Arijit Bishnu, Subir Kumar Ghosh, Partha P. Goswami, Sudebkumar Prasant Pal, Swami Sarvattomananda

CoRR, 2013

Localized geometric query problems.

John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda

Comput. Geom., 2013

2012

Algorithms for computing diffuse reflection paths in polygons.

Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda

Vis. Comput., 2012

2010

Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location

John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda

CoRR, 2010