( en | de | ru )

 

Disambiguation of "Goswami, Partha P."

Author of the publication

copydeleteadd this publication to your clipboard
An efficient k nearest neighbors searching algorithm for a query line.

, , and . Theor. Comput. Sci., 299 (1-3): 273-288 (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Partha Sampathkumaran

Chandan Goswami

Shyamal Goswami

Devrishi Goswami

Panchali Goswami

 

Other publications of authors with the same name

Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle., , and . ICCSA (1), volume 3480 of Lecture Notes in Computer Science, page 827-837. Springer, (2005)Smallest k-point enclosing rectangle and square of arbitrary orientation., , and . Inf. Process. Lett., 94 (6): 259-266 (2005)Algorithms for computing diffuse reflection paths in polygons., , , , , and . Vis. Comput., 28 (12): 1229-1237 (2012)Algorithms for Computing Diffuse Reflection Paths in Polygons., , , , , and . WALCOM, volume 5431 of Lecture Notes in Computer Science, page 47-58. Springer, (2009)Cluster connecting problem inside a polygon., , , and . CCCG, page 265-268. (2010)Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D., , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 69-79. Springer, (2002)Unsolved Problems in Visibility Graphs of Points, Segments and Polygons, and . CoRR, (2010)Smallest Color-Spanning Object Revisited., , and . Int. J. Comput. Geom. Appl., 19 (5): 457-478 (2009)Optimal algorithm for a special point-labeling problem., , , and . Inf. Process. Lett., 89 (2): 91-98 (2004)Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment., , and . Comput. Geom., 29 (3): 163-175 (2004)