Prosenjit Gupta
Prosenjit Gupta
Founder, eLahe Technologies, Kolkata
Geverifieerd e-mailadres voor acm.org - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Handbook of data structures and applications
DP Mehta, S Sahni
Chapman and Hall/CRC, 2004
2582004
On some geometric optimization problems in layered manufacturing
J Majhi, R Janardan, M Smid, P Gupta
Computational Geometry 12 (3-4), 219-239, 1999
991999
Further results on generalized intersection searching problems: counting, reporting, and dynamization
P Gupta, R Janardan, M Smid
Journal of Algorithms 19 (2), 282-317, 1995
901995
Efficient geometric algorithms for workpiece orientation in 4-and 5-axis NC machining
P Gupta, R Janardan, J Majhi, T Woo
Computer-Aided Design 28 (8), 577-587, 1996
731996
Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design
J Majhi, P Gupta, R Janardan
Computational Geometry 13 (4), 229-252, 1999
341999
On some geometric optimization problems in layered manufacturing
J Majhi, R Janardan, M Smid, P Gupta
Workshop on Algorithms and Data Structures, 136-149, 1997
331997
Computational geometry: Generalized intersection searching
P Gupta, R Janardan, M Smid
HANDBOOK OF DATA STRUCTURES AND APPLICATIONS, D. MEHTA AND S. SAHNI (EDITORS …, 2005
312005
Clustering-based recommender system using principles of voting theory
J Das, P Mukherjee, S Majumder, P Gupta
2014 International Conference on Contemporary Computing and Informatics …, 2014
302014
The rectangle enclosure and point-dominance problems revisited
P Gupta, R Janardan, M Smid, B DasGupta
International Journal of Computational Geometry & Applications 7 (05), 437-455, 1997
291997
Fast algorithms for collision and proximity problems involving moving geometric objects
P Gupta, R Janardan, M Smid
Computational Geometry 6 (6), 371-391, 1996
291996
Data structures for range-aggregate extent queries
P Gupta, R Janardan, Y Kumar, M Smid
Proc. 20th CCCG, 7-10, 2008
27*2008
Algorithms for generalized halfspace range searching and other intersection searching problems
P Gupta, R Janardan, M Smid
Computational Geometry 5 (6), 321-340, 1996
261996
Efficient algorithms for reverse proximity query problems
Y Kumar, R Janardan, P Gupta
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances …, 2008
242008
Efficient algorithms for generalized intersection searching on non-iso-oriented objects
P Gupta, R Janardan, M Smid
Proceedings of the tenth annual symposium on Computational geometry, 369-378, 1994
241994
Efficient algorithms for counting and reporting pairwise intersections between convex polygons
P Gupta, R Janardan, M Smid
Information processing letters 69 (1), 7-13, 1999
221999
Range-aggregate proximity queries
R Sharathkumar, P Gupta
IIIT Hyderabad, Telangana 500032, 2007
212007
A technique for adding range restrictions to generalized searching problems
P Gupta, R Janardan, M Smid
Information Processing Letters 64 (5), 263-269, 1997
201997
Algorithms for range-aggregate query problems involving geometric aggregation operations
P Gupta
International Symposium on Algorithms and Computation, 892-901, 2005
182005
Range aggregate maximal points in the plane
AS Das, P Gupta, AK Kalavagattu, J Agarwal, K Srinathan, K Kothapalli
International Workshop on Algorithms and Computation, 52-63, 2012
162012
Algorithms for some intersection searching problems involving curved objects
P Gupta, R Janardan, M Smid
Max-Planck-Institut für Informatik, 1993
161993
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20