Partha P. Goswami

Publication Activity (10 Years)

Years Active: 2002-2015
Publications (10 Years): 1

Top Topics

Computationally Efficient

Top Venues

Int. J. Comput. Geom. Appl.

ACM Comput. Surv.

Publications

Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das
Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points. Int. J. Comput. Geom. Appl. 25 (4) (2015)
Subir Kumar Ghosh, Partha P. Goswami
Unsolved problems in visibility graphs of points, segments, and polygons. ACM Comput. Surv. 46 (2) (2013)
Arijit Bishnu, Subir Kumar Ghosh, Partha P. Goswami, Sudebkumar Prasant Pal, Swami Sarvattomananda
An Algorithm for Computing Constrained Reflection Paths in Simple Polygon CoRR (2013)
Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda
Algorithms for computing diffuse reflection paths in polygons. Vis. Comput. 28 (12) (2012)
Arpita Das, Partha P. Goswami, Susanta Sen, Mahua Bhattacharya
Classification of poor contrast mammograms using a novel and fast boundary detection technique. BIBM Workshops (2011)
Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das, Partha P. Goswami
-Enclosing Axis-Parallel Square. ICCSA (3) (2011)
Ajit A. Diwan, Subir Kumar Ghosh, Partha P. Goswami, Andrzej Lingas
On joint triangulations of two sets of points in the plane CoRR (2011)
Subir Kumar Ghosh, Partha P. Goswami
Unsolved Problems in Visibility Graphs of Points, Segments and Polygons CoRR (2010)
Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami
Cluster connecting problem inside a polygon. CCCG (2010)
Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda
Algorithms for Computing Diffuse Reflection Paths in Polygons. WALCOM (2009)
Sandip Das, Partha P. Goswami, Subhas C. Nandy
Smallest Color-Spanning Object Revisited. Int. J. Comput. Geom. Appl. 19 (5) (2009)
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das
Maximal Covering by Two Isothetic Unit Squares. CCCG (2008)
Subir Kumar Ghosh, Thomas C. Shermer, Binay K. Bhattacharya, Partha P. Goswami
Computing the maximum clique in the visibility graph of a simple polygon. J. Discrete Algorithms 5 (3) (2007)
Partha P. Goswami, Sandip Das, Subhas C. Nandy
Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set. Inf. Process. Lett. 102 (4) (2007)
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das
Covering Points by Isothetic Unit Squares. CCCG (2007)
Sandip Das, Partha P. Goswami, Subhas C. Nandy
Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle. ICCSA (1) (2005)
Sandip Das, Partha P. Goswami, Subhas C. Nandy
-point enclosing rectangle and square of arbitrary orientation. Inf. Process. Lett. 94 (6) (2005)
Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy
Optimal algorithm for a special point-labeling problem. Inf. Process. Lett. 89 (2) (2004)
Sandip Das, Partha P. Goswami, Subhas C. Nandy
Smallest k point enclosing rectangle of arbitrary orientation. CCCG (2004)
Partha P. Goswami, Sandip Das, Subhas C. Nandy
Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment. Comput. Geom. 29 (3) (2004)
Subhas C. Nandy, Sandip Das, Partha P. Goswami
An efficient k nearest neighbors searching algorithm for a query line. Theor. Comput. Sci. 299 (1-3) (2003)
Partha P. Goswami, Sandip Das, Subhas C. Nandy
Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D. SWAT (2002)
Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy
Optimal Algorithm for a Special Point-Labeling Problem. SWAT (2002)