A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes.
Discret. Appl. Math., 2024
Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023
Discret. Appl. Math., 2022
Voronoi Games Using Geodesics.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022
Voronoi game on polygons.
Theor. Comput. Sci., 2021
Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions.
Discret. Appl. Math., 2021
Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints.
Discret. Appl. Math., 2020
Optimizing movement in convex and non-convex path-networks to establish connectivity.
Discret. Appl. Math., 2020
Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2020
Computing the Minkowski Sum of Convex Polytopes in R<sup>d</sup>.
CoRR, 2018
Linear Time Algorithm for 1-Center in R<sup>d</sup> Under Convex Polyhedral Distance Function.
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.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016
An Algorithm for Computing Constrained Reflection Paths in Simple Polygon
CoRR, 2013
Localized geometric query problems.
Comput. Geom., 2013
Algorithms for computing diffuse reflection paths in polygons.
Vis. Comput., 2012
Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location
CoRR, 2010