Pankaj K. Agarwal | Scholars@Duke

Pankaj K. Agarwal
RJR Nabisco Professor of Computer Science in Trinity College of Arts and Sciences

Computational and combinatorial geometry, computational biology, robotics, spatial databases, geographic molecular information systems, and data structures.

Current Appointments & Affiliations

RJR Nabisco Professor of Computer Science in Trinity College of Arts and Sciences, Computer Science, Trinity College of Arts & Sciences 2008
Professor of Computer Science, Computer Science, Trinity College of Arts & Sciences 1998
Chair of Computer Science, Computer Science, Trinity College of Arts & Sciences 2017
Professor of Mathematics, Mathematics, Trinity College of Arts & Sciences 2009
Faculty Network Member of The Energy Initiative, Duke University Energy Initiative, Initiatives 2012
Bass Fellow, Computer Science, Trinity College of Arts & Sciences 2005

Contact Information

Box 90129, Durham, NC 27708-0129
D315 Lev Sci Res Ctr, Durham, NC 27708
pankaj@cs.duke.edu (919) 660-6548
http://www.cs.duke.edu/~pankaj/

Background
Education, Training, & Certifications
- Ph.D., New York University 1989
- M.S., University of California at Santa Cruz 1986
- B.S.E.E., Indian Institute of Technology (India) 1982
Duke Appointment History
- Chair, Department of Computer Science, Computer Science, Trinity College of Arts & Sciences 2004 - 2010
- Professor of Mathematics, Mathematics, Trinity College of Arts & Sciences 2001 - 2006
- Associate Professor with Tenure, Computer Science, Trinity College of Arts & Sciences 1994 - 1998
- Associate Professor, Computer Science, Trinity College of Arts & Sciences 1992 - 1994
- Assistant Professor, Computer Science, Trinity College of Arts & Sciences 1989 - 1992
Recognition
Awards & Honors
Publications & Artistic Works
Selected Publications
- Books
  - Agarwal, P. K., T. Akutsu, A. Amihood, A. Apostolico, C. Benham, G. Benson, M. Blanchette, et al. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface. Vol. 3692 LNBI, 2005.
- Academic Articles
  - Rav, M., A. Lowe, and P. K. Agarwal. “Flood risk analysis on terrains.” Acm Transactions on Spatial Algorithms and Systems 5, no. 1 (May 1, 2019). https://doi.org/10.1145/3295459.
    Full Text
  - Agarwal, P. K., and J. Pan. “Near-Linear Algorithms for Geometric Hitting Sets and Set Covers.” Discrete and Computational Geometry, January 1, 2019. https://doi.org/10.1007/s00454-019-00099-6.
    Full Text
  - Agarwal, P. K., F. O. X. Kyle, and O. Salzman. “An efficient algorithm for computing high-quality paths amid polygonal obstacles.” Acm Transactions on Algorithms 14, no. 4 (August 1, 2018). https://doi.org/10.1145/3230650.
    Full Text
  - Agarwal, P. K., N. Kumar, S. Sintos, and S. Suri. “Range-max queries on uncertain data.” Journal of Computer and System Sciences 94 (June 1, 2018): 118–34. https://doi.org/10.1016/j.jcss.2017.09.006.
    Full Text
  - Agarwal, PK, Arge, L, and Staals, F. "Improved dynamic geodesic nearest neighbor searching in a simple polygon." Leibniz International Proceedings in Informatics, Lipics 99 (June 1, 2018): 41-414. Full Text
  - Agarwal, P. K., A. Efrat, S. Sankararaman, and W. Zhang. “Nearest-Neighbor Searching Under Uncertainty I.” Discrete and Computational Geometry 58, no. 3 (October 1, 2017): 705–45. https://doi.org/10.1007/s00454-017-9903-x.
    Full Text
  - Agarwal, P. K., S. Har-Peled, S. Suri, H. Yıldız, and W. Zhang. “Convex Hulls Under Uncertainty.” Algorithmica 79, no. 2 (October 1, 2017): 340–67. https://doi.org/10.1007/s00453-016-0195-y.
    Full Text
  - Wu, Y., P. K. Agarwal, C. Li, J. Yang, and C. Yu. “Computational fact checking through query perturbations.” Acm Transactions on Database Systems 42, no. 1 (January 1, 2017). https://doi.org/10.1145/2996453.
    Full Text
  - Agarwal, P. K., B. Aronov, S. Har-Peled, J. M. Phillips, K. Yi, and W. Zhang. “Nearest-neighbor searching under uncertainty II.” Acm Transactions on Algorithms 13, no. 1 (October 1, 2016). https://doi.org/10.1145/2955098.
    Full Text
  - Agarwal, P. K., A. Beutel, and T. Mølhave. “TerraNNI: Natural neighbor interpolation on 2D and 3D grids using a GPU.” Acm Transactions on Spatial Algorithms and Systems 2, no. 2 (June 1, 2016). https://doi.org/10.1145/2786757.
    Full Text
  - Agarwal, P. K., K. Fox, J. Pan, and R. Ying. “Approximating dynamic time warping and edit distance for a pair of point sequences.” Leibniz International Proceedings in Informatics, Lipics 51 (June 1, 2016): 6.1-6.16. https://doi.org/10.4230/LIPIcs.SoCG.2016.6.
    Full Text
  - Yu, A., P. K. Agarwal, and J. Yang. “Top-k Preferences in High Dimensions.” Ieee Transactions on Knowledge and Data Engineering 28, no. 2 (February 1, 2016): 311–25. https://doi.org/10.1109/TKDE.2015.2451630.
    Full Text
  - Agarwal, P. K., H. Kaplan, N. Rubin, and M. Sharir. “Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions.” Discrete and Computational Geometry 54, no. 4 (September 8, 2015): 871–904. https://doi.org/10.1007/s00454-015-9729-3.
    Full Text
  - Agarwal, P. K., J. Gao, L. J. Guibas, H. Kaplan, N. Rubin, and M. Sharir. “Stable Delaunay Graphs.” Discrete and Computational Geometry 54, no. 4 (September 3, 2015): 905–29. https://doi.org/10.1007/s00454-015-9730-x.
    Full Text
  - Agarwal, P. K., T. Mølhave, M. Revsbæk, I. Safa, Y. Wang, and J. Yang. “Maintaining Contour Trees of Dynamic Terrains.” Leibniz International Proceedings in Informatics, Lipics 34 (June 1, 2015): 796–811. https://doi.org/10.4230/LIPIcs.SOCG.2015.796.
    Full Text
  - Agarwal, P. K., and R. Sharathkumar. “Streaming Algorithms for Extent Problems in High Dimensions.” Algorithmica 72, no. 1 (May 1, 2015): 83–98. https://doi.org/10.1007/s00453-013-9846-4.
    Full Text
  - Agarwal, P. K., K. Fox, A. Nath, A. Sidiropoulos, and Y. Wang. “Computing the Gromov-Hausdorff distance for metric trees.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 9472 (January 1, 2015): 529–40. https://doi.org/10.1007/978-3-662-48971-0_45.
    Full Text
  - Sankararaman, Swaminathan, Alon Efrat, Srinivasan Ramasubramanian, and Pankaj K. Agarwal. “On Channel-Discontinuity-Constraint Routing in Wireless Networks..” Ad Hoc Networks 13, no. Pt A (February 2014): 153–69. https://doi.org/10.1016/j.adhoc.2011.04.011.
    Full Text
  - Agarwal, P. K., S. Har-Peled, H. Kaplan, and M. Sharir. “Union of Random Minkowski Sums and Network Vulnerability Analysis.” Discrete and Computational Geometry 52, no. 3 (January 1, 2014): 551–82. https://doi.org/10.1007/s00454-014-9626-1.
    Full Text
  - Agarwal, P. K., S. Har-Peled, S. Suri, H. YIldIz, and W. Zhang. “Convex hulls under uncertainty.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8737 LNCS (January 1, 2014): 37–48. https://doi.org/10.1007/978-3-662-44777-2-4.
    Full Text
  - Agarwal, P. K., and J. Pan. “Near-linear algorithms for geometric hitting sets and set covers.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 2014, 271–79. https://doi.org/10.1145/2582112.2582152.
    Full Text
  - Agarwal, P. K., and R. Sharathkumar. “Approximation algorithms for bipartite matching with metric and geometric costs.” Proceedings of the Annual Acm Symposium on Theory of Computing, January 1, 2014, 555–64. https://doi.org/10.1145/2591796.2591844.
    Full Text
  - Salzman, O., D. Shaharabani, P. K. Agarwal, and D. Halperin. “Sparsification of motion-planning roadmaps by edge contraction.” International Journal of Robotics Research 33, no. 14 (January 1, 2014): 1711–25. https://doi.org/10.1177/0278364914556517.
    Full Text
  - Wu, Y., B. Walenz, P. Li, A. Shim, E. Sonmez, P. K. Agarwal, C. Li, J. Yang, and C. Yu. “ICheck: Computationally combating "lies, D - Ned Lies, and statistics".” Proceedings of the Acm Sigmod International Conference on Management of Data, January 1, 2014, 1063–66. https://doi.org/10.1145/2588555.2594522.
    Full Text
  - Wu, Y., P. K. Agarwal, C. Li, J. Yang, and C. Yu. “Toward computational fact-checking.” Proceedings of the Vldb Endowment 7, no. 7 (January 1, 2014): 589–600. https://doi.org/10.14778/2732286.2732295.
    Full Text
  - Yu, A., P. K. Agarwal, and J. Yang. “Top-k preferences in high dimensions.” Proceedings International Conference on Data Engineering, January 1, 2014, 748–59. https://doi.org/10.1109/ICDE.2014.6816697.
    Full Text
  - Agarwal, P. K., B. Aronov, M. Van Kreveld, M. Löffler, and R. I. Silveira. “Computing correlation between piecewise-linear functions.” Siam Journal on Computing 42, no. 5 (December 26, 2013): 1867–87. https://doi.org/10.1137/120900708.
    Full Text
  - Agarwal, P. K., J. Matoušek, and M. Sharir. “On range searching with semialgebraic sets. II.” Siam Journal on Computing 42, no. 6 (December 23, 2013): 2039–62. https://doi.org/10.1137/120890855.
    Full Text
  - Lebeck, N., T. Mølhave, and P. K. Agarwal. “Computing highly occluded paths on a terrain.” Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, December 1, 2013, 14–23. https://doi.org/10.1145/2525314.2525363.
    Full Text
  - Sankararaman, S., P. K. Agarwal, T. Mølhave, J. Pan, and A. P. Boedihardjo. “Model-driven matching and segmentation of trajectories.” Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, December 1, 2013, 234–43. https://doi.org/10.1145/2525314.2525360.
    Full Text
  - Shaharabani, D., O. Salzman, P. K. Agarwal, and D. Halperin. “Sparsification of motion-planning roadmaps by edge contraction.” Proceedings Ieee International Conference on Robotics and Automation, November 14, 2013, 4098–4105. https://doi.org/10.1109/ICRA.2013.6631155.
    Full Text
  - Agarwal, P. K., G. Cormode, Z. Huang, J. M. Phillips, Z. Wei, and K. Yi. “Mergeable summaries.” Acm Transactions on Database Systems 38, no. 4 (November 1, 2013). https://doi.org/10.1145/2500128.
    Full Text
  - Agarwal, P. K., R. Ben Avraham, and M. Sharir. “The 2-center problem in three dimensions.” Computational Geometry: Theory and Applications 46, no. 6 (August 1, 2013): 734–46. https://doi.org/10.1016/j.comgeo.2012.11.005.
    Full Text
  - Agarwal, P. K., B. Aronov, S. Har-Peled, J. M. Phillips, K. Yi, and W. Zhang. “Nearest neighbor searching under uncertainty II.” Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, July 29, 2013, 115–26. https://doi.org/10.1145/2463664.2465219.
    Full Text
  - Agarwal, P. K., S. Har-Peled, and A. H. Yu. “Embeddings of surfaces, curves, and moving points in euclidean space.” Siam Journal on Computing 42, no. 2 (July 18, 2013): 442–58. https://doi.org/10.1137/110830046.
    Full Text
  - Agarwal, P. K., R. Ben Avraham, H. Kaplan, and M. Sharir. “Computing the discrete Fréchet distance in subquadratic time.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, April 16, 2013, 156–67.
  - Agarwal, P. K., L. Arge, S. Govindarajan, J. Yang, and K. Yi. “Efficient external memory structures for range-aggregate queries.” Computational Geometry: Theory and Applications 46, no. 3 (April 1, 2013): 358–70. https://doi.org/10.1016/j.comgeo.2012.10.003.
    Full Text
  - Agarwal, P. K., A. Efrat, S. K. Ganjugunte, D. Hay, S. Sankararaman, and G. Zussman. “The resilience of WDM networks to probabilistic geographical failures.” Ieee/Acm Transactions on Networking 21, no. 5 (January 14, 2013): 1525–38. https://doi.org/10.1109/TNET.2012.2232111.
    Full Text
  - Afshani, P., P. K. Agarwal, L. Arge, K. G. Larsen, and J. M. Phillips. “(Approximate) Uncertain Skylines.” Theory of Computing Systems 52, no. 3 (January 1, 2013): 342–66. https://doi.org/10.1007/s00224-012-9382-7.
    Full Text
  - Agarwal, P. K., A. Efrat, S. K. Ganjugunte, D. Hay, S. Sankararaman, and G. Zussman. “The Resilience of WDM Networks to Probabilistic Geographical Failures.” Ieee/Acm Transactions on Networking, 2013.
  - Agarwal, P. K., H. Kaplan, and M. Sharir. “Union of random minkowski sums and network vulnerability analysis.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 2013, 177–86.
  - Agarwal, P. K., J. Matoušek, and M. Sharir. “On range searching with semialgebraic sets II.” Proceedings Annual Ieee Symposium on Foundations of Computer Science, Focs, December 1, 2012, 420–29. https://doi.org/10.1109/FOCS.2012.32.
    Full Text
  - Wu, Y., P. K. Agarwal, C. Li, J. Yang, and C. Yu. “On "one of the few" objects.” Proceedings of the Acm Sigkdd International Conference on Knowledge Discovery and Data Mining, September 14, 2012, 1487–95. https://doi.org/10.1145/2339530.2339762.
    Full Text
  - Agarwal, P. K., S. W. Cheng, and K. Yi. “Range searching on uncertain data.” Acm Transactions on Algorithms 8, no. 4 (September 1, 2012). https://doi.org/10.1145/2344422.2344433.
    Full Text
  - Yu, A., P. K. Agarwal, and J. Yang. “Subscriber assignment for wide-area content-based publish/subscribe.” Ieee Transactions on Knowledge and Data Engineering 24, no. 10 (August 29, 2012): 1833–47. https://doi.org/10.1109/TKDE.2012.65.
    Full Text
  - Yu, A., P. K. Agarwal, and J. Yang. “Processing and notifying range top-k subscriptions.” Proceedings International Conference on Data Engineering, July 30, 2012, 810–21. https://doi.org/10.1109/ICDE.2012.67.
    Full Text
  - Yu, A., P. K. Agarwal, and J. Yang. “Processing a large number of continuous preference top-k queries.” Proceedings of the Acm Sigmod International Conference on Management of Data, June 28, 2012, 397–408. https://doi.org/10.1145/2213836.2213882.
    Full Text
  - Agarwal, P. K., A. Efrat, S. Sankararaman, and W. Zhang. “Nearest-neighbor searching under uncertainty.” Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, June 27, 2012, 225–36. https://doi.org/10.1145/2213556.2213588.
    Full Text
  - Agarwal, P. K., G. Cormode, Z. Huang, J. Phillips, Z. Wei, and K. Yi. “Mergeable summaries.” Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, June 26, 2012, 23–34. https://doi.org/10.1145/2213556.2213562.
    Full Text
  - Sharathkumar, R., and P. K. Agarwal. “A near-linear time ε-approximation algorithm for geometric bipartite matching.” Proceedings of the Annual Acm Symposium on Theory of Computing, June 26, 2012, 385–94. https://doi.org/10.1145/2213977.2214014.
    Full Text
  - Agarwal, P. K., L. Arge, H. Kaplan, E. Molad, R. E. Tarjan, and K. Yi. “An optimal dynamic data structure for stabbing-semigroup queries.” Siam Journal on Computing 41, no. 1 (June 4, 2012): 104–27. https://doi.org/10.1137/10078791X.
    Full Text
  - Agarwal, P. K., E. Ezra, and M. Sharir. “Near-linear approximation algorithms for geometric hitting sets.” Algorithmica 63, no. 1–2 (June 1, 2012): 1–25. https://doi.org/10.1007/s00453-011-9517-2.
    Full Text
  - Sharathkumar, R., and P. K. Agarwal. “Algorithms for the transportation problem in geometric settings.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, April 30, 2012, 306–17.
  - Beutel, A., T. Mølhave, P. K. Agarwal, A. P. Boedihardjo, and J. A. Shine. “TerraNNI: Natural neighbor interpolation on a 3D grid using a GPU.” Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, December 1, 2011, 64–73. https://doi.org/10.1145/2093973.2093984.
    Full Text
  - Agarwal, P. K., A. Efrat, C. Gniady, J. S. B. Mitchell, V. Polishchuk, and G. R. Sabhnani. “Distributed localization and clustering using data correlation and the Occam's razor principle.” 2011 International Conference on Distributed Computing in Sensor Systems and Workshops, Dcoss’11, September 12, 2011. https://doi.org/10.1109/DCOSS.2011.5982164.
    Full Text
  - Agarwal, P. K., A. Efrat, S. Ganjugunte, D. Hay, S. Sankararaman, and G. Zussman. “The resilience of WDM networks to probabilistic geographical failures.” Proceedings Ieee Infocom, August 2, 2011, 1521–29. https://doi.org/10.1109/INFCOM.2011.5934942.
    Full Text
  - Agarwal, P. K., T. Mølhave, H. Yu, and J. S. Clark. “Exploiting temporal coherence in forest dynamics simulation.” Proceedings of the Annual Symposium on Computational Geometry, July 15, 2011, 77–86. https://doi.org/10.1145/1998196.1998210.
    Full Text
  - Clark, James S., Pankaj Agarwal, David M. Bell, Paul G. Flikkema, Alan Gelfand, Xuanlong Nguyen, Eric Ward, and Jun Yang. “Inferential ecosystem models, from network data to prediction..” Ecological Applications : A Publication of the Ecological Society of America 21, no. 5 (July 2011): 1523–36. https://doi.org/10.1890/09-1212.1.
    Full Text
  - Yu, A., P. K. Agarwal, and J. Yang. “Subscriber assignment for wide-area content-based publish/subscribe.” Proceedings International Conference on Data Engineering, June 6, 2011, 267–78. https://doi.org/10.1109/ICDE.2011.5767882.
    Full Text
  - Abam, M. A., P. K. Agarwal, M. De Berg, and H. Yu. “Out-of-order event processing in kinetic data structures.” Algorithmica (New York) 60, no. 2 (June 1, 2011): 250–73. https://doi.org/10.1007/s00453-009-9335-y.
    Full Text
  - Agarwal, P. K., T. Mølhave, and B. Sadri. “I/O-efficieiit contour queries on terrains.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, May 12, 2011, 268–84.
  - Afshani, P., P. K. Agarwal, L. Arge, K. G. Larsen, and J. M. Phillips. “(Approximate) uncertain skylines.” Acm International Conference Proceeding Series, March 11, 2011, 186–96. https://doi.org/10.1145/1938551.1938576.
    Full Text
  - Beutel, A., T. Mølhave, and P. K. Agarwal. “Natural neighbor interpolation based grid DEM construction using a GPU.” Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, December 31, 2010, 172–81. https://doi.org/10.1145/1869790.1869817.
    Full Text
  - Agarwal, P. K., A. Efrat, S. K. Ganjugunte, D. Hay, S. Sankararaman, and G. Zussman. “Network vulnerability to single, multiple, and probabilistic physical attacks.” Proceedings Ieee Military Communications Conference Milcom, December 1, 2010, 1824–29. https://doi.org/10.1109/MILCOM.2010.5679556.
    Full Text
  - Agarwal, P. K., J. M. Phillips, and H. Yu. “Stability of ε-kernels.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6346 LNCS, no. PART 1 (November 19, 2010): 487–99. https://doi.org/10.1007/978-3-642-15775-2_42.
    Full Text
  - Agarwal, P. K., L. Arge, and K. Yi. “I/O-efficient batched union-find and its applications to terrain analysis.” Acm Transactions on Algorithms 7, no. 1 (November 1, 2010). https://doi.org/10.1145/1868237.1868249.
    Full Text
  - Agarwal, P. K., S. Bereg, O. Daescu, H. Kaplan, S. Ntafos, M. Sharir, and B. Zhu. “Guarding a terrain by two watchtowers.” Algorithmica (New York) 58, no. 2 (October 1, 2010): 352–90. https://doi.org/10.1007/s00453-008-9270-3.
    Full Text
  - Mølhave, T., P. K. Agarwal, L. Arge, and M. Revsbæk. “Scalable algorithms for large high-resolution terrain data.” Acm International Conference Proceeding Series, August 6, 2010. https://doi.org/10.1145/1823854.1823878.
    Full Text
  - Chen, L., C. Tang, J. Yang, M. Kitsuregawa, and Q. Li. “Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6184 LNCS (August 3, 2010).
  - Agarwal, P. K., S. Har-Peled, M. Sharir, and Y. Wang. “Hausdorff distance under translation for points and balls.” Acm Transactions on Algorithms 6, no. 4 (August 1, 2010). https://doi.org/10.1145/1824777.1824791.
    Full Text
  - Agarwal, P. K. “An improved algorithm for computing the volume of the union of cubes.” Proceedings of the Annual Symposium on Computational Geometry, July 30, 2010, 230–39. https://doi.org/10.1145/1810959.1811000.
    Full Text
  - Agarwal, P. K., B. Aronov, M. Van Kreveld, M. Löffler, and R. I. Silveira. “Computing similarity between piecewise-linear functions.” Proceedings of the Annual Symposium on Computational Geometry, July 30, 2010, 375–83. https://doi.org/10.1145/1810959.1811020.
    Full Text
  - Agarwal, P. K., J. Gao, L. J. Guibas, H. Kaplan, V. Koltun, N. Rubin, and M. Sharir. “Kinetic stable Delaunay graphs.” Proceedings of the Annual Symposium on Computational Geometry, July 30, 2010, 127–36. https://doi.org/10.1145/1810959.1810984.
    Full Text
  - Agarwal, P. K., R. Ben-Avraham, and M. Sharir. “The 2-center problem in three dimensions.” Proceedings of the Annual Symposium on Computational Geometry, July 30, 2010, 87–96. https://doi.org/10.1145/1810959.1810974.
    Full Text
  - Agarwal, P. K., J. M. Phillips, and B. Sadri. “Lipschitz unimodal and isotonic regression on paths and trees.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6034 LNCS (June 18, 2010): 384–96. https://doi.org/10.1007/978-3-642-12200-2_34.
    Full Text
  - Sankararaman, S., A. Efrat, S. Ramasubramanian, and P. K. Agarwal. “On channel-discontinuity-constraint routing in wireless networks.” Proceedings Ieee Infocom, June 15, 2010. https://doi.org/10.1109/INFCOM.2010.5462188.
    Full Text
  - Agarwal, P. K., and R. Sharathkumar. “Streaming algorithms for extent problems in high dimensions.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, May 6, 2010, 1481–89.
  - Agarwal, P. K., A. Efrat, R. Sharathkumar, and H. Yu. “On approximate geodesic-distance queries amid deforming point clouds.” Springer Tracts in Advanced Robotics 57 (March 29, 2010): 351–65. https://doi.org/10.1007/978-3-642-00312-7_22.
    Full Text
  - Agarwal, P. K., E. Ezra, and M. Sharir. “Near-linear approximation algorithms for geometric hitting sets.” Proceedings of the Annual Symposium on Computational Geometry, December 4, 2009, 23–32. https://doi.org/10.1145/1542362.1542368.
    Full Text
  - Agarwal, P. K., S. W. Cheng, Y. Tao, and K. Yi. “Indexing uncertain data.” Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, November 9, 2009, 137–46. https://doi.org/10.1145/1559795.1559816.
    Full Text
  - Agarwal, P. K., R. Sharathkumar, and H. Yu. “Approximate Euclidean shortest paths amid convex obstacles.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, September 21, 2009, 283–92.
  - Agarwal, P. K., E. Ezra, and S. K. Ganjugunte. “Efficient sensor placement for surveillance problems.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5516 LNCS (August 20, 2009): 301–14. https://doi.org/10.1007/978-3-642-02085-8_22.
    Full Text
  - Agarwal, P. K., J. Xie, J. Yang, and H. Yu. “Input-sensitive scalable continuous join query processing.” Acm Transactions on Database Systems 34, no. 3 (August 1, 2009). https://doi.org/10.1145/1567274.1567275.
    Full Text
  - Agarwal, P. K., D. Z. Chen, S. K. Ganjugunte, E. Misiołek, M. Sharir, and K. Tang. “Stabbing convex polygons with a segment or a polygon.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5193 LNCS (December 24, 2008): 52–63. https://doi.org/10.1007/978-3-540-87744-8-5.
    Full Text
  - Agarwal, P. K., and J. M. Phillips. “An efficient algorithm for 2D Euclidean 2-center with outliers.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5193 LNCS (December 24, 2008): 64–75. https://doi.org/10.1007/978-3-540-87744-8-6.
    Full Text
  - Agarwal, P. K., B. Sadri, and H. Yu. “Untangling triangulations through local explorations.” Proceedings of the Annual Symposium on Computational Geometry, December 12, 2008, 288–97. https://doi.org/10.1145/1377676.1377726.
    Full Text
  - Agarwal, P. K., L. Arge, T. Moølhave, and B. Sadri. “I/O-efflcient algorithms for computing contours on a terrain.” Proceedings of the Annual Symposium on Computational Geometry, December 12, 2008, 129–38. https://doi.org/10.1145/1377676.1377698.
    Full Text
  - Chandramouli, B., J. Yang, P. K. Agarwal, A. Yu, and Y. Zheng. “ProSem: Scalable wide-area publish/subscribe.” Proceedings of the Acm Sigmod International Conference on Management of Data, December 10, 2008, 1315–17. https://doi.org/10.1145/1376616.1376764.
    Full Text
  - Agarwal, P. K., H. Kaplan, and M. Sharir. “Kinetic and dynamic data structures for closest pair and all nearest neighbors.” Acm Transactions on Algorithms 5, no. 1 (November 1, 2008). https://doi.org/10.1145/1435375.1435379.
    Full Text
  - Agarwal, P. K., M. Sharir, and E. Welzl. “Algorithms for center and Tverberg points.” Acm Transactions on Algorithms 5, no. 1 (November 1, 2008). https://doi.org/10.1145/1435375.1435380.
    Full Text
  - Yu, H., P. K. Agarwal, R. Poreddy, and K. R. Varadarajan. “Practical methods for shape fitting and kinetic data structures using coresets.” Algorithmica (New York) 52, no. 3 (November 1, 2008): 378–402. https://doi.org/10.1007/s00453-007-9067-9.
    Full Text
  - Agarwal, P. K., F. Hurtado, G. T. Toussaint, and J. Trias. “On polyhedra induced by point sets in space.” Discrete Applied Mathematics 156, no. 1 (January 1, 2008): 42–54. https://doi.org/10.1016/j.dam.2007.08.033.
    Full Text
  - Agarwal, P. K., R. Klein, C. Knauer, S. Langerman, P. Morin, M. Sharir, and M. Soss. “Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D.” Discrete and Computational Geometry 39, no. 1–3 (January 1, 2008): 17–37. https://doi.org/10.1007/s00454-007-9019-9.
    Full Text
  - Agarwal, P. K., S. Har-Peled, and H. Yu. “Robust shape fitting via peeling and grating coresets.” Discrete and Computational Geometry 39, no. 1–3 (January 1, 2008): 38–58. https://doi.org/10.1007/s00454-007-9013-2.
    Full Text
  - Flikkema, P. G., P. K. Agarwal, J. S. Clark, C. Ellis, A. Gelfand, K. Munagala, and J. Yang. “From data reverence to data relevance: Model-mediated wireless sensing of the physical environment.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4487 LNCS (December 24, 2007): 988–94.
  - Agarwal, P. K. “Modeling and analyzing massive terrain data sets.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4835 LNCS (December 1, 2007).
  - Danner, A., T. Mølhave, K. Yi, P. K. Agarwal, L. Arge, and H. Mitasova. “TerraStream: From elevation data to watershed hierarchies.” Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, December 1, 2007, 212–19. https://doi.org/10.1145/1341012.1341049.
    Full Text
  - Agarwal, P. K., H. Kaplan, and M. Sharir. “Computing the volume of the union of cubes.” Proceedings of the Annual Symposium on Computational Geometry, October 22, 2007, 294–301. https://doi.org/10.1145/1247069.1247121.
    Full Text
  - Agarwal, P. K., R. Apfelbaum, G. Purdy, and M. Sharir. “Similar simplices in a d-dimensional point set.” Proceedings of the Annual Symposium on Computational Geometry, October 22, 2007, 232–38. https://doi.org/10.1145/1247069.1247112.
    Full Text
  - Agarwal, P. K., S. Har-Peled, and H. Yu. “Embeddings of surfaces, curves, and moving points in euclidean space.” Proceedings of the Annual Symposium on Computational Geometry, October 22, 2007, 381–89. https://doi.org/10.1145/1247069.1247135.
    Full Text
  - Agarwal, P. K., and H. Yu. “A space-optimal data-stream algorithm for coresets in the plane.” Proceedings of the Annual Symposium on Computational Geometry, October 22, 2007, 1–10. https://doi.org/10.1145/1247069.1247071.
    Full Text
  - Zheng, Y., D. J. Brady, and P. K. Agarwal. “Localization using boundary sensors: An analysis based on graph theory.” Acm Transactions on Sensor Networks 3, no. 4 (October 1, 2007). https://doi.org/10.1145/1281492.1281496.
    Full Text
  - Clark, James S., Mike Dietze, Sukhendu Chakraborty, Pankaj K. Agarwal, Ines Ibanez, Shannon LaDeau, and Mike Wolosin. “Resolving the biodiversity paradox..” Ecology Letters 10, no. 8 (August 2007): 647–59. https://doi.org/10.1111/j.1461-0248.2007.01041.x.
    Full Text
  - Govindarajan, S., M. C. Dietze, P. K. Agarwal, and J. S. Clark. “A scalable algorithm for dispersing population.” Journal of Intelligent Information Systems 29, no. 1 (August 1, 2007): 39–61. https://doi.org/10.1007/s10844-006-0030-z.
    Full Text
  - Agarwal, Pankaj K., Nabil H. Mustafa, and Yusu Wang. “Fast molecular shape matching using contact maps..” Journal of Computational Biology : A Journal of Computational Molecular Cell Biology 14, no. 2 (March 2007): 131–43. https://doi.org/10.1089/cmb.2007.0004.
    Full Text
  - Clark, J. S., and P. K. Agarwal. “Rejoinder to Clark et al. (2007): Response to Chesson and Rees.” Ecology Letters 10, no. 8 (January 1, 2007): 661–62. https://doi.org/10.1111/j.1461-0248.2007.01071.x.
    Full Text
  - Agarwal, P. K., L. Arge, and A. Danner. “From point cloud to grid DEM: A scalable approach.” Progress in Spatial Data Handling 12th International Symposium on Spatial Data Handling, Sdh 2006, December 1, 2006, 771–88. https://doi.org/10.1007/3-540-35589-8_48.
    Full Text
  - Agarwal, P. K., M. Overmars, and M. Sharir. “Computing maximally separated sets in the plane.” Siam Journal on Computing 36, no. 3 (December 1, 2006): 815–34. https://doi.org/10.1137/S0097539704446591.
    Full Text
  - Agarwal, P. K., D. Brady, and J. Matoušek. “Segmenting object space by geometric reference structures.” Acm Transactions on Sensor Networks 2, no. 4 (November 1, 2006): 455–65. https://doi.org/10.1145/1218556.1218557.
    Full Text
  - Bilu, Yonatan, Pankaj K. Agarwal, and Rachel Kolodny. “Faster algorithms for optimal multiple sequence alignment based on pairwise comparisons..” Ieee/Acm Transactions on Computational Biology and Bioinformatics 3, no. 4 (October 2006): 408–22. https://doi.org/10.1109/tcbb.2006.53.
    Full Text
  - Agarwal, P. K., L. Arge, and K. Yi. “I/O-efficient batched union-find and its applications to terrain analysis.” Proceedings of the Annual Symposium on Computational Geometry 2006 (September 4, 2006): 167–76.
  - Agarwal, P. K., B. Aronov, and V. Koltun. “Efficient algorithms for bichromatic separability.” Acm Transactions on Algorithms 2, no. 2 (August 29, 2006): 209–27. https://doi.org/10.1145/1150334.1150338.
    Full Text
  - Agarwal, P. K., and N. H. Mustafa. “Independent set of intersection graphs of convex objects in 2D.” Computational Geometry: Theory and Applications 34, no. 2 (May 1, 2006): 83–95. https://doi.org/10.1016/j.comgeo.2005.12.001.
    Full Text
  - Agarwal, P. K., S. Har-Peled, and H. Yu. “Robust shape fitting via peeling and grating coresets.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, February 28, 2006, 182–91. https://doi.org/10.1145/1109557.1109579.
    Full Text
  - Abam, M. A., P. K. Agarwal, M. De Berg, and H. Yu. “Out-of-order event processing in kinetic data structures.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4168 LNCS (January 1, 2006): 624–35.
  - Agarwal, P. K., H. Edelsbrunner, J. Harer, and Y. Wang. “Extreme elevation on a 2-manifold.” Discrete and Computational Geometry 36, no. 4 (January 1, 2006): 553–72. https://doi.org/10.1007/s00454-006-1265-8.
    Full Text
  - Agarwal, P. K., Y. Wang, and H. Yu. “A two-dimensional kinetic triangulation with near-quadratic topological changes.” Discrete and Computational Geometry 36, no. 4 (January 1, 2006): 573–92. https://doi.org/10.1007/s00454-006-1266-7.
    Full Text
  - Flikkema, P. G., P. K. Agarwal, J. S. Clark, C. Ellis, A. Gelfand, K. Munagala, and J. Yang. “Model-driven dynamic control of embedded wireless sensor networks.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3993 LNCS-III (January 1, 2006): 409–16. https://doi.org/10.1007/11758532_55.
    Full Text
  - Phillips, J. M., J. Rudolph, and P. K. Agarwal. “Segmenting motifs in protein-protein interface surfaces.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4175 LNBI (January 1, 2006): 207–18.
  - Agarwal, P. K., J. Xie, J. Yang, and H. Yu. “Monitoring continuous band-join queries over dynamic data.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3827 LNCS (December 1, 2005): 349–59. https://doi.org/10.1007/11602613_36.
    Full Text
  - Agarwal, P. K., S. Bereg, O. Daescu, H. Kaplan, S. Ntafos, and B. Zhu. “Guarding a terrain by two watchtowers.” Proceedings of the Annual Symposium on Computational Geometry, December 1, 2005, 346–55. https://doi.org/10.1145/1064092.1064145.
    Full Text
  - Agarwal, P. K., Y. Bilu, and R. Kolodny. “Faster algorithms for optimal Multiple Sequence Alignment based on pairwise comparisons.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3692 LNBI (December 1, 2005): 315–27. https://doi.org/10.1007/11557067_26.
    Full Text
  - Agarwal, P. K., L. Arge, and K. Yi. “I/O-efficient construction of constrained delaunay triangulations.” Lecture Notes in Computer Science 3669 (October 31, 2005): 355–66.
  - Agarwal, P. K., L. Arge, and K. Yi. “An optimal dynamic interval stabbing-max data structure?.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, July 1, 2005, 803–12.
  - Agarwal, P. K., Y. Wang, and P. Yin. “Lower bound for sparse Euclidean spanners.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, July 1, 2005, 670–71.
  - Agarwal, P. K., and M. Sharir. “Pseudo-line arrangements: Duality, algorithms, and applications.” Siam Journal on Computing 34, no. 3 (June 30, 2005): 526–52. https://doi.org/10.1137/S0097539703433900.
    Full Text
  - Agarwal, P. K., C. M. Procopiuc, and K. R. Varadarajan. “Approximation algorithms for a k-line center.” Algorithmica (New York) 42, no. 3–4 (June 1, 2005): 221–30. https://doi.org/10.1007/s00453-005-1166-x.
    Full Text
  - Agarwal, P. K., S. Har-Peled, N. H. Mustafa, and Y. Wang. “Near-linear time approximation algorithms for curve simplification.” Algorithmica (New York) 42, no. 3–4 (June 1, 2005): 203–19. https://doi.org/10.1007/s00453-005-1165-y.
    Full Text
  - Agarwal, P. K., B. Aronov, V. Koltun, and M. Sharir. “Lines avoiding unit balls in three dimensions.” Discrete and Computational Geometry 34, no. 2 (January 1, 2005): 231–50. https://doi.org/10.1007/s00454-005-1166-2.
    Full Text
  - Agarwal, P. K., R. P. Berretty, and A. D. Collins. “A near-quadratic algorithm for fence design.” Discrete and Computational Geometry 33, no. 3 (January 1, 2005): 463–81. https://doi.org/10.1007/s00454-004-1148-9.
    Full Text
  - Wang, Y., P. K. Agarwal, P. Brown, H. Edelsbrunner, and J. Rudolph. “Coarse and reliable geometric alignment for protein docking..” Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing, January 2005, 64–75.
  - Agarwal, P. K., L. Arge, J. Erickson, and H. Yu. “Efficient tradeoff schemes in data structures for querying moving objects.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3221 (December 1, 2004): 4–15.
  - Agarwal, P. K., R. P. Berretty, and A. D. Collins. “A near-quadratic algorithm for fence design.” Springer Tracts in Advanced Robotics 7 STAR (December 1, 2004): 347–62. https://doi.org/10.1007/978-3-540-45058-0_21.
    Full Text
  - Agarwal, P. K., and N. H. Mustafa. “Independent set of intersection graphs of convex objects in 2D.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3111 (December 1, 2004): 127–37.
  - Choi, V., P. K. Agarwal, H. Edelsbrunner, and J. Rudolph. “Local search heuristic for rigid protein docking.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3240 (December 1, 2004): 218–29.
  - Agarwal, P. K., B. Aronov, V. Koltun, and M. Sharir. “On lines avoiding unit balls in three dimensions.” Proceedings of the Annual Symposium on Computational Geometry, September 29, 2004, 36–45.
  - Agarwal, P. K., H. Edelsbrunner, J. Harer, and Y. Wang. “Extreme elevation on a 2-manifold.” Proceedings of the Annual Symposium on Computational Geometry, September 29, 2004, 357–65.
  - Agarwal, P. K., M. Sharir, and E. Welzl. “Algorithms for center and tverberg points.” Proceedings of the Annual Symposium on Computational Geometry, September 29, 2004, 61–67.
  - Agarwal, P. K., Y. Wang, and H. Yu. “A 2D kinetic triangulation with near-quadratic topological changes.” Proceedings of the Annual Symposium on Computational Geometry, September 29, 2004, 180–89.
  - Agarwal, P. K., and K. R. Varadarajan. “A near-linear constant-factor approximation for euclidean bipartite matching?.” Proceedings of the Annual Symposium on Computational Geometry, September 29, 2004, 247–52.
  - Govindarajan, S., M. Dietze, P. K. Agarwal, and J. S. Clark. “A scalable simulator for forest dynamics.” Proceedings of the Annual Symposium on Computational Geometry, September 29, 2004, 106–15.
  - Yu, H., P. K. Agarwal, R. Poreddy, and K. R. Varadarajan. “Practical methods for shape fitting and kinetic data structures using core sets.” Proceedings of the Annual Symposium on Computational Geometry, September 29, 2004, 263–72.
  - Agarwal, P. K., and N. H. Mustafa. “K-means projective clustering.” Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems 23 (July 28, 2004): 155–65.
  - Agarwal, P. K., S. Har-Peled, and K. R. Varadarajan. “Approximating extent measures of points.” Journal of the Acm 51, no. 4 (July 1, 2004): 606–35. https://doi.org/10.1145/1008731.1008736.
    Full Text
  - Agarwal, P., L. Guibas, A. Nguyen, D. Russel, and L. Zhang. “Collision detection for deforming necklaces.” Computational Geometry: Theory and Applications 28, no. 2-3 SPEC. ISS. (June 1, 2004): 137–63. https://doi.org/10.1016/j.comgeo.2004.03.008.
    Full Text
  - Agarwal, P. K., B. Aronov, and V. Koltun. “Efficient Algorithms for Bichromatic Separability.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms 15 (April 15, 2004): 675–83.
  - Agarwal, P. K., M. Overmars, and M. Sharir. “Computing Maximally Separated Sets in the Plane and Independent Sets in the Intersection Graph of Unit Disks.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms 15 (April 15, 2004): 509–18.
  - Agarwal, P. K., E. Nevo, J. Pach, R. Pinchasi, M. Sharir, and S. Smorodinsky. “Lenses in arrangements of pseudo-circles and their applications.” Journal of the Acm 51, no. 2 (March 1, 2004): 139–86. https://doi.org/10.1145/972639.972641.
    Full Text
  - Agarwal, P. K., H. Edelsbrunner, and Y. Wang. “Computing the writhing number of a polygonal knot.” Discrete and Computational Geometry 32, no. 1 (January 1, 2004): 37–53. https://doi.org/10.1007/s00454-004-2864-x.
    Full Text
  - Collins, A. D., P. K. Agarwal, and J. L. Harer. “HPRM: A hierarchical PRM.” Proceedings Ieee International Conference on Robotics and Automation 3 (December 9, 2003): 4433–38.
  - Agarwal, P. K., L. Arge, J. Yang, and K. Yi. “I/O-efficient structures for orthogonal range-max and stabbing-max queries.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2832 (December 1, 2003): 7–18.
  - Agarwal, P. K., S. Krishnan, N. H. Mustafa, and S. Venkatasubramanian. “Streaming geometric optimization using graphics hardware.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2832 (December 1, 2003): 544–55.
  - Govindarajan, S., P. K. Agarwal, and L. Arge. “CRB-tree: An efficient indexing scheme for range-aggregate queries.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2572 (December 1, 2003): 143–57.
  - Procopiuc, O., P. K. Agarwal, L. Arge, and J. S. Vitter. “Bkd-tree: A dynamic scalable kd-tree.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2750 (December 1, 2003): 46–65.
  - Agarwal, P. K., C. M. Procopiuc, and K. R. Varadarajan. “A (1+ε)-approximation algorithm for 2-line-center.” Computational Geometry: Theory and Applications 26, no. 2 (October 1, 2003): 119–28. https://doi.org/10.1016/S0925-7721(03)00017-8.
    Full Text
  - Agarwal, P. K., L. Arge, A. Danner, and B. Holland-Minkley. “Cache-oblivious data structures for orthogonal range searching.” Proceedings of the Annual Symposium on Computational Geometry, July 28, 2003, 237–45.
  - Agarwal, P. K., S. Har-Peled, M. Sharir, and Y. Wang. “Hausdorff distance under translation for points and balls.” Proceedings of the Annual Symposium on Computational Geometry, July 28, 2003, 282–91.
  - Agarwal, P. K., L. Arge, and J. Erickson. “Indexing moving points.” Journal of Computer and System Sciences 66, no. 1 (July 8, 2003): 207–43. https://doi.org/10.1016/S0022-0000(02)00035-1.
    Full Text
  - Agarwal, P. K., and L. Arge. “Editorial.” Computational Geometry: Theory and Applications 24, no. 2 (February 1, 2003). https://doi.org/10.1016/S0925-7721(02)00090-1.
    Full Text
  - Agarwal, P. K., C. M. Procopiuc, and K. R. Varadarajan. “A (1+ε) -approximation algorithm for 2 -line-center.” Computational Geometry: Theory and Applications 26, no. 2 (2003): 119–28.
  - Agarwal, P. K., and C. M. Procopiuc. “Approximation algorithms for projective clustering.” Journal of Algorithms 46, no. 2 (January 1, 2003): 115–39. https://doi.org/10.1016/S0196-6774(02)00295-X.
    Full Text
  - Agarwal, P. K., L. J. Guibas, H. Edelsbrunner, J. Erickson, M. Isard, S. Har-Peled, J. Hershberger, et al. “Algorithmic issues in modeling motion.” Acm Computing Surveys 34, no. 4 (December 1, 2002): 550–72. https://doi.org/10.1145/592642.592647.
    Full Text
  - Procopiuc, C. M., M. Jones, P. K. Agarwal, and T. M. Murali. “A Monte Carlo algorithm for fast projective clustering.” Proceedings of the Acm Sigmod International Conference on Management of Data, September 17, 2002, 418–27.
  - Agarwal, P. K., T. Biedl, S. Lazard, S. Robbins, S. Suri, and S. Whitesides. “Curvature-constrained shortest paths in a convex polygon.” Siam Journal on Computing 31, no. 6 (September 1, 2002): 1814–51. https://doi.org/10.1137/S0097539700374550.
    Full Text
  - Agarwal, P. K., J. Basch, L. J. Guibas, J. Hershberger, and L. Zhang. “Deformable free-space tilings for kinetic collision detection.” International Journal of Robotics Research 21, no. 3 (March 1, 2002): 179–97. https://doi.org/10.1177/027836402320556395.
    Full Text
  - Agarwal, P. K., B. K. Bhattacharya, and S. Sen. “Improved algorithms for uniform partitions of points.” Algorithmica (New York) 32, no. 4 (January 1, 2002): 521–39. https://doi.org/10.1007/s00453-001-0084-9.
    Full Text
  - Agarwal, P. K., E. Flato, and D. Halperin. “Polygon decomposition for efficient construction of Minkowski sums.” Computational Geometry: Theory and Applications 21, no. 1–2 (January 1, 2002): 39–61. https://doi.org/10.1016/S0925-7721(01)00041-4.
    Full Text
  - Agarwal, P. K., M. De Berg, J. Gudmundsson, M. Hammar, and H. J. Haverkort. “Box-trees and R-trees with near-optimal query time.” Discrete and Computational Geometry 28, no. 3 (January 1, 2002): 291–312. https://doi.org/10.1007/s00454-002-2817-1.
    Full Text
  - Agarwal, P. K., M. De Berg, S. Har-Peled, M. H. Overmars, M. Sharir, and J. Vahrenhold. “Reporting intersecting pairs of convex polytopes in two and three dimensions.” Computational Geometry: Theory and Applications 23, no. 2 (January 1, 2002): 195–207. https://doi.org/10.1016/S0925-7721(02)00049-4.
    Full Text
  - Agarwal, P. K., S. Har-Peled, and M. Karia. “Computing approximate shortest paths on convex polytopes.” Algorithmica (New York) 33, no. 2 (January 1, 2002): 227–42. https://doi.org/10.1007/s00453-001-0111-x.
    Full Text
  - Agarwal, P. K., and C. M. Procopiuc. “Exact and approximation algorithms for clustering.” Algorithmica (New York) 33, no. 2 (January 1, 2002): 201–26. https://doi.org/10.1007/s00453-001-0110-y.
    Full Text
  - Agarwal, P. K., and M. Sharir. “The number of congruent simplices in a point set.” Discrete and Computational Geometry 28, no. 2 (January 1, 2002): 123–50. https://doi.org/10.1007/s00454-002-0727-x.
    Full Text
  - Agarwal, P., E. Nevo, J. Pach, R. Pinchasi, and S. Smorodinsky. “Lenses in arrangements of pseudo-circles and their applications.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 2002, 123–32.
  - Agarwal, P. K., and S. Hal-Peled. “Maintaining approximate extent measures of moving points.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, December 1, 2001, 148–57.
  - Agarwal, P. K., A. D. Collins, and J. L. Harer. “Minimal trap design.” Proceedings Ieee International Conference on Robotics and Automation 3 (January 1, 2001): 2243–48. https://doi.org/10.1109/ROBOT.2001.932956.
    Full Text
  - Agarwal, P. K., B. Aronov, and M. Sharir. “On the complexity of many faces in arrangements of circles.” Annual Symposium on Foundations of Computer Science Proceedings, January 1, 2001, 74–83.
  - Agarwal, P. K., B. Aronov, and M. Sharir. “Exact and approximation algorithms for minimum-width cylindrical shells.” Discrete and Computational Geometry 26, no. 3 (January 1, 2001): 307–20. https://doi.org/10.1007/s00454-001-0039-6.
    Full Text
  - Agarwal, P. K., L. J. Guibas, J. Hershberger, and E. Veach. “Maintaining the extent of a moving point set.” Discrete and Computational Geometry 26, no. 3 (January 1, 2001): 353–74. https://doi.org/10.1007/s00454-001-0019-x.
    Full Text
  - Agarwal, P. K., M. De Berg, J. Gudmundsson, M. Hammar, and H. J. Haverkort. “Box-trees and R-trees with near-optimal query time.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 2001, 124–33.
  - Agarwal, P. K., and M. Sharir. “On the number of congruent simplices in a point set.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 2001, 1–9.
  - Agarwal, P. K., and H. Wanq. “Approximation algorithms for curvature-constrained shortest paths.” Siam Journal on Computing 30, no. 6 (December 1, 2000): 1739–72.
  - Agarwal, P. K., E. F. Grove, T. M. Murali, and J. S. Vitter. “Binary space partitions for fat rectangles.” Siam Journal on Computing 29, no. 5 (March 1, 2000): 1422–48. https://doi.org/10.1137/S0097539797320578.
    Full Text
  - Agarwal, P. K., B. Aronov, S. Har-Peled, and M. Sharir. “Approximation Algorithms for Minimum-Width Annuli and Shells.” Discrete and Computational Geometry 24, no. 4 (January 1, 2000): 687–705.
  - Agarwal, P. K., B. Aronov, and M. Sharir. “Exact and approximation algorithms for minimum-width cylindrical shells.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, January 1, 2000, 510–17.
  - Agarwal, P. K., J. Basch, M. de Berg, L. J. Guibas, and J. Hershberger. “Lower Bounds for Kinetic Planar Subdivisions.” Discrete and Computational Geometry 24, no. 4 (January 1, 2000): 721–33. https://doi.org/10.1007/s4540010060.
    Full Text
  - Agarwal, P. K., L. Arge, J. Erickson, P. G. Franciosa, and J. S. Vitter. “Efficient searching with linear constraints.” Journal of Computer and System Sciences 61, no. 2 (January 1, 2000): 194–216. https://doi.org/10.1006/jcss.2000.1709.
    Full Text
  - Agarwal, P. K., L. Arge, and J. Erickson. “Indexing moving points.” Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, January 1, 2000, 175–86.
  - Agarwal, P. K., L. J. Guibas, T. M. Murali, and J. S. Vitter. “Cylindrical static and kinetic binary space partitions.” Computational Geometry: Theory and Applications 16, no. 2 (January 1, 2000): 103–27. https://doi.org/10.1016/S0925-7721(00)00005-5.
    Full Text
  - Agarwal, P. K., S. Har-Peled, and M. Karia. “Computing approximate shortest paths on convex polytopes.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 2000, 270–79.
  - Agarwal, P. K., and C. M. Procopiuc. “Approximation algorithms for projective clustering.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, January 1, 2000, 538–47.
  - Agarwal, P. K., and K. R. Varadarajan. “Efficient algorithms for approximating polygonal chains.” Discrete and Computational Geometry 23, no. 2 (January 1, 2000): 273–91. https://doi.org/10.1007/PL00009500.
    Full Text
  - Agarwal, P. K., and M. Sharir. “Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions.” Discrete and Computational Geometry 24, no. 4 (January 1, 2000): 645–85. https://doi.org/10.1007/s4540010064.
    Full Text
  - Agarwal, P. K., and P. K. Desikan. “Approximation algorithms for layered manufacturing.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, January 1, 2000, 528–37.
  - Varadarajan, K. R., and P. K. Agarwal. “Approximating shortest paths on a nonconvex polyhedron.” Siam Journal on Computing 30, no. 4 (January 1, 2000): 1321–40. https://doi.org/10.1137/S0097539799352759.
    Full Text
  - Agarwal, P. K., A. Efrat, and M. Sharir. “Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications.” Siam Journal on Computing 29, no. 3 (December 1, 1999): 912–53.
  - Agarwal, P. K., B. Aronov, S. Har-Peled, and M. Sharir. “Approximation and exact algorithms for minimum-width annuli and shells.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 1999, 380–89.
  - Agarwal, P. K., B. Aronov, and M. Sharir. “Motion planning for a convex polygon in a polygonal environment.” Discrete and Computational Geometry 22, no. 2 (January 1, 1999): 201–21. https://doi.org/10.1007/PL00009455.
    Full Text
  - Agarwal, P. K., B. Aronov, and M. Sharir. “Line transversals of balls and smallest enclosing cylinders in three dimensions.” Discrete and Computational Geometry 21, no. 3 (January 1, 1999): 373–88. https://doi.org/10.1007/PL00009427.
    Full Text
  - Agarwal, P. K., J. Basch, M. de Berg, L. J. Guibas, and J. Hershberger. “Lower bounds for kinetic planar subdivisions.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 1999, 247–54.
  - Agarwal, P. K., L. Arge, G. S. Brodal, and J. S. Vitter. “I/O-efficient dynamic point location in monotone planar subdivisions.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, January 1, 1999, 11–20.
  - Agarwal, P. K., and J. O’Rourke. “Open Problems Presented at SCG'98.” Journal of Algorithms 30, no. 2 (January 1, 1999): 449–53.
  - Agarwal, P. K., and M. Sharir. “Motion planning of a ball amid segments in three dimensions.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, January 1, 1999, 21–30.
  - Agarwal, P. K., and M. Sharir. “Pipes, cigars, and kreplach: The union of Minkowski sums in three dimensions.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 1999, 143–53.
  - Varadarajan, K. R., and P. K. Agarwal. “Approximation algorithms for bipartite and non-bipartite matching in the plane.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, January 1, 1999, 805–14.
  - Agarwal, P. K., D. Eppstein, L. J. Guibas, and M. R. Henzinger. “Parametric and kinetic minimum spanning trees.” Annual Symposium on Foundations of Computer Science Proceedings, December 1, 1998, 596–605.
  - Agarwal, P. K., J. Erickson, and L. J. Guibas. “Kinetic binary space partitions for intersecting segments and disjoint triangles.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, December 1, 1998, 107–16.
  - Agarwal, P. K., L. Arge, T. M. Murali, K. R. Varadarajan, and J. S. Vitter. “I/O-efficient algorithms for contour-line extraction and planar graph blocking.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, December 1, 1998, 117–26.
  - Agarwal, P. K., and C. M. Procopiuc. “Exact and approximation algorithms for clustering.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, December 1, 1998, 658–67.
  - Agarwal, P. K., and J. O’Rourke. “Computational geometry column 34.” International Journal of Computational Geometry and Applications 8, no. 5–6 (December 1, 1998): 637–42.
  - Agarwal, P. K., and M. Sharir. “Efficient Algorithms for Geometric Optimization.” Acm Computing Surveys 30, no. 4 (December 1, 1998): 412–58. https://doi.org/10.1145/299917.299918.
    Full Text
  - Agarwal, P. K. “Surface approximation and geometric partitions.” Siam Journal on Computing 27, no. 4 (January 1, 1998): 1016–35. https://doi.org/10.1137/S0097539794269801.
    Full Text
  - Agarwal, P. K., B. Aronov, T. M. Chan, and M. Sharir. “On levels in arrangements of lines, segments, planes, and triangles.” Discrete and Computational Geometry 19, no. 3 (January 1, 1998): 315–31. https://doi.org/10.1007/PL00009348.
    Full Text
  - Agarwal, P. K., J. Matoušek, and O. Schwarzkopf. “Computing many faces in arrangements of lines and segments.” Siam Journal on Computing 27, no. 2 (January 1, 1998): 491–505. https://doi.org/10.1137/S009753979426616X.
    Full Text
  - Agarwal, P. K., L. Arge, J. Erickson, P. G. Franciosa, and J. S. Vitter. “Efficient searching with linear constraints.” Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, January 1, 1998, 169–78.
  - Agarwal, P. K., M. De Berg, J. Matoušek, and O. Schwarzkopf. “Constructing Levels in Arrangements and Higher Order Voronoi Diagrams.” Siam Journal on Computing 27, no. 3 (January 1, 1998): 654–67. https://doi.org/10.1137/S0097539795281840.
    Full Text
  - Agarwal, P. K., M. Sharir, and E. Welzl. “The discrete 2-center problem.” Discrete and Computational Geometry 20, no. 3 (January 1, 1998): 287–305. https://doi.org/10.1007/PL00009387.
    Full Text
  - Agarwal, P. K., M. Van Kreveld, and S. Suri. “Label placement by maximum independent set in rectangles.” Computational Geometry: Theory and Applications 11, no. 3–4 (January 1, 1998): 209–18. https://doi.org/10.1016/S0925-7721(98)00028-5.
    Full Text
  - Agarwal, P. K., N. Amenta, and M. Sharir. “Largest placement of one convex polygon inside another.” Discrete and Computational Geometry 19, no. 1 (January 1, 1998): 95–104. https://doi.org/10.1007/PL00009337.
    Full Text
  - Agarwal, P. K., T. Biedl, S. Lazard, S. Robbins, S. Suri, and S. Whitesides. “Curvature-constrained shortest paths in a convex polygon.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 1998, 392–401.
  - Varadarajan, K. R., and P. K. Agarwal. “Approximating shortest paths on a nonconvex polyhedron.” Annual Symposium on Foundations of Computer Science Proceedings, December 1, 1997, 182–91.
  - Varadarajan, K. R., and P. K. Agarwal. “Linear approximation of simple objects.” Information Processing Letters 62, no. 2 (April 28, 1997): 89–94.
  - Agarwal, P. K., B. Aronov, J. O’Rourke, and C. A. Schevon. “Star unfolding of a polytope with applications.” Siam Journal on Computing 26, no. 6 (January 1, 1997): 1689–1713. https://doi.org/10.1137/S0097539793253371.
    Full Text
  - Agarwal, P. K., B. Aronov, J. Pach, R. Pollack, and M. Sharir. “Quasi-planar graphs have a linear number of edges.” Combinatorica 17, no. 1 (January 1, 1997): 1–9. https://doi.org/10.1007/BF01196127.
    Full Text
  - Agarwal, P. K., B. Aronov, and M. Sharir. “Computing envelopes in four dimensions with applications.” Siam Journal on Computing 26, no. 6 (January 1, 1997): 1714–32. https://doi.org/10.1137/S0097539794265724.
    Full Text
  - Agarwal, P. K., B. Aronov, and M. Sharir. “Line transversals of balls and smallest enclosing cylinders in three dimensions.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, January 1, 1997, 483–92.
  - Agarwal, P. K., B. Aronov, and M. Sharir. “On levels in arrangements of lines, segments, planes, and triangles.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 1997, 30–38.
  - Agarwal, P. K., J. C. Latombe, R. Motwani, and P. Raghavan. “Nonholonomic path planning for pushing a disk among obstacles.” Proceedings Ieee International Conference on Robotics and Automation 4 (January 1, 1997): 3124–29.
  - Agarwal, P. K., L. J. Guibas, T. M. Murali, and J. S. Vitter. “Cylindrical static and kinetic binary space partitions.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 1997, 39–48.
  - Agarwal, P. K., M. Sharir, and E. Welzl. “Discrete 2-center problem.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 1997, 147–55.
  - Agarwal, P. K., S. Har-Peled, M. Sharir, and K. R. Varadarajan. “Approximating shortest paths on a convex polytope in three dimensions.” Journal of the Acm 44, no. 4 (January 1, 1997): 567–84. https://doi.org/10.1145/263867.263869.
    Full Text
  - Agarwal, P. K., T. M. Murali, and J. S. Vitter. “Practical techniques for constructing Binary Space Partitions for orthogonal rectangles.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 1997, 382–84.
  - Agarwal, P. K., and P. K. Desikan. “Efficient algorithm for terrain simplification.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, January 1, 1997, 139–47.
  - Agarwal, P. K., E. F. Grove, T. M. Murali, and J. S. Vitter. “Binary space partitions for fat rectangles.” Annual Symposium on Foundations of Computer Science Proceedings, December 1, 1996, 482–91.
  - Frey, H. C., and P. Agarwal. “Probabilistic modeling and optimization of clean coal technologies: case studies of the externally-fired combined cycle.” Proceedings of the Air &Amp; Waste Management Association’S Annual Meeting &Amp; Exhibition, December 1, 1996.
  - Cohen, J., A. Varshney, D. Manocha, G. Turk, H. Weber, P. Agarwal, F. Brooks, and W. Wright. “Simplification envelopes.” Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques, Siggraph 1996, August 1, 1996, 119–28. https://doi.org/10.1145/237170.237220.
    Full Text
  - Agarwal, P. K., O. Schwarzkopf, and M. Sharir. “The overlay of lower envelopes and its applications.” Discrete and Computational Geometry 15, no. 1 (January 1, 1996): 1–13. https://doi.org/10.1007/BF02716576.
    Full Text
  - Agarwal, P. K., and M. Sharir. “Efficient randomized algorithms for some geometric optimization problems.” Discrete and Computational Geometry 16, no. 4 (January 1, 1996): 317–37. https://doi.org/10.1007/BF02712871.
    Full Text
  - Agarwal, P. K., and M. Sharir. “Ray Shooting Amidst Convex Polygons in 2D.” Journal of Algorithms 21, no. 3 (January 1, 1996): 508–19. https://doi.org/10.1006/jagm.1996.0056.
    Full Text
  - Agarwal, P. K., and M. Sharir. “Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions.” Siam Journal on Computing 25, no. 1 (January 1, 1996): 100–116. https://doi.org/10.1137/S0097539793244368.
    Full Text
  - Agarwal, P. K., and M. Van Kreveld. “Connected Component and Simple Polygon Intersection Searching.” Algorithmica (New York) 15, no. 6 (January 1, 1996): 626–60. https://doi.org/10.1007/BF01940884.
    Full Text
  - Agarwal, P. K., and S. Sen. “Selection in Monotone Matrices and Computing kth Nearest Neighbors.” Journal of Algorithms 20, no. 3 (January 1, 1996): 581–601. https://doi.org/10.1006/jagm.1996.0028.
    Full Text
  - Frey, H. C., and P. Agarwal. “Probabilistic analysis and optimization of new power generation technologies: a case study for the externally-fired combined cycle.” Proceedings of the American Power Conference 1 (January 1, 1996): 52–57.
  - Tamassia, R., P. K. Agarwal, N. Amato, D. Z. Chen, D. Dobkin, S. Drysdale, S. Fortune, et al. “Strategic directions in computational geometry.” Acm Computing Surveys 28, no. 4 (January 1, 1996): 591–606. https://doi.org/10.1145/242223.242248.
    Full Text
  - Agarwal, P. “Cellular segregation and engulfment simulations using the cell programming language..” Journal of Theoretical Biology 176, no. 1 (September 1995): 79–89. https://doi.org/10.1006/jtbi.1995.0178.
    Full Text
  - Agarwal, P. K., and J. Matoušek. “Dynamic half-space range reporting and its applications.” Algorithmica 13, no. 4 (April 1, 1995): 325–45. https://doi.org/10.1007/BF01293483.
    Full Text
  - Agarwal, P. K., M. J. Katz, and M. Sharir. “Computing depth orders for fat objects and related problems.” Computational Geometry: Theory and Applications 5, no. 4 (January 1, 1995): 187–206. https://doi.org/10.1016/0925-7721(95)00005-8.
    Full Text
  - Agarwal, P. K., N. Alon, B. Aronov, and S. Suri. “Can visibility graphs Be represented compactly?.” Discrete &Amp; Computational Geometry 12, no. 1 (December 1, 1994): 347–65. https://doi.org/10.1007/BF02574385.
    Full Text
  - Agarwal, P. K., and J. Matousek. “On range searching with semialgebraic sets.” Discrete &Amp; Computational Geometry 11, no. 1 (December 1, 1994): 393–418. https://doi.org/10.1007/BF02574015.
    Full Text
  - Agarwal, P. K., and M. Sharir. “On the number of views of polyhedral terrains.” Discrete &Amp; Computational Geometry 12, no. 1 (December 1, 1994): 177–82. https://doi.org/10.1007/BF02574373.
    Full Text
  - Agarwal, P. “Simulation of aggregation in Dictyostelium using the Cell Programming Language..” Computer Applications in the Biosciences : Cabios 10, no. 6 (December 1994): 647–55.
  - Agarwal, P. K., and M. Sharir. “Planar geometric location problems.” Algorithmica 11, no. 2 (February 1, 1994): 185–95. https://doi.org/10.1007/BF01182774.
    Full Text
  - Agarwal, P. K. “On stabbling lines for convex polyhedra in 3D.” Computational Geometry: Theory and Applications 4, no. 4 (January 1, 1994): 177–89. https://doi.org/10.1016/0925-7721(94)90016-7.
    Full Text
  - Agarwal, P. K., B. Aronov, and M. Sharir. “Computing envelopes in four dimensions with applications.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 1994, 348–58.
  - Agarwal, P. K., J. Matousek, and O. Schwarzkopf. “Computing many faces in arrangements of lines and segments.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 1994, 76–84.
  - Agarwal, P. K., M. Sharir, and S. Toledo. “Applications of parametric searching in geometric optimization.” Journal of Algorithms 17, no. 3 (January 1, 1994): 292–318. https://doi.org/10.1006/jagm.1994.1038.
    Full Text
  - Agarwal, P. K., M. de Berg, J. Matousek, and O. Schwarzkopf. “Constructing levels in arrangements and higher order Voronoi diagrams.” Proceedings of the Annual Symposium on Computational Geometry, January 1, 1994, 67–75.
  - Agarwal, P. K., and S. Suri. “Surface approximation and geometric partitions.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, January 1, 1994, 24–33.
  - Agarwal, P. K., N. Alon, B. Aronov, and S. Suri. “Can visibility graphs be represented compactly?.” Proceedings of the 9th Annual Symposium on Computational Geometry, December 1, 1993, 338–47.
  - Agarwal, P. K., B. Aronov, M. Sharir, and S. Suri. “Selecting distances in the plane.” Algorithmica 9, no. 5 (May 1, 1993): 495–514. https://doi.org/10.1007/BF01187037.
    Full Text
  - Agarwal, P. K., A. Efrat, M. Sharir, and S. Toledo. “Computing a segment center for a planar point set.” Journal of Algorithms 15, no. 2 (January 1, 1993): 314–23. https://doi.org/10.1006/jagm.1993.1043.
    Full Text
  - Agarwal, P. K., M. Pellegrini, and M. Sharir. “Counting circular arc intersections.” Siam Journal on Computing 22, no. 4 (January 1, 1993): 778–93. https://doi.org/10.1137/0222050.
    Full Text
  - Agarwal, P. K., M. Van kreveld, and M. Overmars. “Intersection queries in curved objects.” Journal of Algorithms 15, no. 2 (January 1, 1993): 229–66. https://doi.org/10.1006/jagm.1993.1040.
    Full Text
  - Agarwal, P. K., and J. Matousek. “Ray shooting and parametric search.” Siam Journal on Computing 22, no. 4 (January 1, 1993): 794–806. https://doi.org/10.1137/0222051.
    Full Text
  - Agarwal, P. K., and M. Sharir. “Ray shooting amidst convex polytopes in three dimensions.” Proceedings of the Fourth Annual Acm Siam Symposium on Discrete Algorithms, January 1, 1993, 260–70.
  - Agarwal, P. K., and M. Sharir. “Circle shooting in a simple polygon.” Journal of Algorithms 14, no. 1 (January 1, 1993): 69–87. https://doi.org/10.1006/jagm.1993.1004.
    Full Text
  - Agarwal, P. K., and B. Aronov. “Counting facets and incidences.” Discrete &Amp; Computational Geometry 7, no. 1 (December 1, 1992): 359–69. https://doi.org/10.1007/BF02187848.
    Full Text
  - Agarwal, P. K., and M. T. Shing. “Oriented aligned rectangle packing problem.” European Journal of Operational Research 62, no. 2 (October 26, 1992): 210–20. https://doi.org/10.1016/0377-2217(92)90249-9.
    Full Text
  - Agarwal, P. K., and J. Matoušek. “Ray shooting and parametric search.” Proceedings of the Annual Acm Symposium on Theory of Computing Part F129722 (July 1, 1992): 517–26. https://doi.org/10.1145/129712.129763.
    Full Text
  - Kreveld, M. van, M. Overmars, and P. K. Agarwal. “Intersection queries in sets of disks.” Bit 32, no. 2 (June 1, 1992): 268–79. https://doi.org/10.1007/BF01994881.
    Full Text
  - Agarwal, P. K., J. Matoušek, and S. Suri. “Farthest neighbors, maximum spanning trees and related problems in higher dimensions.” Computational Geometry: Theory and Applications 1, no. 4 (January 1, 1992): 189–201. https://doi.org/10.1016/0925-7721(92)90001-9.
    Full Text
  - Agarwal, P. K., and J. Matoušek. “Relative neighborhood graphs in three dimensions.” Computational Geometry: Theory and Applications 2, no. 1 (January 1, 1992): 1–14. https://doi.org/10.1016/0925-7721(92)90017-M.
    Full Text
  - Agarwal, P. K., H. Edelsbrunner, O. Schwarzkopf, and E. Welzl. “Euclidean minimum spanning trees and bichromatic closest pairs.” Discrete &Amp; Computational Geometry 6, no. 1 (December 1, 1991): 407–22. https://doi.org/10.1007/BF02574698.
    Full Text
  - Agarwal, P. K., A. Aggarwal, B. Aronov, S. R. Kosaraju, B. Schieber, and S. Suri. “Computing external farthest neighbors for a simple polygon.” Discrete Applied Mathematics 31, no. 2 (April 15, 1991): 97–111. https://doi.org/10.1016/0166-218X(91)90063-3.
    Full Text
  - Agarwal, P. K., and M. Sharir. “Applications of a new space-partitioning technique.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 519 LNCS (January 1, 1991): 379–91. https://doi.org/10.1007/BF02189304.
    Full Text
  - Agarwal, P. K., and M. Sharir. “Off-line dynamic maintenance of the width of a planar point set.” Computational Geometry: Theory and Applications 1, no. 2 (January 1, 1991): 65–78. https://doi.org/10.1016/0925-7721(91)90001-U.
    Full Text
  - Agarwal, P. K. “Partitioning arrangements of lines II: Applications.” Discrete &Amp; Computational Geometry 5, no. 1 (December 1, 1990): 533–73. https://doi.org/10.1007/BF02187809.
    Full Text
  - Agarwal, P. K. “Partitioning arrangements of lines I: An efficient deterministic algorithm.” Discrete &Amp; Computational Geometry 5, no. 1 (December 1, 1990): 449–83. https://doi.org/10.1007/BF02187805.
    Full Text
  - Agarwal, P. K., B. Aronov, M. Sharir, and S. Suri. “Selecting distances in the plane,” January 1, 1990, 321–31.
  - Agarwal, P. K., H. Edelsbrunner, O. Schwarzkopf, and E. Welzl. “Euclidean minimum spanning trees and bichromatic closest pairs,” January 1, 1990, 203–10.
  - Agarwal, P. K., and M. Sharir. “Red-blue intersection detection algorithms, with applications to motion planning and collision detection.” Siam Journal on Computing 19, no. 2 (January 1, 1990): 297–321. https://doi.org/10.1137/0219020.
    Full Text
  - Agarwal, P. K., M. Sharir, and P. Shor. “Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences.” Journal of Combinatorial Theory, Series A 52, no. 2 (January 1, 1989): 228–74. https://doi.org/10.1016/0097-3165(89)90032-0.
    Full Text
- Book Sections
  - Agarwal, P. K. “Simplex range searching and its variants: A review.” In A Journey through Discrete Mathematics: A Tribute to Jiri Matousek, 1–30, 2017. https://doi.org/10.1007/978-3-319-44479-6_1.
    Full Text
  - Agarwal, P. K. “Range searching.” In Handbook of Discrete and Computational Geometry, Third Edition, 1057–92, 2017. https://doi.org/10.1201/9781315119601.
    Full Text
- Conference Papers
  - Agarwal, P. K., B. Aronov, E. Ezra, and J. Zahl. “An efficient algorithm for generalized polynomial partitioning and its applications.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 129, 2019. https://doi.org/10.4230/LIPIcs.SoCG.2019.5.
    Full Text
  - Agarwal, P. K., H. C. Chang, and A. Xiao. “Efficient algorithms for geometric partial matching.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 129, 2019. https://doi.org/10.4230/LIPIcs.SoCG.2019.6.
    Full Text
  - Agarwal, P. K., R. Cohen, D. Halperin, and W. Mulzer. “Maintaining the union of unit discs under insertions with near-optimal overhead.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 129, 2019. https://doi.org/10.4230/LIPIcs.SoCG.2019.26.
    Full Text
  - Agarwal, P. K., H. Kaplan, G. Kipper, W. Mulzer, G. Rote, M. Sharir, and A. Xiao. “Approximate minimum-weight matching with outliers under translation.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 123, 2018. https://doi.org/10.4230/LIPIcs.ISAAC.2018.26.
    Full Text
  - Lowe, A., and P. K. Agarwal. “Flood-risk analysis on terrains under the multiflow-direction model.” In Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, 53–62, 2018. https://doi.org/10.1145/3274895.3274980.
    Full Text
  - Agarwal, P. K., H. Kaplan, and M. Sharir. “Union of hypercubes and 3D minkowski sums with random sizes.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 107, 2018. https://doi.org/10.4230/LIPIcs.ICALP.2018.10.
    Full Text
  - Agarwal, P. K., F. O. X. Kyle, A. Nath, A. Sidiropoulos, and Y. Wang. “Computing the gromov-hausdorff distance for metric trees.” In Acm Transactions on Algorithms, Vol. 14, 2018. https://doi.org/10.1145/3185466.
    Full Text
  - Agarwal, P. K., N. Kumar, S. Sintos, and S. Suri. “Computing shortest paths in the plane with removable obstacles.” In Leibniz International Proceedings in Informatics, Lipics, 101:51–515, 2018. https://doi.org/10.4230/LIPIcs.SWAT.2018.5.
    Full Text
  - Agarwal, P. K., K. Fox, K. Munagala, A. Nath, J. Pan, and E. Taylor. “Subtrajectory clustering: Models and algorithms.” In Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, 75–87, 2018. https://doi.org/10.1145/3196959.3196972.
    Full Text
  - Agarwal, P. K., K. Fox, and A. Nath. “Maintaining reeb graphs of triangulated 2-manifolds.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 93, 2018. https://doi.org/10.4230/LIPIcs.FSTTCS.2017.8.
    Full Text
  - Gao, J., P. K. Agarwal, and J. Yang. “Durable top-k queries on temporal data.” In Proceedings of the Vldb Endowment, 11:2223–35, 2018. https://doi.org/10.14778/3275366.3275371.
    Full Text
  - Rav, M., A. Lowe, and P. K. Agarwal. “Flood Risk Analysis on Terrains.” In Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, Vol. 2017-November, 2017. https://doi.org/10.1145/3139958.3139985.
    Full Text
  - Agarwal, P. K., N. Rubin, and M. Sharir. “Approximate nearest neighbor search amid higher-dimensional flats.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 87, 2017. https://doi.org/10.4230/LIPIcs.ESA.2017.4.
    Full Text
  - Agarwal, P. K., N. Kumar, S. Sintos, and S. Suri. “Efficient algorithms for k-regret minimizing sets.” In Leibniz International Proceedings in Informatics, Lipics, Vol. 75, 2017. https://doi.org/10.4230/LIPIcs.SEA.2017.7.
    Full Text
  - Agarwal, P. K., K. Fox, D. Panigrahi, K. R. Varadarajan, and A. Xiao. “Faster algorithms for the geometric transportation problem.” In Leibniz International Proceedings in Informatics, Lipics, 77:71–716, 2017. https://doi.org/10.4230/LIPIcs.SoCG.2017.7.
    Full Text
  - Garg, N., M. Sadiq, and P. Agarwal. “GOASREP: Goal oriented approach for software requirements elicitation and prioritization using analytic hierarchy process.” In Advances in Intelligent Systems and Computing, 516:281–87, 2017. https://doi.org/10.1007/978-981-10-3156-4_28.
    Full Text
  - Wu, Y., J. Gao, P. K. Agarwal, and J. Yang. “Finding diverse, high-value representatives on a surface of answers.” In Proceedings of the Vldb Endowment, 10:793–804, 2017. https://doi.org/10.14778/3067421.3067428.
    Full Text
  - Agarwal, P. K., J. Pan, and W. Victor. “An efficient algorithm for placing electric vehicle charging stations.” In Leibniz International Proceedings in Informatics, Lipics, 64:7.1-7.12, 2016. https://doi.org/10.4230/LIPIcs.ISAAC.2016.7.
    Full Text
  - Nath, A., K. Fox, P. K. Agarwal, and K. Munagala. “Massively parallel algorithms for computing TIN DEMs and contour trees for large terrains.” In Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, 2016. https://doi.org/10.1145/2996913.2996952.
    Full Text
  - Ying, R., J. Pan, K. Fox, and P. K. Agarwal. “A simple efficient approximation algorithm for dynamic time warping.” In Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, 2016. https://doi.org/10.1145/2996913.2996954.
    Full Text
  - Agarwal, P. K., K. Fox, K. Munagala, and A. Nath. “Parallel algorithms for constructing range and nearest-neighbor searching data structures.” In Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, 26-June-01-July-2016:429–40, 2016. https://doi.org/10.1145/2902251.2902303.
    Full Text
  - Agarwal, P. K., N. Kumar, S. Sintos, and S. Suri. “Range-max queries on uncertain data.” In Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, 26-June-01-July-2016:465–76, 2016. https://doi.org/10.1145/2902251.2902281.
    Full Text
  - Agarwal, P. K., K. Fox, and O. Salzman. “An efficient algorithm for computing high-quality paths amid polygonal obstacles.” In Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, 2:1179–92, 2016.
  - Pan, J., V. Rao, P. K. Agarwal, and A. E. Gelfand. “Markov-modulated marked poisson processes for check-in data.” In 33rd International Conference on Machine Learning, Icml 2016, 5:3311–20, 2016.
  - Zhang, W., P. K. Agarwal, and S. Mukherjee. “Contour trees of uncertain terrains.” In Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, Vol. 03-06-November-2015, 2015. https://doi.org/10.1145/2820783.2820823.
    Full Text
  - Agarwal, P. “Message from program chair.” In Conference Proceeding 2015 International Conference on Advances in Computer Engineering and Applications, Icacea 2015, 2015. https://doi.org/10.1109/ICACEA.2015.7164861.
    Full Text
  - Garg, N., P. Agarwal, and S. Khan. “Recent advancements in requirement elicitation and prioritization techniques.” In Conference Proceeding 2015 International Conference on Advances in Computer Engineering and Applications, Icacea 2015, 237–40, 2015. https://doi.org/10.1109/ICACEA.2015.7164702.
    Full Text
  - Gupta, P., and P. Agarwal. “Experimental study & analysis of genetic operators for alignment of multiple biological sequences.” In Conference Proceeding 2015 International Conference on Advances in Computer Engineering and Applications, Icacea 2015, 643–48, 2015. https://doi.org/10.1109/ICACEA.2015.7164770.
    Full Text
  - Sekhon, A., and P. Agarwal. “Face recognition using back propagation neural network technique.” In Conference Proceeding 2015 International Conference on Advances in Computer Engineering and Applications, Icacea 2015, 226–30, 2015. https://doi.org/10.1109/ICACEA.2015.7164700.
    Full Text
  - Lebeck, N., T. Mølhave, and P. K. Agarwal. “Computing highly occluded paths using a sparse network.” In Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, 04-07-November-2014:3–12, 2014. https://doi.org/10.1145/2666310.2666394.
    Full Text
  - Agarwal, P. K., S. Har-Peled, S. Suri, H. YIldIz, and W. Zhang. “Convex hulls under uncertainty.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8737 LNCS:37–48, 2014. https://doi.org/10.1007/978-3-662-44777-2_4.
    Full Text
  - Agarwal, P., R. Gupta, T. Maheswari, S. Yadav, and V. Bali. “A genetic algorithm for alignment of multiple DNA sequences.” In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 108 LNICST:437–43, 2012. https://doi.org/10.1007/978-3-642-35615-5_71.
    Full Text
  - Agarwal, P., and S. A. M. Rizvi. “A technique based on neural network for predicting the secondary structure of proteins.” In Proceedings International Conference on Computational Intelligence and Multimedia Applications, Iccima 2007, 2:382–86, 2008. https://doi.org/10.1109/ICCIMA.2007.47.
    Full Text
  - Rizvi, S. A. M., and P. Agarwal. “A time efficient algorithm for finding longest common subsequence from two molecular sequences.” In Bioengineering, Proceedings of the Northeast Conference, 302–6, 2007. https://doi.org/10.1109/NEBC.2007.4413398.
    Full Text
  - Agarwal, P. K., J. Xie, J. Yang, and H. Yu. “Scalable continuous query processing by tracking hotspots.” In Vldb 2006 Proceedings of the 32nd International Conference on Very Large Data Bases, 31–42, 2006.
  - Rizvi, S. A. M., and P. Agarwal. “A new bucket-based algorithm for finding LCS from two given molecular sequences.” In Proceedings Third International Conference Oninformation Technology: New Generations, Itng 2006, 2006:560–61, 2006. https://doi.org/10.1109/ITNG.2006.12.
    Full Text
  - Agarwal, P. K., S. Cabello, J. A. Sellarès, and M. Sharir. “Computing a center-transversal line.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4337 LNCS:93–104, 2006.
  - Agarwal, P. K., M. De Berg, J. Gao, L. J. Guibas, and S. Har-Peled. “Staying in the middle: Exact and approximate medians in R1 and R2 for moving points.” In Proceedings of the 17th Canadian Conference on Computational Geometry, Cccg 2005, 43–46, 2005.
  - Agarwal, P. K., C. M. Procopiuc, and K. R. Varadarajan. “Approximation algorithms for k-line center.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2461:54–63, 2002.
  - Agarwal, P. K., H. Edelsbrunner, and Y. Wang. “Computing the writhing number of a polygonal knot.” In Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, 06-08-January-2002:791–99, 2002.
  - Agarwal, P. K., J. Gao, and L. J. Guibas. “Kinetic medians and kd-trees.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2461:5–17, 2002.
  - Agarwal, P. K., S. Govindarajan, and S. Muthukrishnan. “Range searching in categorical data: Colored range searching on grid.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2461:17–28, 2002.
  - Agarwal, P. K., S. Har-Peled, N. H. Mustafa, and Y. Wang. “Near-linear time approximation algorithms for curve simplification.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2461:29–41, 2002.
  - Agarwal, P. K., T. Hagerup, R. Ray, M. Sharir, M. Smid, and E. Welzl. “Translating a planar object to maximize point containment.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2461:42–53, 2002.
  - Agarwal, P. K., and M. Sharir. “Pseudo-line arrangements: Duality, algorithms, and applications.” In Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, 06-08-January-2002:800–809, 2002.
  - Procopiuc, C. M., P. K. Agarwal, and S. Har-Peled. “Star-tree: An efficient self-adjusting index for moving objects.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2409:178–93, 2002.
  - Agarwal, P. K., L. Arge, O. Procopiuc, and J. S. Vittery. “A framework for index bulk loading and dynamization.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2076 LNCS:115–27, 2001.
  - Agarwal, P. K., L. Arge, and J. Vahrenhold. “Time responsive external data structures for moving points.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2125:50–61, 2001. https://doi.org/10.1007/3-540-44634-6_6.
    Full Text
  - Agarwal, P. K., M. de Berg, S. Har-Peled, M. H. Overmars, M. Sharir, and J. Vahrenhold. “Reporting intersecting pairs of polytopes in two and three dimensions.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2125:122–34, 2001. https://doi.org/10.1007/3-540-44634-6_12.
    Full Text
  - Agarwal, P. K., E. Flato, and D. Halperin. “Polygon decomposition for efficient construction of Minkowski sums.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1879:20–31, 2000.
  - Agarwal, P. K., L. J. Guibas, S. Har-Peled, A. Rabinovitch, and M. Sharir. “Computing the penetration depth of two convex polytopes in 3d.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1851:328–38, 2000. https://doi.org/10.1007/3-540-44985-X.
    Full Text
  - Agarwal, P. K., B. K. Bhattacharya, and S. Sen. “Output-sensitive algorithms for uniform partitions of points.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1741:403–14, 1999. https://doi.org/10.1007/3-540-46632-0_41.
    Full Text
  - Murali, T. M., P. K. Agarwal, and J. S. Vitter. “Constructing binary space partitions for orthogonal rectangles in practice.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1461 LNCS:211–22, 1998.
  - Agarwal, P. K., L. J. Guibas, J. Hershberger, and E. Veach. “Maintaining the extent of a moving point set.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1272:31–44, 1997.
  - Agarwal, P. K., M. De Berg, D. Halperin, and M. Sharir. “Efficient generation of k-directional assembly sequences.” In Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Part F129447:122–31, 1996.
  - Wang, H., and P. K. Agarwal. “Approximation algorithms for curvature-constrained shortest paths.” In Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Part F129447:409–18, 1996.
  - Agarwal, P. K., B. Aronov, J. Pach, R. Pollack, and M. Sharir. “Quasi-planar graphs have a linear number of edges.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1027:1–7, 1996.
  - Agarwal, P. K., A. Efrat, and M. Sharir. “Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications.” In Proceedings of the Annual Symposium on Computational Geometry, Part F129372:39–50, 1995. https://doi.org/10.1145/220279.220284.
    Full Text
  - Agarwal, P. K., B. Aronov, and S. Suri. “Stabbing triangulations by lines in 3D.” In Proceedings of the Annual Symposium on Computational Geometry, Part F129372:267–76, 1995. https://doi.org/10.1145/220279.220308.
    Full Text
  - Agarwal, P. K., O. Schwarzkopf, and M. Sharir. “The overlay of lower envelopes in three dimensions and its applications.” In Proceedings of the Annual Symposium on Computational Geometry, Part F129372:182–89, 1995. https://doi.org/10.1145/220279.220299.
    Full Text
  - Agarwal, P. K., and M. Sharir. “Efficient randomized algorithms for some geometric optimization problems.” In Proceedings of the Annual Symposium on Computational Geometry, Part F129372:326–35, 1995. https://doi.org/10.1145/220279.220314.
    Full Text
  - Agarwal, P. K., M. J. Katz, and M. Sharir. “Computing depth orders and related problems.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 824 LNCS:1–12, 1994.
  - Agarwal, P. K., and S. Sen. “Selection in monotone matrices and computing k^th nearest neighbors.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 824 LNCS:13–24, 1994.
  - Agarwal, P. K., and M. Van Kreveld. “Connected component and simple polygon intersection searching.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 709 LNCS:37–47, 1993.
  - Agarwal, P. K., M. Sharir, and S. Toledo. “Applications of parametric searching in geometric optimization.” In Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Part F129721:72–82, 1992.
  - Agarwal, P. K., and J. Matoušek. “Relative neighborhood graphs in three dimensions.” In Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Part F129721:58–65, 1992.
  - Agarwal, P. K., D. Eppstein, and J. Matousek. “Dynamic half-space reporting, geometric optimization, and minimum spanning trees.” In Proceedings Annual Ieee Symposium on Foundations of Computer Science, Focs, 1992-October:80–89, 1992. https://doi.org/10.1109/SFCS.1992.267816.
    Full Text
  - Agarwal, P. K., and J. Matoušek. “On range searching with semialgebraic sets.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 629 LNCS:1–13, 1992.
  - Agarwal, P. K., and M. van Kreveld. “Implicit point location of line segments, with an arrangements an application to motion planning.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 652 LNCS:80–91, 1992.
  - Agarwal, P. K., M. V. Kreveld, and M. Overmars. “Intersection queries for curved objects.” In Proceedings of the Annual Symposium on Computational Geometry, 41–50, 1991. https://doi.org/10.1145/109648.109653.
    Full Text
  - Agarwal, P. K., and M. Sharir. “Counting circular arc intersections.” In Proceedings of the Annual Symposium on Computational Geometry, 10–20, 1991. https://doi.org/10.1145/109648.109650.
    Full Text
  - Agarwal, P. K., and M. Sharir. “Planar geometric location problems and maintaining the width of a planar set.” In Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, 449–58, 1991.
  - Agarwal, P. K., J. Matoušek, and S. Suri. “Farthest neighbors, maximum spanning trees and related problems in higher dimensions.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 519 LNCS:105–16, 1991. https://doi.org/10.1007/BFb0028254.
    Full Text
  - Agarwal, P. K., B. Aronov, J. O’Rourke, and C. A. Schevon. “Star unfolding of a polytope with applications.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 447 LNCS:251–63, 1990. https://doi.org/10.1007/3-540-52846-6_94.
    Full Text
  - Kreveld, M. van, M. Overmars, and P. K. Agarwal. “Intersection queries in sets of disks.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 447 LNCS:393–403, 1990. https://doi.org/10.1007/3-540-52846-6_107.
    Full Text
Teaching & Mentoring
Recent Courses
- COMPSCI 532: Design and Analysis of Algorithms 2019
- CBB 634: Geometric Algorithms 2018
- COMPSCI 634: Geometric Algorithms 2018
- COMPSCI 394: Research Independent Study 2017
Scholarly, Clinical, & Service Activities
Outreach & Engaged Scholarship
- Bass Connections Faculty Team Leader. Data and Technology for Fact-checking. 2018 - 2019 2018 - 2019

Some information on this profile has been compiled automatically from Duke databases and external sources. (Our About page explains how this works.) If you see a problem with the information, please write to Scholars@Duke and let us know. We will reply promptly.

Education, Training, & Certifications

Duke Appointment History

Awards & Honors

Selected Publications

Books

Academic Articles

Book Sections

Conference Papers

Recent Courses

Outreach & Engaged Scholarship