S
Subir Kumar Ghosh
Researcher at Tata Institute of Fundamental Research
Publications - 87
Citations - 3431
Subir Kumar Ghosh is an academic researcher from Tata Institute of Fundamental Research. The author has contributed to research in topics: Visibility polygon & Polygon. The author has an hindex of 29, co-authored 84 publications receiving 3286 citations. Previous affiliations of Subir Kumar Ghosh include Masaryk University & Uppsala University.
Papers
More filters
Journal ArticleDOI
Reorientation of inclusions by combination of pure shear and simple shear
Subir Kumar Ghosh,Hans Ramberg +1 more
TL;DR: For a particular ratio of the rates of simultaneous pure shear to simple shear (sr = /.ϵ//.γ), the rate of rotation or the finite angle of rotation of a rigid elliptical inclusion embedded in a viscous medium varies in a systematic manner depending on the orientation and the axial ratio (R) of the inclusion as discussed by the authors.
Book
Visibility Algorithms in the Plane
TL;DR: Basic algorithms for point visibility, weak visibility, shortest paths, visibility graphs, link paths, and visibility queries are all discussed and several geometric properties are established through lemmas and theorems.
Proceedings ArticleDOI
An output sensitive algorithm for computing visibility graphs
Subir Kumar Ghosh,David M. Mount +1 more
TL;DR: An algorithm is presented that computes the visibility graph of s set of obstacles in time O(E + n log n), where E is the number of edges in the visibilitygraph and n is the total number of vertices in all the obstacles.
Journal ArticleDOI
An output-sensitive algorithm for computing visibility
Subir Kumar Ghosh,David M. Mount +1 more
TL;DR: An algorithm is presented that computes the visibility graph of s set of obstacles in time O(E + n log n), where E is the number of edges in the visibilitygraph and n is the total number of vertices in all the obstacles.
Journal ArticleDOI
Approximation algorithms for art gallery problems in polygons
TL;DR: This paper presents approximation algorithms for minimum vertex and edge guard problems for polygons with or without holes with a total of n vertices with the same approximation ratio of O(logn) times the optimal solution.