# Prosenjit Gupta

According to our database

Collaborative distances:

^{1}, Prosenjit Gupta authored at least 45 papers between 1994 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Collaborative Recommendations using Hierarchical Clustering based on K-d Trees and Quadtrees.

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2019

2016

Linear space adaptive data structures for planar range reporting.

Inf. Process. Lett., 2016

2015

Reporting and counting maximal points in a query orthogonal rectangle.

J. Discrete Algorithms, 2015

Iterative Use of Weighted Voronoi Diagrams to Improve Scalability in Recommender Systems.

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2015

2014

On reporting the L

_{1}metric closest pair in a query rectangle.
Inf. Process. Lett., 2014

Data structures for range-aggregate extent queries.

Comput. Geom., 2014

Top - K Query Retrieval of Combinations with Sum-of-Subsets Ranking.

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

Colored top-K range-aggregate queries.

Inf. Process. Lett., 2013

Counting Maximal Points in a Query Orthogonal Rectangle.

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

2012

Range Aggregate Maximal Points in the Plane.

Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

2011

Data Structures for Extension Violations in a Query Range.

J. Math. Model. Algorithms, 2011

Data Structures for Range-Aggregation over Categories.

Int. J. Found. Comput. Sci., 2011

Efficient Top-

*k*Queries for Orthogonal Ranges.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Finding Maximum Density Axes Parallel Regions for Weighted Point Sets.

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Detecting VLSI Layout, Connectivity Errors in a Query Window.

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Range aggregate structures for colored geometric objects.

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

2009

External memory layout vs. schematic.

ACM Trans. Design Autom. Electr. Syst., 2009

Incremental analysis of large VLSI Layouts.

Integr., 2009

Efficient Non-Intersection Queries on Aggregated Geometric Data.

Int. J. Comput. Geometry Appl., 2009

Data Structures for Range Aggregation by Categories.

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Data Structures for Reporting Extension Violations in a Query Range.

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Efficient algorithms for reverse proximity query problems.

Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

2007

An External Memory Circuit Validation Algorithm for Large VLSI Layouts.

Proceedings of the 2007 IEEE Computer Society Annual Symposium on VLSI (ISVLSI 2007), 2007

Reducing EPL Alignment Errors for Large VLSI Layouts.

Proceedings of the 8th International Symposium on Quality of Electronic Design (ISQED 2007), 2007

2006

Range-Aggregate Query Problems Involving Geometric Aggregation Operations.

Nord. J. Comput., 2006

Optimal Algorithms for Some Polygon Enclosure Problems for VLSI Layout Analysis.

J. Math. Model. Algorithms, 2006

Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts.

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005

Algorithms for Range-Aggregate Query Problems Involving Geometric Aggregation Operations.

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Efficient Algorithms for Range Queries in Protein Sequence Analysis.

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Computational Geometry.

Proceedings of the Handbook of Data Structures and Applications., 2004

Overlaying Multiple Maps Efficiently.

Proceedings of the Intelligent Information Technology, 2004

Efficient polygon enclosure algorithms for device extraction from VLSI layouts.

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

1999

Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons.

Inf. Process. Lett., 1999

Minimizing support structures and trapped area in two-dimensional layered manufacturing.

Comput. Geom., 1999

On some geometric optimization problems in layered manufacturing.

Comput. Geom., 1999

Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design.

Comput. Geom., 1999

1997

A Technique for Adding Range Restrictions to Generalized Searching Problems.

Inf. Process. Lett., 1997

The Rectangle Enclosure and Point-Dominance Problems Revisited.

Int. J. Comput. Geometry Appl., 1997

1996

Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects.

Comput. Geom., 1996

Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems.

Comput. Geom., 1996

Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining.

Comput. Aided Des., 1996

1995

Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization.

J. Algorithms, 1995

1994

Extending the Quadrangle Inequality to Speed-Up Dynamic Programming.

Inf. Process. Lett., 1994

On Intersection Searching Problems Involving Curved Objects.

Proceedings of the Algorithm Theory, 1994

Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects.

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994