11 citations · 14 across the 2 of their papers we have counts for
3 papers
cs.CG2013★ 3 cited
An Algorithm for Computing Constrained Reflection Paths in Simple Polygon
Arijit Bishnu, Subir Kumar Ghosh, Partha Pratim Goswami +2
Let be a source point and be a destination point inside an -vertex simple polygon . Euclidean shortest paths and minimum-link paths between and inside hav…
cs.CG2011
Localized Geometric Query Problems
John Augustine, Sandip Das, Anil Maheshwari +3
A new class of geometric query problems are studied in this paper. We are required to preprocess a set of geometric objects in the plane, so that for any arbitrary query point…
cs.CG2010★ 11 cited
Querying for the Largest Empty Geometric Object in a Desired Location
John Augustine, Sandip Das, Anil Maheshwari +3
We study new types of geometric query problems defined as follows: given a geometric set , preprocess it such that given a query point , the location of the largest circle th…