The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Prosenjit Gupta: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:8-13 [Conf]
  2. Vamsikrishna Kundeti, Prosenjit Gupta
    Efficient polygon enclosure algorithms for device extraction from VLSI layouts. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:82-85 [Conf]
  3. N. Madhusudhanan, Prosenjit Gupta, Abhijit Mitra
    Efficient Algorithms for Range Queries in Protein Sequence Analysis. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:146-149 [Conf]
  4. Ravindranath Jampani, Risivardhan Thonangi, Prosenjit Gupta
    Overlaying Multiple Maps Efficiently. [Citation Graph (0, 0)][DBLP]
    CIT, 2004, pp:263-272 [Conf]
  5. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Efficient Non-intersection Queries on Aggregated Geometric Data. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:544-553 [Conf]
  6. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:369-378 [Conf]
  7. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta
    The Rectangle Enclosure and Point-Dominance Problems Revisited. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:162-171 [Conf]
  8. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:278-289 [Conf]
  9. Prosenjit Gupta
    Algorithms for Range-Aggregate Query Problems Involving Geometric Aggregation Operations. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:892-901 [Conf]
  10. Yokesh Kumar, Prosenjit Gupta
    Reducing EPL Alignment Errors for Large VLSI Layouts. [Citation Graph (0, 0)][DBLP]
    ISQED, 2007, pp:233-238 [Conf]
  11. Yokesh Kumar, Prosenjit Gupta
    An External Memory Circuit Validation Algorithm for Large VLSI Layouts. [Citation Graph (0, 0)][DBLP]
    ISVLSI, 2007, pp:510-511 [Conf]
  12. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    On Intersection Searching Problems Involving Curved Objects. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:183-194 [Conf]
  13. Jayanth Majhi, Prosenjit Gupta, Ravi Janardan
    Computing a Flattest, Undercut-Free Parting Line for a Convex Polyhedron, with Application to Mold Design. [Citation Graph (0, 0)][DBLP]
    WACG, 1996, pp:109-120 [Conf]
  14. Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo
    Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-Machining. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:171-182 [Conf]
  15. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:361-372 [Conf]
  16. Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta
    On Some Geometric Optimization Problems in Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:136-149 [Conf]
  17. Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo
    Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1996, v:28, n:8, pp:577-587 [Journal]
  18. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:321-340 [Journal]
  19. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:1-19 [Journal]
  20. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:371-391 [Journal]
  21. Jayanth Majhi, Prosenjit Gupta, Ravi Janardan
    Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:13, n:4, pp:229-252 [Journal]
  22. Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta
    On some geometric optimization problems in layered manufacturing. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:3-4, pp:219-239 [Journal]
  23. Jayanth Majhi, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid, Prosenjit Gupta
    Minimizing support structures and trapped area in two-dimensional layered manufacturing. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:3-4, pp:241-267 [Journal]
  24. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta
    The Rectangle Enclosure and Point-Dominance Problems Revisited. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:5, pp:437-455 [Journal]
  25. Al Borchers, Prosenjit Gupta
    Extending the Quadrangle Inequality to Speed-Up Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:6, pp:287-290 [Journal]
  26. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    A Technique for Adding Range Restrictions to Generalized Searching Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:5, pp:263-269 [Journal]
  27. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:1, pp:7-13 [Journal]
  28. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:2, pp:282-317 [Journal]
  29. R. Sharathkumar, Prosenjit Gupta
    Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]

  30. Data Structures for Range-Aggregate Extent Queries. [Citation Graph (, )][DBLP]


  31. Range aggregate structures for colored geometric objects. [Citation Graph (, )][DBLP]


  32. Data Structures for Reporting Extension Violations in a Query Range. [Citation Graph (, )][DBLP]


  33. Data Structures for Range Aggregation by Categories. [Citation Graph (, )][DBLP]


  34. Efficient algorithms for reverse proximity query problems. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.303secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002