Partha P. Goswami

According to our database, Partha P. Goswami authored at least 20 papers between 2002 and 2015.

Collaborative distances:

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

2015

Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points.

Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das

Int. J. Comput. Geom. Appl., 2015

2013

Unsolved problems in visibility graphs of points, segments, and polygons.

Subir Kumar Ghosh, Partha P. Goswami

ACM Comput. Surv., 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

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

2011

On joint triangulations of two sets of points in the plane

Ajit A. Diwan, Subir Kumar Ghosh, Partha P. Goswami, Andrzej Lingas

CoRR, 2011

<i>k</i>-Enclosing Axis-Parallel Square.

Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das, Partha P. Goswami

Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

Classification of poor contrast mammograms using a novel and fast boundary detection technique.

Arpita Das, Partha P. Goswami, Susanta Sen, Mahua Bhattacharya

Proceedings of the 2011 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2011

2010

Cluster connecting problem inside a polygon.

Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

Smallest Color-Spanning Object Revisited.

Sandip Das, Partha P. Goswami, Subhas C. Nandy

Int. J. Comput. Geom. Appl., 2009

2008

Maximal Covering by Two Isothetic Unit Squares.

Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

Computing the maximum clique in the visibility graph of a simple polygon.

Subir Kumar Ghosh, Thomas C. Shermer, Binay K. Bhattacharya, Partha P. Goswami

J. Discrete Algorithms, 2007

Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set.

Partha P. Goswami, Sandip Das, Subhas C. Nandy

Inf. Process. Lett., 2007

Covering Points by Isothetic Unit Squares.

Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2005

Smallest <i>k</i>-point enclosing rectangle and square of arbitrary orientation.

Sandip Das, Partha P. Goswami, Subhas C. Nandy

Inf. Process. Lett., 2005

Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle.

Sandip Das, Partha P. Goswami, Subhas C. Nandy

Proceedings of the Computational Science and Its Applications, 2005

2004

Optimal algorithm for a special point-labeling problem.

Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy

Inf. Process. Lett., 2004

Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment.

Partha P. Goswami, Sandip Das, Subhas C. Nandy

Comput. Geom., 2004

Smallest k point enclosing rectangle of arbitrary orientation.

Sandip Das, Partha P. Goswami, Subhas C. Nandy

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

An efficient k nearest neighbors searching algorithm for a query line.

Subhas C. Nandy, Sandip Das, Partha P. Goswami

Theor. Comput. Sci., 2003

2002

Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D.

Partha P. Goswami, Sandip Das, Subhas C. Nandy

Proceedings of the Algorithm Theory, 2002