( en | de | ru )

 

Disambiguation of "Bhattacharya, Binay K."

Author of the publication

copydeleteadd this publication to your clipboard
An optimal algorithm to translate a convex polyhedron through a two-dimensional convex window.

. CVGIP: Graphical Model and Image Processing, 53 (3): 269-270 (1991)

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.

Sara Binay

Subhamoy Bhattacharya

Chhaya Bhattacharya

Nupur Bhattacharya

Indrajit Bhattacharya

 

Other publications of authors with the same name

Approximation Algorithms for the Black and White Traveling Salesman Problem., , and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 559-567. Springer, (2007)Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2., , and . CCCG, Carleton University, Ottawa, Canada, (2014)On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm., and . J. Algorithms, 25 (1): 177-193 (1997)Characterizing LR-visibility polygons and related problems., and . Comput. Geom., 18 (1): 19-36 (2001)Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times., , , and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 800-811. Springer, (2008)Computing Shortest Transversals of Sets (Extended Abstract)., , , , , and . SCG, page 71-80. ACM, (1991)Computing the Widest Empty Boomerang., , and . CCCG, page 80-83. (2005)Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles., , and . CCCG, page 243-246. (2005)Biased search and k-point clustering.. CCCG, (1997)Approximation Algorithms for Generalized MST and TSP in Grid Clusters., , , , and . COCOA, volume 9486 of Lecture Notes in Computer Science, page 110-125. Springer, (2015)