Math @ Duke

Books
 P.K. Agarwal, Robotics: The Algorithmic Perspective, edited by L. Kavraki and M. Mason
(1998), A. K. Peters, Wellesley
 M. Sharir and P.K. Agarwal, DavenportSchinzel Sequences and Their Geometric Applications
(1995), Cambridge University Press, CambridgeNew YorkMelbourne
 J. Pach and P.K. Agarwal, Combinatorial Geometry
(1995), John Wiley and Sons, New York
 P. K. Agarwal, Intersection and Decomposition Algorithms for Planar Arrangements,
(1991), Cambridge University Press, CambridgeNew YorkMelbourne
Papers Published
 Agarwal, PK; HarPeled, S; Suri, S; Yıldız, H; Zhang, W, Convex Hulls Under Uncertainty,
Algorithmica, vol. 79 no. 2
(October, 2017),
pp. 340367 [doi]
 Agarwal, PK; Rubin, N; Sharir, M, Approximate nearest neighbor search amid higherdimensional flats,
LIPIcs, vol. 87
(September, 2017), ISBN 9783959770491 [doi] [abs]
 Agarwal, PK; Kumar, N; Sintos, S; Suri, S, Efficient algorithms for kregret minimizing sets,
LIPIcs, vol. 75
(August, 2017), ISBN 9783959770361 [doi] [abs]
 Agarwal, PK; Fox, K; Panigrahi, D; Varadarajan, KR; Xiao, A, Faster algorithms for the geometric transportation problem,
LIPIcs, vol. 77
(June, 2017),
pp. 71716, ISBN 9783959770385 [doi] [abs]
 Wu, Y; Agarwal, PK; Li, C; Yang, J; Yu, C, Computational Fact Checking through Query Perturbations,
ACM Transactions on Database Systems, vol. 42 no. 1
(January, 2017),
pp. 141 [doi]
 Agarwal, PK; Kumar, N; Sintos, S; Suri, S, Rangemax queries on uncertain data,
Journal of Computer and System Sciences
(January, 2017) [doi] [abs]
 Wu, Y; Gao, J; Agarwal, PK; Yang, J, Finding diverse, highvalue representatives on a surface of answers,
Proceedings of the VLDB Endowment International Conference on Very Large Data Bases, vol. 10 no. 7
(January, 2017),
pp. 793804 [abs]
 Garg, N; Sadiq, M; Agarwal, P, GOASREP: Goal oriented approach for software requirements elicitation and prioritization using analytic hierarchy process,
Advances in Intelligent Systems and Computing, vol. 516
(January, 2017),
pp. 281287, ISBN 9789811031557 [doi] [abs]
 Agarwal, PK; Pan, J; Victor, W, An efficient algorithm for placing electric vehicle charging stations,
LIPIcs, vol. 64
(December, 2016),
pp. 7.17.12, ISBN 9783959770262 [doi] [abs]
 Ying, R; Pan, J; Fox, K; Agarwal, PK, A simple efficient approximation algorithm for dynamic time warping,
GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
(October, 2016), ISBN 9781450345897 [doi] [abs]
 Nath, A; Fox, K; Agarwal, PK; Munagala, K, Massively parallel algorithms for computing TIN DEMs and contour trees for large terrains,
GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
(October, 2016), ISBN 9781450345897 [doi] [abs]
 Agarwal, PK; Aronov, B; HarPeled, S; Phillips, JM; Yi, K; Zhang, W, NearestNeighbor Searching Under Uncertainty II,
ACM Transactions on Algorithms, vol. 13 no. 1
(October, 2016),
pp. 125 [doi]
 Agarwal, PK; Kumar, N; Sintos, S; Suri, S, Rangemax queries on uncertain data,
Proceedings of the ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, vol. 26June01July2016
(June, 2016),
pp. 465476, ISBN 9781450341912 [doi] [abs]
 Agarwal, PK; Fox, K; Munagala, K; Nath, A, Parallel algorithms for constructing range and nearestneighbor searching data structures,
Proceedings of the ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, vol. 26June01July2016
(June, 2016),
pp. 429440, ISBN 9781450341912 [doi] [abs]
 Agarwal, PK; Fox, K; Pan, J; Ying, R, Approximating dynamic time warping and edit distance for a pair of point sequences,
LIPIcs, vol. 51
(June, 2016),
pp. 6.16.16 [doi] [abs]
 Yu, A; Agarwal, PK; Yang, J, Top$k$ Preferences in High Dimensions,
IEEE Transactions on Knowledge and Data Engineering, vol. 28 no. 2
(February, 2016),
pp. 311325, ISSN 10414347 [doi]
 Agarwal, PK; Fox, K; Salzman, O, An efficient algorithm for computing highquality paths amid polygonal obstacles,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms, vol. 2
(January, 2016),
pp. 11791192, ISBN 9781510819672 [abs]
 Pan, J; Rao, V; Agarwal, PK; Gelfand, AE, Markovmodulated marked poisson processes for checkin data,
33rd International Conference on Machine Learning, ICML 2016, vol. 5
(January, 2016),
pp. 33113320, ISBN 9781510829008 [abs]
 Agarwal, PK; Gao, J; Guibas, LJ; Kaplan, H; Rubin, N; Sharir, M, Stable Delaunay Graphs,
Discrete & Computational Geometry, vol. 54 no. 4
(December, 2015),
pp. 905929, ISSN 01795376 [doi]
 Agarwal, PK; Kaplan, H; Rubin, N; Sharir, M, Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions,
Discrete & Computational Geometry, vol. 54 no. 4
(December, 2015),
pp. 871904, ISSN 01795376 [doi]
 Zhang, W; Agarwal, PK; Mukherjee, S, Contour trees of uncertain terrains,
GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems, vol. 0306November2015
(November, 2015), ISBN 9781450339674 [doi] [abs]
 Agarwal, PK; Mølhave, T; Revsbæk, M; Safa, I; Wang, Y; Yang, J, Maintaining Contour Trees of Dynamic Terrains,
LIPIcs, vol. 34
(June, 2015),
pp. 796811, ISSN 18688969 [doi] [abs]
 Agarwal, PK; Fox, K; Nath, A; Sidiropoulos, A; Wang, Y, Computing the GromovHausdorff distance for metric trees,
Lecture notes in computer science, vol. 9472
(January, 2015),
pp. 529540, ISSN 03029743 [doi] [abs]
 Gupta, P; Agarwal, P, Experimental study & analysis of genetic operators for alignment of multiple biological sequences,
Conference Proceeding  2015 International Conference on Advances in Computer Engineering and Applications, ICACEA 2015
(January, 2015),
pp. 643648, ISBN 9781467369114 [doi] [abs]
 Garg, N; Agarwal, P; Khan, S, Recent advancements in requirement elicitation and prioritization techniques,
Conference Proceeding  2015 International Conference on Advances in Computer Engineering and Applications, ICACEA 2015
(January, 2015),
pp. 237240, ISBN 9781467369114 [doi] [abs]
 Sekhon, A; Agarwal, P, Face recognition using back propagation neural network technique,
Conference Proceeding  2015 International Conference on Advances in Computer Engineering and Applications, ICACEA 2015
(January, 2015),
pp. 226230, ISBN 9781467369114 [doi] [abs]
 Agarwal, P, Message from program chair,
Conference Proceeding  2015 International Conference on Advances in Computer Engineering and Applications, ICACEA 2015
(January, 2015), ISBN 9781467369114 [doi]
 Agarwal, PK; Sharathkumar, R, Streaming Algorithms for Extent Problems in High Dimensions,
Algorithmica, vol. 72 no. 1
(2015),
pp. 8398, ISSN 01784617 [doi] [abs]
 Salzman, O; Shaharabani, D; Agarwal, PK; Halperin, D, Sparsification of motionplanning roadmaps by edge contraction,
International Journal of Robotics Research, vol. 33 no. 14
(December, 2014),
pp. 17111725, ISSN 02783649 [doi]
 Lebeck, N; Mølhave, T; Agarwal, PK, Computing highly occluded paths using a sparse network,
GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems, vol. 0407November2014
(November, 2014),
pp. 312, ISBN 9781450331319 [doi] [abs]
 Agarwal, PK; HarPeled, S; Kaplan, H; Sharir, M, Union of Random Minkowski Sums and Network Vulnerability Analysis,
Discrete & Computational Geometry, vol. 52 no. 3
(October, 2014),
pp. 551582, ISSN 01795376 [doi]
 Wu, Y; Agarwal, PK; Li, C; Yang, J; Yu, C, Toward computational factchecking,
Proceedings of the VLDB Endowment International Conference on Very Large Data Bases, vol. 7 no. 7
(March, 2014),
pp. 589600, ISSN 21508097 [doi]
 Sankararaman, S; Efrat, A; Ramasubramanian, S; Agarwal, PK, On channeldiscontinuityconstraint routing in wireless networks,
Ad Hoc Networks, vol. 13 no. PART A
(February, 2014),
pp. 153169, ISSN 15708705 [doi] [abs]
 Agarwal, PK; Pan, J, Nearlinear algorithms for geometric hitting sets and set covers,
Proceedings of the Annual Symposium on Computational Geometry
(January, 2014),
pp. 271279 [doi] [abs]
 Agarwal, PK; Sharathkumar, R, Approximation algorithms for bipartite matching with metric and geometric costs,
Proceedings of the Annual ACM Symposium on Theory of Computing
(January, 2014),
pp. 555564, ISSN 07378017 [doi] [abs]
 Wu, Y; Walenz, B; Li, P; Shim, A; Sonmez, E; Agarwal, PK; Li, C; Yang, J; Yu, C, ICheck: Computationally combating "lies, D  Ned Lies, and statistics",
Proceedings / ACMSIGMOD International Conference on Management of Data. ACMSigmod International Conference on Management of Data
(January, 2014),
pp. 10631066, ISSN 07308078 [doi] [abs]
 Agarwal, PK; HarPeled, S; Suri, S; YIldIz, H; Zhang, W, Convex hulls under uncertainty,
Lecture notes in computer science, vol. 8737 LNCS
(January, 2014),
pp. 3748, ISSN 03029743, ISBN 9783662447765 [doi] [abs]
 Yu, A; Agarwal, PK; Yang, J, Topk preferences in high dimensions,
Proceedings / International Conference on Data Engineering. International Conference on Data Engineering
(January, 2014),
pp. 748759, ISSN 10844627 [doi] [abs]
 Agarwal, PK; Aronov, B; Van Kreveld, M; Löffler, M; Silveira, RI, Computing correlation between piecewiselinear functions,
SIAM Journal on Computing, vol. 42 no. 5
(December, 2013),
pp. 18671887, ISSN 00975397 [doi] [abs]
 Agarwal, PK; Matoušek, J; Sharir, M, On range searching with semialgebraic sets. II,
SIAM Journal on Computing, vol. 42 no. 6
(December, 2013),
pp. 20392062, ISSN 00975397 [doi] [abs]
 Lebeck, N; Mølhave, T; Agarwal, PK, Computing highly occluded paths on a terrain,
GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
(December, 2013),
pp. 1423 [doi] [abs]
 Sankararaman, S; Agarwal, PK; Mølhave, T; Pan, J; Boedihardjo, AP, Modeldriven matching and segmentation of trajectories,
GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
(December, 2013),
pp. 234243 [doi] [abs]
 Agarwal, PK; Cormode, G; Huang, Z; Phillips, JM; Wei, Z; Yi, K, Mergeable summaries,
ACM Transactions on Database Systems, vol. 38 no. 4
(November, 2013), ISSN 03625915 [doi] [abs]
 Agarwal, PK; Efrat, A; Ganjugunte, SK; Hay, D; Sankararaman, S; Zussman, G, The resilience of WDM networks to probabilistic geographical failures,
IEEE/ACM Transactions on Networking (ACM), vol. 21 no. 5
(January, 2013),
pp. 15251538, ISSN 10636692 [doi] [abs]
 Agarwal, PK; Sharathkumar, R; Agarwal, PK; Sharathkumar, R, Streaming Algorithms for Extent Problems in High DimensionsStreaming Algorithms for Extent Problems in High Dimensions,
Algorithmica
(2013),
pp. 116, ISSN 01784617 [doi] [abs]
 Agarwal, PK; Aronov, B; HarPeled, S; Phillips, JM; Yi, K; Zhang, W, Nearest neighbor searching under uncertainty II,
Proceedings of the ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems
(2013),
pp. 115126 [doi] [abs]
 Agarwal, PK; Kaplan, H; Sharir, M, Union of random minkowski sums and network vulnerability analysis,
Proceedings of the Annual Symposium on Computational Geometry
(2013),
pp. 177186 [abs]
 Agarwal, PK; HarPeled, S; Yu, H, EMBEDDINGS OF SURFACES, CURVES, AND MOVING POINTS IN EUCLIDEAN SPACE,
SIAM Journal on Computing, vol. 42 no. 2
(2013),
pp. 442458, ISSN 00975397 [Gateway.cgi], [doi]
 Afshani, P; Agarwal, PK; Arge, L; Larsen, KG; Phillips, JM, (Approximate) Uncertain Skylines,
Theory of Computing Systems, vol. 52 no. 3
(2013),
pp. 342366, ISSN 14324350 [doi] [abs]
 Agarwal, PK; Efrat, A; Ganjugunte, SK; Hay, D; Sankararaman, S; Zussman, G, The Resilience of WDM Networks to Probabilistic Geographical Failures,
IEEE/ACM Transactions on Networking (ACM)
(2013), ISSN 10636692 [doi] [abs]
 Agarwal, PK; Arge, L; Govindarajan, S; Yang, J; Yi, K, Efficient external memory structures for rangeaggregate queries,
Computational Geometry, vol. 46 no. 3
(2013),
pp. 358370, ISSN 09257721 [doi] [abs]
 Agarwal, P; Gupta, R; Maheswari, T; Agarwal, P; Yadav, S; Bali, V, A genetic algorithm for alignment of multiple DNA sequences,
Lecture Notes of the Institute for Computer Sciences, SocialInformatics and Telecommunications Engineering, vol. 108 LNICST
(December, 2012),
pp. 437443, ISBN 9783642356148 [doi] [abs]
 Shaharabani, D; Salzman, O; Agarwal, PK; Halperin, D, Sparsification of MotionPlanning Roadmaps by Edge Contraction
(September, 2012) [1209.4463v1] [abs]
 Agarwal, PK; Avraham, RB; Kaplan, H; Sharir, M, Computing the Discrete Fréchet Distance in Subquadratic Time
(April, 2012) [1204.5333v1] [abs]
 Agarwal, PK; Matoušek, J; Sharir, M, On range searching with semialgebraic sets II,
Annual Symposium on Foundations of Computer Science
(2012),
pp. 420429, ISSN 02725428 [doi] [abs]
 Afshani, P; Agarwal, PK; Arge, L; Larsen, KG; Phillips, JM, (Approximate) Uncertain Skylines,
Theory of Computing Systems
(2012),
pp. 125, ISSN 14324350 [doi] [abs]
 Sharathkumar, R; Agarwal, PK, Algorithms for the transportation problem in geometric settings,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(2012),
pp. 306317 [abs]
 Agarwal, PK; Arge, L; Kaplan, H; Molad, E; Tarjan, RE; Yi, K, An optimal dynamic data structure for stabbingsemigroup queries,
SIAM Journal on Computing, vol. 41 no. 1
(2012),
pp. 104127, ISSN 00975397 [doi] [abs]
 Agarwal, PK; Cormode, G; Huang, Z; Phillips, J; Wei, Z; Yi, K, Mergeable summaries,
Proceedings of the ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems
(2012),
pp. 2334 [doi] [abs]
 Agarwal, PK; Efrat, A; Sankararaman, S; Zhang, W, Nearestneighbor searching under uncertainty,
Proceedings of the ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems
(2012),
pp. 225236 [doi] [abs]
 Sharathkumar, R; Agarwal, PK, A nearlinear time εapproximation algorithm for geometric bipartite matching,
Proceedings of the Annual ACM Symposium on Theory of Computing
(2012),
pp. 385394, ISSN 07378017 [doi] [abs]
 Yu, A; Agarwal, PK; Yang, J, Processing a large number of continuous preference topk queries,
Proceedings / ACMSIGMOD International Conference on Management of Data. ACMSigmod International Conference on Management of Data
(2012),
pp. 397408, ISSN 07308078 [doi] [abs]
 Yu, A; Agarwal, PK; Yang, J, Processing and notifying range topk subscriptions,
Proceedings / International Conference on Data Engineering. International Conference on Data Engineering
(2012),
pp. 810821, ISSN 10844627 [doi] [abs]
 Yu, A; Agarwal, PK; Yang, J, Subscriber assignment for widearea contentbased publish/subscribe,
IEEE Transactions on Knowledge and Data Engineering, vol. 24 no. 10
(2012),
pp. 18331847, ISSN 10414347 [doi] [abs]
 Agarwal, PK; Avraham, RB; Sharir, M, The 2center problem in three dimensions,
Computational Geometry
(2012), ISSN 09257721 [doi] [abs]
 Agarwal, PK; Ezra, E; Sharir, M, Nearlinear approximation algorithms for geometric hitting sets,
Algorithmica, vol. 63 no. 12
(2012),
pp. 125, ISSN 01784617 [doi] [abs]
 Agarwal, PK; Cheng, SW; Yi, K, Range searching on uncertain data,
ACM Transactions on Algorithms, vol. 8 no. 4
(2012), ISSN 15496325 [doi] [abs]
 Wu, Y; Agarwal, PK; Li, C; Yang, J; Yu, C, On "one of the few" objects,
Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
(2012),
pp. 14871495 [doi] [abs]
 Clark, JS; Agarwal, P; Bell, DM; Flikkema, PG; Gelfand, A; Nguyen, X; Ward, E; Yang, J, Inferential ecosystem models, from network data to prediction.,
Ecological Applications, vol. 21 no. 5
(July, 2011),
pp. 15231536, ISSN 10510761 [21830699] [abs]
 Afshani, P; Agarwal, PK; Arge, L; Larsen, KG; Phillips, JM, (Approximate) uncertain skylines,
ACM International Conference Proceeding Series
(2011),
pp. 186196 [doi] [abs]
 Agarwal, PK; Mølhave, T; Sadri, B, I/Oefficieiit contour queries on terrains,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(2011),
pp. 268284 [abs]
 Yu, A; Agarwal, PK; Yang, J, Subscriber assignment for widearea contentbased publish/subscribe,
Proceedings / International Conference on Data Engineering. International Conference on Data Engineering
(2011),
pp. 267278, ISSN 10844627 [doi] [abs]
 Agarwal, PK; Mølhave, T; Yu, H; Clark, JS, Exploiting temporal coherence in forest dynamics simulation,
Proceedings of the Annual Symposium on Computational Geometry
(2011),
pp. 7786 [doi] [abs]
 Agarwal, PK; Efrat, A; Gniady, C; Mitchell, JSB; Polishchuk, V; Sabhnani, GR, 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
(2011) [doi] [abs]
 Agarwal, PK; Efrat, A; Ganjugunte, S; Hay, D; Sankararaman, S; Zussman, G, The resilience of WDM networks to probabilistic geographical failures,
Proceedings  IEEE INFOCOM
(2011),
pp. 15211529, ISSN 0743166X [doi] [abs]
 Beutel, A; Mølhave, T; Agarwal, PK; Boedihardjo, AP; Shine, JA, TerraNNI: Natural neighbor interpolation on a 3D grid using a GPU,
GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
(2011),
pp. 6473 [doi] [abs]
 Abam, MA; Agarwal, PK; Berg, MD; Yu, H, Outoforder event processing in kinetic data structures,
Algorithmica, vol. 60 no. 2
(2011),
pp. 250273, ISSN 01784617 [doi] [abs]
 Chen, L; Tang, C; Yang, J; Kitsuregawa, M; Li, Q, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface,
Lecture notes in computer science, vol. 6184 LNCS
(August, 2010),
pp. VVI, ISSN 03029743, ISBN 3540290087
 Agarwal, PK; Sharathkumar, R, Streaming algorithms for extent problems in high dimensions,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(2010),
pp. 14811489 [abs]
 Agarwal, PK; Efrat, A; Sharathkumar, R; Yu, H, On approximate geodesicdistance queries amid deforming point clouds,
Springer Tracts in Advanced Robotics, vol. 57
(2010),
pp. 351365, ISSN 16107438 [doi] [abs]
 Sankararaman, S; Efrat, A; Ramasubramanian, S; Agarwal, PK, On channeldiscontinuityconstraint routing in wireless networks,
Proceedings  IEEE INFOCOM
(2010), ISSN 0743166X [doi] [abs]
 Agarwal, PK; Phillips, JM; Sadri, B, Lipschitz unimodal and isotonic regression on paths and trees,
Lecture notes in computer science, vol. 6034 LNCS
(2010),
pp. 384396, ISSN 03029743 [doi] [abs]
 Agarwal, PK; Aronov, B; Kreveld, MV; Löffler, M; Silveira, RI, Computing similarity between piecewiselinear functions,
Proceedings of the Annual Symposium on Computational Geometry
(2010),
pp. 375383 [doi] [abs]
 Agarwal, PK, An improved algorithm for computing the volume of the union of cubes,
Proceedings of the Annual Symposium on Computational Geometry
(2010),
pp. 230239 [doi] [abs]
 Agarwal, PK; Gao, J; Guibas, LJ; Kaplan, H; Koltun, V; Rubin, N; Sharir, M, Kinetic stable Delaunay graphs,
Proceedings of the Annual Symposium on Computational Geometry
(2010),
pp. 127136 [doi] [abs]
 Agarwal, PK; BenAvraham, R; Sharir, M, The 2center problem in three dimensions,
Proceedings of the Annual Symposium on Computational Geometry
(2010),
pp. 8796 [doi] [abs]
 Agarwal, PK; Phillips, JM; Yu, H, Stability of εkernels,
Lecture notes in computer science, vol. 6346 LNCS no. PART 1
(2010),
pp. 487499, ISSN 03029743 [doi] [abs]
 Mølhave, T; Agarwal, PK; Arge, L; Revsbæk, M, Scalable algorithms for large highresolution terrain data,
ACM International Conference Proceeding Series
(2010) [doi] [abs]
 Beutel, A; Mølhave, T; Agarwal, PK, Natural neighbor interpolation based grid DEM construction using a GPU,
GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
(2010),
pp. 172181 [doi] [abs]
 Agarwal, PK; Efrat, A; Ganjugunte, SK; Hay, D; Sankararaman, S; Zussman, G, Network vulnerability to single, multiple, and probabilistic physical attacks,
Proceedings  IEEE Military Communications Conference MILCOM
(2010),
pp. 18241829 [doi] [abs]
 Agarwal, PK; HarPeled, S; Sharir, M; Wang, Y, Hausdorff distance under translation for points and balls,
ACM Transactions on Algorithms, vol. 6 no. 4
(2010), ISSN 15496325 [doi] [abs]
 Agarwal, PK; Arge, L; Yi, K, I/Oefficient batched unionfind and its applications to terrain analysis,
ACM Transactions on Algorithms, vol. 7 no. 1
(2010), ISSN 15496325 [doi] [abs]
 Agarwal, PK; Bereg, S; Daescu, O; Kaplan, H; Ntafos, S; Sharir, M; Zhu, B, Guarding a terrain by two watchtowers,
Algorithmica, vol. 58 no. 2
(2010),
pp. 352390, ISSN 01784617 [doi] [abs]
 Agarwal, PK; Sharathkumar, R; Yu, H, Approximate Euclidean shortest paths amid convex obstacles,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(2009),
pp. 283292 [abs]
 Agarwal, PK; Ezra, E; Ganjugunte, SK, Efficient sensor placement for surveillance problems,
Lecture notes in computer science, vol. 5516 LNCS
(2009),
pp. 301314, ISSN 03029743 [doi] [abs]
 Agarwal, PK; Xie, J; Yang, J; Yu, H, Inputsensitive scalable continuous join query processing,
ACM Transactions on Database Systems, vol. 34 no. 3
(2009), ISSN 03625915 [doi] [abs]
 Agarwal, PK; Cheng, SW; Tao, Y; Yi, K, Indexing uncertain data,
Proceedings of the ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems
(2009),
pp. 137146 [doi] [abs]
 Agarwal, PK; Ezra, E; Sharir, M, Nearlinear approximation algorithms for geometric hitting sets,
Proceedings of the Annual Symposium on Computational Geometry
(2009),
pp. 2332 [doi] [abs]
 Agarwal, PK; Hurtado, F; Toussaint, GT; Trias, J, On polyhedra induced by point sets in space,
Discrete Applied Mathematics, vol. 156 no. 1
(2008),
pp. 4254, ISSN 0166218X [doi] [abs]
 Chandramouli, B; Yang, J; Agarwal, PK; Yu, A; Zheng, Y, ProSem: Scalable widearea publish/subscribe,
Proceedings / ACMSIGMOD International Conference on Management of Data. ACMSigmod International Conference on Management of Data
(2008),
pp. 13151317, ISSN 07308078 [doi] [abs]
 Agarwal, PK; Sadri, B; Yu, H, Untangling triangulations through local explorations,
Proceedings of the Annual Symposium on Computational Geometry
(2008),
pp. 288297 [doi] [abs]
 Agarwal, PK; Arge, L; Moølhave, T; Sadri, B, I/Oefflcient algorithms for computing contours on a terrain,
Proceedings of the Annual Symposium on Computational Geometry
(2008),
pp. 129138 [doi] [abs]
 Agarwal, PK; Phillips, JM, An efficient algorithm for 2D Euclidean 2center with outliers,
Lecture notes in computer science, vol. 5193 LNCS
(2008),
pp. 6475, ISSN 03029743 [doi] [abs]
 Agarwal, PK; Chen, DZ; Ganjugunte, SK; Misiołek, E; Sharir, M; Tang, K, Stabbing convex polygons with a segment or a polygon,
Lecture notes in computer science, vol. 5193 LNCS
(2008),
pp. 5263, ISSN 03029743 [doi] [abs]
 Agarwal, PK; Klein, R; Knauer, C; Langerman, S; Morin, P; Sharir, M; Soss, M, Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D,
Discrete & Computational Geometry, vol. 39 no. 13
(2008),
pp. 1737, ISSN 01795376 [doi] [abs]
 Agarwal, PK; HarPeled, S; Yu, H, Robust shape fitting via peeling and grating coresets,
Discrete & Computational Geometry, vol. 39 no. 13
(2008),
pp. 3858, ISSN 01795376 [doi] [abs]
 Yu, H; Agarwal, PK; Poreddy, R; Varadarajan, KR, Practical methods for shape fitting and kinetic data structures using coresets,
Algorithmica, vol. 52 no. 3
(2008),
pp. 378402, ISSN 01784617 [doi] [abs]
 Agarwal, PK; Kaplan, H; Sharir, M, Kinetic and dynamic data structures for closest pair and all nearest neighbors,
ACM Transactions on Algorithms, vol. 5 no. 1
(2008), ISSN 15496325 [doi] [abs]
 Agarwal, PK; Sharir, M; Welzl, E, Algorithms for center and Tverberg points,
ACM Transactions on Algorithms, vol. 5 no. 1
(2008), ISSN 15496325 [doi] [abs]
 Rizvi, SAM; Agarwal, P, A time efficient algorithm for finding longest common subsequence from two molecular sequences,
Proceedings of the IEEE ... annual Northeast Bioengineering Conference. IEEE Northeast Bioengineering Conference
(December, 2007),
pp. 302306, ISBN 1424410339 [doi] [abs]
 Clark, JS; Dietze, M; Chakraborty, S; Agarwal, PK; Ibanez, I; LaDeau, S; Wolosin, M, Resolving the biodiversity paradox.,
Ecology Letters, vol. 10 no. 8
(August, 2007),
pp. 647659 [17594418], [doi] [abs]
 Agarwal, PK; Mustafa, NH; Wang, Y, Fast molecular shape matching using contact maps.,
Journal of Computational Biology, vol. 14 no. 2
(March, 2007),
pp. 131143, ISSN 10665277 [17456012], [doi] [abs]
 Agarwal, PK; Yu, H, A spaceoptimal datastream algorithm for coresets in the plane,
Proceedings of the Annual Symposium on Computational Geometry
(2007),
pp. 110 [doi] [abs]
 Agarwal, PK; Kaplan, H; Sharir, M, Computing the volume of the union of cubes,
Proceedings of the Annual Symposium on Computational Geometry
(2007),
pp. 294301 [doi] [abs]
 Agarwal, PK; HarPeled, S; Yu, H, Embeddings of surfaces, curves, and moving points in euclidean space,
Proceedings of the Annual Symposium on Computational Geometry
(2007),
pp. 381389 [doi] [abs]
 Agarwal, PK; Apfelbaum, R; Purdy, G; Sharir, M, Similar simplices in a ddimensional point set,
Proceedings of the Annual Symposium on Computational Geometry
(2007),
pp. 232238 [doi] [abs]
 Danner, A; Mølhave, T; Yi, K; Agarwal, PK; Arge, L; Mitasova, H, TerraStream: From elevation data to watershed hierarchies,
GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
(2007),
pp. 212219 [doi] [abs]
 Agarwal, PK, Modeling and analyzing massive terrain data sets,
Lecture notes in computer science, vol. 4835 LNCS
(2007),
pp. 1, ISSN 03029743 [abs]
 Flikkema, PG; Agarwal, PK; Clark, JS; Ellis, C; Gelfand, A; Munagala, K; Yang, J, From data reverence to data relevance: Modelmediated wireless sensing of the physical environment,
Lecture notes in computer science, vol. 4487 LNCS
(2007),
pp. 988994, ISSN 03029743 [abs]
 Clark, JS; Agarwal, PK, Rejoinder to Clark et al. (2007): Response to Chesson and Rees,
Ecology Letters, vol. 10 no. 8
(2007),
pp. 661662, ISSN 1461023X [doi]
 Govindarajan, S; Dietze, MC; Agarwal, PK; Clark, JS, A scalable algorithm for dispersing population,
Journal of Intelligent Information Systems, vol. 29 no. 1
(2007),
pp. 3961, ISSN 09259902 [doi] [abs]
 Zheng, Y; Brady, DJ; Agarwal, PK, Localization using boundary sensors: An analysis based on graph theory,
ACM Transactions on Sensor Networks, vol. 3 no. 4
(2007), ISSN 15504859 [doi] [abs]
 Agarwal, PK; Arge, L; Danner, A, From point cloud to grid DEM: A scalable approach,
Progress in Spatial Data Handling  12th International Symposium on Spatial Data Handling, SDH 2006
(December, 2006),
pp. 771788 [doi] [abs]
 Agarwal, PK; Xie, J; Yang, J; Yu, H, Scalable continuous query processing by tracking hotspots, edited by Dayal, U; Whang, KY; Lomet, DB; Alonso, G; Lohman, GM; Kersten, ML; Cha, SK; Kim, YK,
VLDB 2006  Proceedings of the 32nd International Conference on Very Large Data Bases
(December, 2006),
pp. 3142, ACM, ISBN 1595933859 [citation.cfm] [abs]
 Rizvi, SAM; Agarwal, P, A new bucketbased algorithm for finding LCS from two given molecular sequences,
Proceedings  Third International Conference onInformation Technology: New Generations, ITNG 2006, vol. 2006
(November, 2006),
pp. 560561, ISBN 0769524974 [doi] [abs]
 Bilu, Y; Agarwal, PK; Kolodny, R, Faster algorithms for optimal multiple sequence alignment based on pairwise comparisons.,
IEEE/ACM Transactions on Computational Biology and Bioinformatics (ACM), vol. 3 no. 4
(October, 2006),
pp. 408422, ISSN 15455963 [17085849], [doi] [abs]
 Agarwal, PK; HarPeled, S; Yu, H, Robust shape fitting via peeling and grating coresets,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(2006),
pp. 182191 [doi] [abs]
 Flikkema, PG; Agarwal, PK; Clark, JS; Ellis, C; Gelfand, A; Munagala, K; Yang, J, Modeldriven dynamic control of embedded wireless sensor networks,
Lecture notes in computer science, vol. 3993 LNCS  III
(2006),
pp. 409416, ISSN 03029743 [doi] [abs]
 Agarwal, PK; Arge, L; Yi, K, I/Oefficient batched unionfind and its applications to terrain analysis,
Proceedings of the Annual Symposium on Computational Geometry, vol. 2006
(2006),
pp. 167176 [abs]
 Phillips, JM; Rudolph, J; Agarwal, PK, Segmenting motifs in proteinprotein interface surfaces,
Lecture notes in computer science, vol. 4175 LNBI
(2006),
pp. 207218, ISSN 03029743 [abs]
 Agarwal, PK; Aronov, B; Koltun, V, Efficient algorithms for bichromatic separability,
ACM Transactions on Algorithms, vol. 2 no. 2
(2006),
pp. 209227, ISSN 15496325 [doi] [abs]
 Agarwal, PK; Overmars, M; Sharir, M, Computing maximally separated sets in the plane,
SIAM Journal on Computing, vol. 36 no. 3
(2006),
pp. 815834, ISSN 00975397 [doi] [abs]
 Abam, MA; Agarwal, PK; Berg, MD; Yu, H, Outoforder event processing in kinetic data structures,
Lecture notes in computer science, vol. 4168 LNCS
(2006),
pp. 624635, ISSN 03029743 [abs]
 Agarwal, PK; Mustafa, NH, Independent set of intersection graphs of convex objects in 2D,
Computational Geometry, vol. 34 no. 2
(2006),
pp. 8395, ISSN 09257721 [doi] [abs]
 Agarwal, PK; Brady, D; Matoušek, J, Segmenting object space by geometric reference structures,
ACM Transactions on Sensor Networks, vol. 2 no. 4
(2006),
pp. 455465, ISSN 15504859 [doi] [abs]
 Agarwal, PK; Wang, Y; Yu, H, A twodimensional kinetic triangulation with nearquadratic topological changes,
Discrete & Computational Geometry, vol. 36 no. 4
(2006),
pp. 573592, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Edelsbrunner, H; Harer, J; Wang, Y, Extreme elevation on a 2manifold,
Discrete & Computational Geometry, vol. 36 no. 4
(2006),
pp. 553572, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Cabello, S; Sellarès, JA; Sharir, M, Computing a CenterTransversal Line., edited by ArunKumar, S; Garg, N,
FSTTCS, vol. 4337
(2006),
pp. 93104, Springer, ISBN 3540499946 [doi]
 Wang, Y; Agarwal, PK; Brown, P; Edelsbrunner, H; Rudolph, J, Coarse and reliable geometric alignment for protein docking.,
Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
(2005),
pp. 6475, ISSN 23356936 [15759614] [abs]
 Agarwal, PK; Wang, Y; Yin, P, Lower bound for sparse Euclidean spanners,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(2005),
pp. 670671 [abs]
 Agarwal, PK; Arge, L; Yi, K, An optimal dynamic interval stabbingmax data structure?,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(2005),
pp. 803812 [abs]
 Agarwal, PK; Sharir, M, Pseudoline arrangements: Duality, algorithms, and applications,
SIAM Journal on Computing, vol. 34 no. 3
(2005),
pp. 526552, ISSN 00975397 [doi] [abs]
 Agarwal, PK; Bereg, S; Daescu, O; Kaplan, H; Ntafos, S; Zhu, B, Guarding a terrain by two watchtowers,
Proceedings of the Annual Symposium on Computational Geometry
(2005),
pp. 346355 [doi] [abs]
 Agarwal, PK; Arge, L; Yi, K, I/Oefficient construction of constrained delaunay triangulations,
Lecture notes in computer science, vol. 3669
(2005),
pp. 355366, ISSN 03029743 [abs]
 Agarwal, PK; Xie, J; Yang, J; Yu, H, Monitoring continuous bandjoin queries over dynamic data,
Lecture notes in computer science, vol. 3827 LNCS
(2005),
pp. 349359, ISSN 03029743 [doi] [abs]
 Agarwal, PK; Bilu, Y; Kolodny, R, Faster algorithms for optimal Multiple Sequence Alignment based on pairwise comparisons,
Lecture notes in computer science, vol. 3692 LNBI
(2005),
pp. 315327, ISSN 03029743 [doi] [abs]
 Agarwal, PK; Berretty, RP; Collins, AD, A nearquadratic algorithm for fence design,
Discrete and Computanional Geometry, vol. 33 no. 3
(2005),
pp. 463481 [doi] [abs]
 Agarwal, PK; HarPeled, S; Mustafa, NH; Wang, Y, Nearlinear time approximation algorithms for curve simplification,
Algorithmica (New York), vol. 42 no. 34
(2005),
pp. 203219 [doi] [abs]
 Agarwal, PK; Aronov, B; Koltun, V; Sharir, M, Lines avoiding unit balls in three dimensions,
Discrete and Computanional Geometry, vol. 34 no. 2
(2005),
pp. 231250 [doi] [abs]
 Agarwal, PK; Procopiuc, CM; Varadarajan, KR, Approximation algorithms for a kline center,
Algorithmica (New York), vol. 42 no. 34
(2005),
pp. 221230 [doi] [abs]
 P.K. Agarwal,, Reporting all intersecting pairs of polytopes in two and three dimensions
(2004) [abs]
 Agarwal, PK; Aronov, B; Koltun, V, Efficient Algorithms for Bichromatic Separability,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms, vol. 15
(2004),
pp. 675683 [abs]
 Agarwal, PK; Overmars, M; Sharir, M, Computing Maximally Separated Sets in the Plane and Independent Sets in the Intersection Graph of Unit Disks,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms, vol. 15
(2004),
pp. 509518 [abs]
 Yu, H; Agarwal, PK; Poreddy, R; Varadarajan, KR, Practical methods for shape fitting and kinetic data structures using core sets,
Proceedings of the Annual Symposium on Computational Geometry
(2004),
pp. 263272 [abs]
 Agarwal, PK; Edelsbrunner, H; Harer, J; Wang, Y, Extreme elevation on a 2manifold,
Proceedings of the Annual Symposium on Computational Geometry
(2004),
pp. 357365 [abs]
 Govindarajan, S; Dietze, M; Agarwal, PK; Clark, JS, A scalable simulator for forest dynamics,
Proceedings of the Annual Symposium on Computational Geometry
(2004),
pp. 106115 [abs]
 Agarwal, PK; Aronov, B; Koltun, V; Sharir, M, On lines avoiding unit balls in three dimensions,
Proceedings of the Annual Symposium on Computational Geometry
(2004),
pp. 3645 [abs]
 Agarwal, PK; Varadarajan, KR, A nearlinear constantfactor approximation for euclidean bipartite matching?,
Proceedings of the Annual Symposium on Computational Geometry
(2004),
pp. 247252 [abs]
 Agarwal, PK; Sharir, M; Welzl, E, Algorithms for center and tverberg points,
Proceedings of the Annual Symposium on Computational Geometry
(2004),
pp. 6167 [abs]
 Choi, V; Agarwal, PK; Edelsbrunner, H; Rudolph, J, Local search heuristic for rigid protein docking,
Lecture notes in computer science, vol. 3240
(2004),
pp. 218229, ISSN 03029743 [abs]
 Agarwal, PK; Nevo, E; Pach, J; Pinchasi, R; Sharir, M; Smorodinsky, S, Lenses in arrangements of pseudocircles and their applications,
Journal of the ACM, vol. 51 no. 2
(2004),
pp. 139186, ISSN 00045411 [doi] [abs]
 Agarwal, PK; Edelsbrunner, H; Wang, Y, Computing the writhing number of a polygonal knot,
Discrete and Computanional Geometry, vol. 32 no. 1
(2004),
pp. 3753 [doi] [abs]
 Agarwal, P; Guibas, L; Nguyen, A; Russel, D; Zhang, L, Collision detection for deforming necklaces,
Computational Geometry, vol. 28 no. 23 SPEC. ISS.
(2004),
pp. 137163, ISSN 09257721 [doi] [abs]
 Agarwal, PK; HarPeled, S; Varadarajan, KR, Approximating extent measures of points,
Journal of the ACM, vol. 51 no. 4
(2004),
pp. 606635, ISSN 00045411 [doi] [abs]
 Agarwal, PK; Mustafa, NH, Kmeans projective clustering,
Proceedings of the ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, vol. 23
(2004),
pp. 155165 [abs]
 Agarwal, PK; Wang, Y; Yu, H, A 2D kinetic triangulation with nearquadratic topological changes,
Proceedings of the Annual Symposium on Computational Geometry
(2004),
pp. 180189 [abs]
 Agarwal, PK; Mustafa, NH, Independent set of intersection graphs of convex objects in 2D,
Lecture notes in computer science, vol. 3111
(2004),
pp. 127137, ISSN 03029743 [abs]
 Agarwal, PK; Berretty, RP; Collins, AD, A nearquadratic algorithm for fence design,
Springer Tracts in Advanced Robotics, vol. 7 STAR
(2004),
pp. 347362, ISSN 16107438 [doi] [abs]
 Agarwal, PK; Arge, L; Erickson, J; Yu, H, Efficient tradeoff schemes in data structures for querying moving objects,
Lecture notes in computer science, vol. 3221
(2004),
pp. 415, ISSN 03029743 [abs]
 Agarwal, PK; Arge, L; Yang, J; Yi, K, I/Oefficient structures for orthogonal rangemax and stabbingmax queries,
Lecture notes in computer science, vol. 2832
(2003),
pp. 718, ISSN 03029743 [abs]
 Collins, AD; Agarwal, PK; Harer, JL, HPRM: A hierarchical PRM,
Proceedings  IEEE International Conference on Robotics and Automation, vol. 3
(2003),
pp. 44334438 [abs]
 Agarwal, PK; Procopiuc, CM; Varadarajan, KR, A (1+ε)approximation algorithm for 2linecenter,
Computational Geometry, vol. 26 no. 2
(2003),
pp. 119128, ISSN 09257721 [doi] [abs]
 Agarwal, PK; Arge, L, Editorial,
Computational Geometry, vol. 24 no. 2
(2003),
pp. 49, ISSN 09257721 [doi]
 Agarwal, PK; HarPeled, S; Sharir, M; Wang, Y, Hausdorff distance under translation for points and balls,
Proceedings of the Annual Symposium on Computational Geometry
(2003),
pp. 282291 [abs]
 Agarwal, PK; Arge, L; Danner, A; HollandMinkley, B, Cacheoblivious data structures for orthogonal range searching,
Proceedings of the Annual Symposium on Computational Geometry
(2003),
pp. 237245 [abs]
 Agarwal, PK; Krishnan, S; Mustafa, NH; Venkatasubramanian, S, Streaming geometric optimization using graphics hardware,
Lecture notes in computer science, vol. 2832
(2003),
pp. 544555, ISSN 03029743 [abs]
 Govindarajan, S; Agarwal, PK; Arge, L, CRBtree: An efficient indexing scheme for rangeaggregate queries,
Lecture notes in computer science, vol. 2572
(2003),
pp. 143157, ISSN 03029743 [abs]
 Agarwal, P; Nevo, E; Pach, J; Pinchasi, R; Pinchasi, R; Smorodinsky, S, Lenses in arrangements of pseudocircles and their applications,
Proceedings of the Annual Symposium on Computational Geometry
(January, 2002),
pp. 123132 [abs]
 P.K. Agarwal, C. M. Procopiuc, and S. HarPeled, STARtree: An efficent selfadjusting index for moving points,
in Fourth Workshop on Algorithms Engineering and Experiments
(2002)
 P.K. Agarwal, C. M. Procopiuc, M. Jones, and T.M. Murali, Classifcation using projective clustering,
ACM SIGMOD International Conference on Management of Data
(2002)
 Agarwal, PK; Hagerup, T; Ray, R; Sharir, M; Smid, MHM; Welzl, E, Translating a Planar Object to Maximize Point Containment.,
in T. Hagerup, R. Ray, M. Sharir, and M. Smid, edited by Möhring, RH; Raman, R,
ESA, vol. 2461
(2002),
pp. 4253, Springer, ISBN 3540441808 (submitted for publication.) [html], [doi]
 Procopiuc, CM; Jones, M; Agarwal, PK; Murali, TM, A Monte Carlo algorithm for fast projective clustering,
Proceedings / ACMSIGMOD International Conference on Management of Data. ACMSigmod International Conference on Management of Data
(2002),
pp. 418427, ISSN 07308078 [abs]
 Agarwal, PK; Bhattacharya, BK; Sen, S, Improved algorithms for uniform partitions of points,
Algorithmica (New York), vol. 32 no. 4
(2002),
pp. 521539 [abs]
 Agarwal, PK; Berg, MD; HarPeled, S; Overmars, MH; Sharir, M; Vahrenhold, J, Reporting intersecting pairs of convex polytopes in two and three dimensions,
Computational Geometry, vol. 23 no. 2
(2002),
pp. 195207, ISSN 09257721 [abs]
 Agarwal, PK; Sharir, M, The number of congruent simplices in a point set,
Discrete & Computational Geometry, vol. 28 no. 2
(2002),
pp. 123150, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Flato, E; Halperin, D, Polygon decomposition for efficient construction of Minkowski sums,
Computational Geometry, vol. 21 no. 12
(2002),
pp. 3961, ISSN 09257721 [abs]
 Agarwal, PK; Basch, J; Guibas, LJ; Hershberger, J; Zhang, L, Deformable freespace tilings for kinetic collision detection,
International Journal of Robotics Research, vol. 21 no. 3
(2002),
pp. 179197 [doi] [abs]
 Agarwal, PK; HarPeled, S; Mustafa, NH; Wang, Y, NearLinear Time Approximation Algorithms for Curve Simplification., edited by Möhring, RH; Raman, R,
ESA, vol. 2461
(2002),
pp. 2941, Springer, ISBN 3540441808 [html], [doi]
 Procopiuc, CM; Agarwal, PK; HarPeled, S, STARTree: An Efficient SelfAdjusting Index for Moving Objects., edited by Mount, DM; Stein, C,
ALENEX, vol. 2409
(2002),
pp. 178193, Springer, ISBN 3540439773 [html], [doi]
 Agarwal, PK; Govindarajan, S; Muthukrishnan, S, Range Searching in Categorical Data: Colored Range Searching on Grid., edited by Möhring, RH; Raman, R,
ESA, vol. 2461
(2002),
pp. 1728, Springer, ISBN 3540441808 [html], [doi]
 Agarwal, PK; Gao, J; Guibas, LJ, Kinetic Medians and kdTrees., edited by Möhring, RH; Raman, R,
ESA, vol. 2461
(2002),
pp. 516, Springer, ISBN 3540441808 [html], [doi]
 Agarwal, PK; Procopiuc, CM; Varadarajan, KR, Approximation Algorithms for kLine Center., edited by Möhring, RH; Raman, R,
ESA, vol. 2461
(2002),
pp. 5463, Springer, ISBN 3540441808 [html], [doi]
 Agarwal, PK; Sharir, M, Pseudoline arrangements: duality, algorithms, and applications.,
in Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, edited by Eppstein, D,
SODA
(2002),
pp. 800809, ACM/SIAM, ISBN 089871513X [citation.cfm]
 Agarwal, PK; Edelsbrunner, H; Wang, Y, Computing the writhing number of a polygonal knot.,
in Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, edited by Eppstein, D,
SODA
(2002),
pp. 791799, ACM/SIAM, ISBN 089871513X [citation.cfm]
 L. Guibas, J. Hershberger, E. Veach, and P.K. Agarwal, Maintaining structures for moving points,
Discrete and Computational Geometry, vol. 26
(2001),
pp. 253374
 K. R. Varadarajan and P.K. Agarwal, Approximating shortest paths on polyhedral terrains,
SIAM Journal on Computing, vol. 30
(2001),
pp. 13211340
 H. Wang and P.K. Agarwal, Approximation algorithms for shortest paths with bounded curvature,
SIAM Journal on Computing, vol. 30
(2001),
pp. 17391772
 J. Basch, L. J. Guibas, J. Hershberger, L. Zhang and P.K. Agarwal, Deformable free space tiling for kinetic collision detection,
in Algorithmic Foundations of Robotics, edited by B. Donald, K. Lynch, and D. Russ
(2001),
pp. 8396, A.K. Peters, Natick, MA,
 S. Sen and P.K. Agarwal, Randomized algorithms for geometric optimization,
in Handbook of Randomized Computation, edited by J. Pardalos, S. Rajasekaran, J. Reif, and J. Rolim
(2001),
pp. 151201, Kluwar Academic Press, The Netherlands
 P.K. Agarwal, L. Arge and J. Vahrenhold, Time responsive indexing schemes for moving points,
in Seventh Workshop on Algorithms and Data Structures
(2001)
 P.K. Agarwal, D. Halperin, and R. Pollack, Guest editors' foreword,
Discrete and Computational Geometry, vol. 25
(2001),
pp. 505506
 P.K. Agarwal, Guest editors' foreword,
Discrete and Computational Geometry, vol. 26
(2001),
pp. 185186
 P.K. Agarwal, On the numbers of congruent simplices in a point set,
in Seventeenth Annual Symposium on Computational Geometry
(2001)
 P.K. Agarwal, M. de Berg, S. HarPeled, M. Overmars, M. Sharir, and J. Vahrenhold, Reporting all intersecting pairs of polytopes in two and three dimensions,
in Seventh Workshop on Algorithms and Data Structures
(2001)
 P.K. Agarwal, S. HarPeled, and Y.Wang, Occlusion culling for fast walkthrough in urban areas,
in Eurographics
(2001)
 P.K. Agarwal, M. Dietze, S. Govindarajan, and J. Clark, The extinction debt revisited: population dynamics in a continuous space model,
in Ecological Society of America Annual Meeting
(2001)
 Agarwal, PK; Sharir, M, On the number of congruent simplices in a point set,
Proceedings of the Annual Symposium on Computational Geometry
(2001),
pp. 19 [abs]
 Agarwal, PK; Aronov, B; Sharir, M, Exact and approximation algorithms for minimumwidth cylindrical shells,
Discrete and Computanional Geometry, vol. 26 no. 3
(2001),
pp. 307320 [abs]
 Agarwal, PK; Guibas, LJ; Hershberger, J; Veach, E, Maintaining the extent of a moving point set,
Discrete and Computanional Geometry, vol. 26 no. 3
(2001),
pp. 353374 [abs]
 Agarwal, PK; Arge, L; Procopiuc, O; Vitter, JS, A Framework for Index Bulk Loading and Dynamization.,
in TwentyEighth International Colloquium on Automata, Languages, and Programming, edited by Orejas, F; Spirakis, PG; Leeuwen, JV,
ICALP, vol. 2076
(2001),
pp. 115127, Springer, ISBN 3540422870 [html], [doi]
 Agarwal, PK; HalPeled, S, Maintaining approximate extent measures of moving points,
in Twelfth Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(2001),
pp. 148157 [abs]
 Agarwal, PK; Berg, MD; Gudmundsson, J; Hammar, M; Haverkort, HJ, Boxtrees and Rtrees with nearoptimal query time,
in Seventeenth Annual Symposium on Computational Geometry,
Proceedings of the Annual Symposium on Computational Geometry
(2001),
pp. 124133 [abs]
 Agarwal, PK; Collins, AD; Harer, JL, Minimal trap design,
in IEEE Conference on Robotics and Automation,
Proceedings  IEEE International Conference on Robotics and Automation, vol. 3
(2001),
pp. 22432248 [abs]
 Agarwal, PK; Aronov, B; Sharir, M, On the complexity of many faces in arrangements of circles,
in Forty Second Annual Symposium on Foundations of Computer Science,
Annual Symposium on Foundations of Computer Science  Proceedings
(2001),
pp. 7483 [abs]
 Agarwal, PK; Arge, L; Vahrenhold, J, Time Responsive External Data Structures for Moving Points., edited by Dehne, FKHA; Sack, JR; Tamassia, R,
WADS, vol. 2125
(2001),
pp. 5061, Springer, ISBN 3540424237 [html], [doi]
 Agarwal, PK; Berg, MD; HarPeled, S; Overmars, MH; Sharir, M; Vahrenhold, J, Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions., edited by Dehne, FKHA; Sack, JR; Tamassia, R,
WADS, vol. 2125
(2001),
pp. 122134, Springer, ISBN 3540424237 [html], [doi]
 Agarwal, PK; Guibas, LJ; HarPeled, S; Rabinovitch, A; Sharir, M, Computing the penetration depth of two convex polytopes in 3d,
in Seventh Scandinavian Workshop on Algorithm Theory,
Lecture notes in computer science, vol. 1851
(2000),
pp. 328338, ISSN 03029743, ISBN 3540676902 [doi] [abs]
 L. J. Guibas, S. HarPeled, A. Rabinovitch, M. Sharir, and P.K. Agarwal, Computing the penetration depth of two convex polytopes in 3D,
Nordic J. Computing, vol. 7
(2000),
pp. 227240
 B. Aronov, S. HarPeled, M. Sharir, and P.K. Agarwal, Exact and approximation algorithms for the minimum width annuli and shells,
Discrete and Computational Geometry, vol. 24
(2000),
pp. 687705
 M. Sharir and P.K. Agarwal, DavenportSchinzel sequences and their geometric applications,
in Handbook of Computational Geometry, edited by J.R. Sack and J. Urrutia
(2000),
pp. 147, NorthHolland, New York
 M. Sharir and P.K. Agarwal, Arrangements and their applications,
in Handbook of Computational Geometry, edited by J.R. Sack and J. Urrutia
(2000),
pp. 49119, NorthHolland, New York
 L. Knipping, M. van Kreveld, T. Strijk, A. Wolff and P.K. Agarwal, A simple and eÆcient algorithm for high quality line labeling,
in Innovations in GIS VII: GeoComputation, edited by P. M. Atkinson and D. Martin
(2000),
pp. 147159, Taylor and Francis, London
 K. R. Varadarajan and P.K. Agarwal, Efficient algorithms for polygon simplification,
Discrete and Computational Geometry, vol. 23
(2000),
pp. 273291
 P.K. Agarwal, J. Basch, L. J. Guibas, J. Hershberger, and L. Zhang, Deformable free space tiling for kinetic collision detection,
in Fourth Workshop on Algorithmic Foundations of Robotics
(2000)
 Agarwal, PK; Basch, J; Berg, MD; Guibas, LJ; Hershberger, J, Lower Bounds for Kinetic Planar Subdivisions.,
Discrete & Computational Geometry, vol. 24
(2000),
pp. 721733 [doi]
 Varadarajan, KR; Agarwal, PK, Approximating shortest paths on a nonconvex polyhedron,
SIAM Journal on Computing, vol. 30 no. 4
(2000),
pp. 13211340, ISSN 00975397 [abs]
 Agarwal, PK; Wanq, H, Approximation algorithms for curvatureconstrained shortest paths,
SIAM Journal on Computing, vol. 30 no. 6
(2000),
pp. 17391772, ISSN 00975397 [abs]
 Agarwal, PK; Varadarajan, KR, Efficient algorithms for approximating polygonal chains,
Discrete and Computanional Geometry, vol. 23 no. 2
(2000),
pp. 273291 [abs]
 Agarwal, PK; Guibas, LJ; Murali, TM; Vitter, JS, Cylindrical static and kinetic binary space partitions,
Computational Geometry: Theory and Applications, vol. 16 no. 2
(2000),
pp. 103127 [abs]
 Agarwal, PK; Grove, EF; Murali, TM; Vitter, JS, Binary space partitions for fat rectangles,
SIAM Journal on Computing, vol. 29 no. 5
(2000),
pp. 14221448 [doi] [abs]
 Agarwal, PK; Sharir, M, Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions,
Discrete and Computanional Geometry, vol. 24 no. 4
(2000),
pp. 645685 [abs]
 Agarwal, PK; Arge, L; Erickson, J; Franciosa, PG; Vitter, JS, Efficient searching with linear constraints,
Journal of Computer and System Sciences, vol. 61 no. 2
(2000),
pp. 194216 [doi] [abs]
 Agarwal, PK; Aronov, B; HarPeled, S; Sharir, M, Approximation Algorithms for MinimumWidth Annuli and Shells,
Discrete and Computanional Geometry, vol. 24 no. 4
(2000),
pp. 687705 [abs]
 Agarwal, PK; Flato, E; Halperin, D, Polygon Decomposition for Efficient Construction of Minkowski Sums.,
in Eighth European Symposium on Algorithms, edited by Paterson, M,
ESA, vol. 1879
(2000),
pp. 2031, Springer, ISBN 354041004X [html], [doi]
 Agarwal, PK; Arge, L; Erickson, J, Indexing moving points,
in Nineteenth Annual Symposium on Principles of Database Systems,
Proceedings of the ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems
(2000),
pp. 175186 [abs]
 Agarwal, PK; HarPeled, S; Karia, M, Computing approximate shortest paths on convex polytopes,
in Sixteenth Annual Symposium on Computational Geometry,
Proceedings of the Annual Symposium on Computational Geometry
(2000),
pp. 270279 [abs]
 Agarwal, PK; Procopiuc, CM, Approximation algorithms for projective clustering,
in Eleventh Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(2000),
pp. 538547 [abs]
 Agarwal, PK; Desikan, PK, Approximation algorithms for layered manufacturing,
in Eleventh Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(2000),
pp. 528537 [abs]
 Agarwal, PK; Aronov, B; Sharir, M, Exact and approximation algorithms for minimumwidth cylindrical shells,
in Eleventh Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(2000),
pp. 510517 [abs]
 P.K. Agarwal, L. Arge, G. Brodal, and J. S. Vitter, I/Oefficient dynamic point location in monotone subdivisions,
in Tenth Annual ACMSIAM Symposium on Discrete Algorithms
(1999)
 P.K. Agarwal and S. A. Cook, Guest editors' foreword,
Journal of Computer and Systems Sciences, vol. 58
(1999),
pp. 259
 P.K. Agarwal, Guest editors' foreword,
International Journal of Computational Geometry and Applications, vol. 9
(1999),
pp. 325
 P.K. Agarwal, L. Knipping, M. van Kreveld, T. Strijk, and A.Wolff, A simple and efficient algorithm for high quality line labeling,
in GIS Research UK: 7th National Conference
(1999) (Also appears in the Fifteenth European
Workshop on Computational Geometry, 1999.)
 P.K. Agarwal, B. Aronov, S. HarPeled, and M. Sharir, Exact and approximation algorithms for the minimum width annuli and shells,
in Fifteenth Annual Symposium on Computational Geometry
(1999)
 Agarwal, PK; Aronov, B; HarPeled, S; Sharir, M, Approximation and exact algorithms for minimumwidth annuli and shells,
Proceedings of the Annual Symposium on Computational Geometry
(1999),
pp. 380389 [abs]
 Agarwal, PK; Arge, L; Brodal, GS; Vitter, JS, I/Oefficient dynamic point location in monotone planar subdivisions,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(1999),
pp. 1120 [abs]
 Agarwal, PK; O'Rourke, J, Open Problems Presented at SCG'98,
Journal of Algorithms, vol. 30 no. 2
(1999),
pp. 449453 [abs]
 Agarwal, PK; Aronov, B; Sharir, M, Line transversals of balls and smallest enclosing cylinders in three dimensions,
Discrete & Computational Geometry, vol. 21 no. 3
(1999),
pp. 373388, ISSN 01795376 [abs]
 Agarwal, PK; Efrat, A; Sharir, M, Vertical decomposition of shallow levels in 3dimensional arrangements and its applications,
SIAM Journal on Computing, vol. 29 no. 3
(1999),
pp. 912953 [abs]
 Agarwal, PK; Aronov, B; Sharir, M, Motion planning for a convex polygon in a polygonal environment,
Discrete & Computational Geometry, vol. 22 no. 2
(1999),
pp. 201221, ISSN 01795376 [abs]
 Agarwal, PK; Sharir, M, Pipes, cigars, and kreplach: The union of Minkowski sums in three dimensions,
in Fifteenth Annual Symposium on Computational Geometry,
Proceedings of the Annual Symposium on Computational Geometry
(1999),
pp. 143153 [abs]
 Agarwal, PK; Basch, J; Berg, MD; Guibas, LJ; Hershberger, J, Lower bounds for kinetic planar subdivisions,
in Fifteenth Annual Symposium on Computational Geometry,
Proceedings of the Annual Symposium on Computational Geometry
(1999),
pp. 247254 [abs]
 Varadarajan, KR; Agarwal, PK, Approximation algorithms for bipartite and nonbipartite matching in the plane,
in Tenth Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(1999),
pp. 805814 [abs]
 Agarwal, PK; Sharir, M, Motion planning of a ball amid segments in three dimensions,
in Tenth Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(1999),
pp. 2130 [abs]
 Agarwal, PK; Bhattacharya, BK; Sen, S, OutputSensitive Algorithms for Uniform Partitions of Points.,
in Tenth Annual International Symposium on Algorithms and Computation, edited by Aggarwal, A; Rangan, CP,
ISAAC, vol. 1741
(1999),
pp. 403414, Springer, ISBN 3540669167 [html], [doi]
 J. Erickson and P.K. Agarwal, Geometric range searching and its relatives,
in Advances in Discrete and Computational Geometry, edited by B. Chazelle, J. Goodman, and R. Pollack
(1998),
pp. 156, American Mathematical Society, Providence
 P.K. Agarwal, T. M. Murali, and J. S. Vitter, A new algorithm for constructing binary space partitions for orthogonal rectangles,
in Sixth European Symposium on Algorithms
(1998)
 Agarwal, PK; Sharir, M; Welzl, E, The discrete 2center problem,
Discrete & Computational Geometry, vol. 20 no. 3
(1998),
pp. 287305, ISSN 01795376 [abs]
 Agarwal, PK; Aronov, B; Chan, TM; Sharir, M, On levels in arrangements of lines, segments, planes, and triangles,
Discrete & Computational Geometry, vol. 19 no. 3
(1998),
pp. 315331, ISSN 01795376 [abs]
 Agarwal, PK; O'Rourke, J, Computational geometry column 34,
International Journal of Computational Geometry and Applications, vol. 8 no. 56
(1998),
pp. 637642 (Also appeared in SIGACT News, 29 (1998), 27
33.) [abs]
 Agarwal, PK; Kreveld, MV; Suri, S, Label placement by maximum independent set in rectangles,
Computational Geometry: Theory and Applications, vol. 11 no. 34
(1998),
pp. 209218 [abs]
 Agarwal, PK; Matoušek, J; Schwarzkopf, O, Computing many faces in arrangements of lines and segments,
SIAM Journal on Computing, vol. 27 no. 2
(1998),
pp. 491505 [abs]
 Agarwal, PK, Surface approximation and geometric partitions,
SIAM Journal on Computing, vol. 27 no. 4
(1998),
pp. 10161035 [abs]
 Agarwal, PK; Berg, MD; Matoušek, J; Schwarzkopf, O, Constructing Levels in Arrangements and Higher Order Voronoi Diagrams,
SIAM Journal on Computing, vol. 27 no. 3
(1998),
pp. 654667 [abs]
 Agarwal, PK; Sharir, M, Efficient algorithms for geometric optimization,
ACM Computing Surveys, vol. 30 no. 4
(1998),
pp. 448458, ISSN 03600300 [abs]
 Agarwal, PK; Amenta, N; Sharir, M, Largest placement of one convex polygon inside another,
Discrete & Computational Geometry, vol. 19 no. 1
(1998),
pp. 95104, ISSN 01795376 [abs]
 Murali, TM; Agarwal, PK; Vitter, JS, Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice., edited by Bilardi, G; Italiano, GF; Pietracaprina, A; Pucci, G,
ESA, vol. 1461
(1998),
pp. 211222, Springer, ISBN 3540648488 [html], [doi]
 Agarwal, PK; Biedl, T; Lazard, S; Robbins, S; Suri, S; Whitesides, S, Curvatureconstrained shortest paths in a convex polygon,
in Fourteenth Annual Symposium on Computational Geometry,
Proceedings of the Annual Symposium on Computational Geometry
(1998),
pp. 392401 [abs]
 Agarwal, PK; Arge, L; Erickson, J; Franciosa, PG; Vitter, JS, Efficient searching with linear constraints,
in Seventeenth Annual Symposium on Principles of Database Systems,
Proceedings of the ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems
(1998),
pp. 169178 [abs]
 Agarwal, PK; Procopiuc, CM, Exact and approximation algorithms for clustering,
in Ninth Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(1998),
pp. 658667 [abs]
 Agarwal, PK; Arge, L; Murali, TM; Varadarajan, KR; Vitter, JS, I/Oefficient algorithms for contourline extraction and planar graph blocking,
in Ninth Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(1998),
pp. 117126 [abs]
 Agarwal, PK; Erickson, J; Guibas, LJ, Kinetic binary space partitions for intersecting segments and disjoint triangles,
in Ninth Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(1998),
pp. 107116 [abs]
 Agarwal, PK; Eppstein, D; Guibas, LJ; Henzinger, MR, Parametric and kinetic minimum spanning trees,
in Thirty Ninth Annual Symposium on Foundations of Computer Science,
Annual Symposium on Foundations of Computer Science  Proceedings
(1998),
pp. 596605 [abs]
 N. Amenta, B. Aronov, M. Sharir, and P.K. Agarwal, Largest placements and motion planning of a convex polygon,
in Algorithms for Robotic Motion and Manipulation, pp. 143154, edited by J.P. Laumond and M. Overmars
(1997), A. K. Peters, Wellesley
 P.K. Agarwal, Range searching,
in CRC Handbook of Discrete and Computational Geometry, edited by J. Goodman and J. O'Rourke
(1997),
pp. 575598, CRC Press, NewYork
 P.K. Agarwal and P. K. Desikan, Fast algorithms for surface simplication and other related problems,
in Eighth Annual ACMSIAM Symposium on Discrete Algorithms
(1997)
 P.K. Agarwal, L. Guibas, T. M. Murali, and J. S. Vitter, Cylindrical kinetic and static binary space partitions,
in Thirteenth Annual Symposium on Computational Geometry
(1997)
 P.K. Agarwal, (short communication) with T. M. Murali and J. S. Vitter, Practical techniques for constructing binary space partitions of rectangles,
in Thirteenth Annual Symposium on Computational Geometry
(1997)
 P.K. Agarwal, M. Sharir, and E. Welzl, The discrete 2center problem,
in Thirteenth Annual Symposium on Computational Geometry
(1997)
 P.K. Agarwal, L. Guibas, J. Hershberger, and E. Veach, Maintaining structures for moving points,
in Fifth Workshop on Algorithms and Data Structures
(1997)
 P.K. Agarwal, M. van Kreveld, and S. Suri, Label placement by maximum independent set in rectangles,
in Ninth Canadian Conference on Computational Geometry
(1997)
 P.K. Agarwal and K. R. Varadarajan, Approximating shortest paths on polyhedral terrains,
in Thirty Eighth Annual Symposium on Foundations of Computer Science
(1997)
 Agarwal, PK; Sharir, M; Welzl, E, Discrete 2center problem,
Proceedings of the Annual Symposium on Computational Geometry
(1997),
pp. 147155 [abs]
 Agarwal, PK; Murali, TM; Vitter, JS, Practical techniques for constructing Binary Space Partitions for orthogonal rectangles,
Proceedings of the Annual Symposium on Computational Geometry
(1997),
pp. 382384 [abs]
 Agarwal, PK; Guibas, LJ; Murali, TM; Vitter, JS, Cylindrical static and kinetic binary space partitions,
Proceedings of the Annual Symposium on Computational Geometry
(1997),
pp. 3948 [abs]
 Agarwal, PK; Desikan, PK, Efficient algorithm for terrain simplification,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(1997),
pp. 139147 [abs]
 Varadarajan, KR; Agarwal, PK, Approximating shortest paths on a nonconvex polyhedron,
Annual Symposium on Foundations of Computer Science  Proceedings
(1997),
pp. 182191 [abs]
 Agarwal, PK; Aronov, B; Pach, J; Pollack, R; Sharir, M, Quasiplanar graphs have a linear number of edges,
Combinatorica, vol. 17 no. 1
(1997),
pp. 19 [abs]
 Agarwal, PK; HarPeled, S; Sharir, M; Varadarajan, KR, Approximating shortest paths on a convex polytope in three dimensions,
Journal of the ACM, vol. 44 no. 4
(1997),
pp. 567584 [abs]
 Varadarajan, KR; Agarwal, PK, Linear approximation of simple objects,
Information Processing Letters, vol. 62 no. 2
(1997),
pp. 8994 [abs]
 Agarwal, PK; Aronov, B; Sharir, M, Computing envelopes in four dimensions with applications,
SIAM Journal on Computing, vol. 26 no. 6
(1997),
pp. 17141732 [abs]
 Agarwal, PK; Aronov, B; O'Rourke, J; Schevon, CA, Star unfolding of a polytope with applications,
SIAM Journal on Computing, vol. 26 no. 6
(1997),
pp. 16891713 [abs]
 Agarwal, PK; Latombe, JC; Motwani, R; Raghavan, P, Nonholonomic path planning for pushing a disk among obstacles,
in IEEE Conference on Robotics and Automation,
Proceedings  IEEE International Conference on Robotics and Automation, vol. 4
(1997),
pp. 31243129 (Also appears in the abstracts of the First
CGC Workshop on Computational Geometry.) [abs]
 Agarwal, PK; Aronov, B; Sharir, M, On levels in arrangements of lines, segments, planes, and triangles,
in Thirteenth Annual Symposium on Computational Geometry,
Proceedings of the Annual Symposium on Computational Geometry
(1997),
pp. 3038 [abs]
 Agarwal, PK; Aronov, B; Sharir, M, Line transversals of balls and smallest enclosing cylinders in three dimensions,
in Eighth Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(1997),
pp. 483492 [abs]
 Agarwal, PK; Guibas, LJ; Hershberger, J; Veach, E, Maintaining the Extent of a Moving Point Set., edited by Dehne, FKHA; RauChaplin, A; Sack, JR; Tamassia, R,
WADS, vol. 1272
(1997),
pp. 3144, Springer, ISBN 3540633073 [html], [doi]
 P.K. Agarwal and H. Wang, Approximation algorithms for shortest paths with bounded curvature,
in Seventh Annual ACMSIAM Symposium on Discrete Algorithms
(1996)
 P.K. Agarwal and S. Suri, Simple and practical geometric algorithms,
ACM Computing Surveys, vol. 28
(1996)
 P.K. Agarwal and S. Suri, Simple and practical geometric algorithms,
ACM Computing Surveys, vol. 28
(1996)
 P.K. Agarwal, M. de Berg, D. Halperin, and M. Sharir, Computing depth orders in multiple directions,
in Seventh Annual ACMSIAM Symposium on Discrete Algorithms
(1996)
 P.K. Agarwal and H. Wang, Approximation algorithms for shortest paths with bounded curvature,
in Seventh Annual ACMSIAM Symposium on Discrete Algorithms
(1996)
 P.K. Agarwal, N. Amenta, B. Aronov, and M. Sharir, Largest placements and motion planning of a convex polygon,
in Second International Workshop on Algorithmic Foundations of Robotics
(1996)
 Frey, HC; Agarwal, P, Probabilistic analysis and optimization of new power generation technologies: a case study for the externallyfired combined cycle,
Proceedings of the American Power Conference, vol. 1
(1996),
pp. 5257 [abs]
 Agarwal, PK; Kreveld, MV, Connected Component and Simple Polygon Intersection Searching,
Algorithmica (New York), vol. 15 no. 6
(1996),
pp. 626660 [abs]
 Agarwal, PK; Schwarzkopf, O; Sharir, M, The overlay of lower envelopes and its applications,
Discrete & Computational Geometry, vol. 15 no. 1
(1996),
pp. 113, ISSN 01795376 [abs]
 Agarwal, PK; Sharir, M, Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions,
SIAM Journal on Computing, vol. 25 no. 1
(1996),
pp. 100116 [abs]
 Frey, HC; Agarwal, P, Probabilistic modeling and optimization of clean coal technologies: case studies of the externallyfired combined cycle,
Proceedings of the Air & Waste Management Association's Annual Meeting & Exhibition
(1996),
pp. 16pp [abs]
 Agarwal, PK; Sen, S, Selection in Monotone Matrices and Computing kth Nearest Neighbors,
Journal of Algorithms, vol. 20 no. 3
(1996),
pp. 581601 [doi] [abs]
 Agarwal, PK; Sharir, M, Ray Shooting Amidst Convex Polygons in 2D,
Journal of Algorithms, vol. 21 no. 3
(1996),
pp. 508519 [doi] [abs]
 Agarwal, PK; Sharir, M, Efficient randomized algorithms for some geometric optimization problems,
Discrete & Computational Geometry, vol. 16 no. 4
(1996),
pp. 317337, ISSN 01795376 [abs]
 Tamassia, R; Agarwal, PK; Amato, N; Chen, DZ; Dobkin, D; Drysdale, S; Fortune, S; Goodrich, MT; Hershberger, J; O'Rourke, J; Preparata, FP; Sack, JR; Suri, S; Tollis, I; Vitter, JS; Whitesides, S, Strategic directions in computational geometry,
ACM Computing Surveys, vol. 28 no. 4
(1996),
pp. 591606
 Agarwal, PK; Grove, EF; Murali, TM; Vitter, JS, Binary space partitions for fat rectangles,
in Thirty Seventh Annual Symposium on Foundations of Computer Science,
Annual Symposium on Foundations of Computer Science  Proceedings
(1996),
pp. 482491 [abs]
 Cohen, J; Varshney, A; Manocha, D; Turk, G; Weber, H; Agarwal, P; Brooks, F; Wright, W, Simplification envelopes,
in SIGGRAPH,
Proceedings of the ACM SIGGRAPH Conference on Computer Graphics
(1996),
pp. 119128 [abs]
 Agarwal, PK; Berg, MD; Halperin, D; Sharir, M, Efficient Generation of kDirectional Assembly Sequences., edited by Tardos, É,
SODA
(1996),
pp. 122131, ACM/SIAM, ISBN 0898713668
 Wang, H; Agarwal, PK, Approximation Algorithms for CurvatureConstrained Shortest Paths., edited by Tardos, É,
SODA
(1996),
pp. 409418, ACM/SIAM, ISBN 0898713668
 M. Sharir and P.K. Agarwal, Algorithmic techniques for geometric optimization,
in Computer Science Today: Recent Trends and Developments, Lecture Notes in Computer Science, vol. 1000; pp. 234253, edited by J. van Leeuwen
(1995), SpringerVerlag, Berlin
 J. Matousek and P.K. Agarwal, Dynamic halfspace searching and its applications,
Algorithmica, vol. 14
(1995),
pp. 325345
 P.K. Agarwal, P. Raghavan, and H. Tamaki, Motion planning for a steeringconstrained robot through moderate obstacles,
in Twenty Seventh Annual ACM Symposium on Theory of Computing
(1995)
 P.K. Agarwal, B. Aronov and S. Suri, Line stabbing bounds on triangulations in 3D,
in Eleventh Annual Symposium on Computational Geometry
(1995)
 P.K. Agarwal, O. Schwarzkopf, and M. Sharir, The overlay of envelopes and their applications,
in Eleventh Annual Symposium on Computational Geometry
(1995)
 P.K. Agarwal and K. R. Varadarajan, Linear approximation of convex objects,
in Seventh Canadian Conference on Computational Geometry
(1995)
 Agarwal, P, Cellular segregation and engulfment simulations using the cell programming language,
Journal of Theoretical Biology, vol. 176 no. 1
(1995),
pp. 7989, ISSN 00225193 [doi] [abs]
 Agarwal, PK; Matoušek, J, Dynamic halfspace range reporting and its applications,
Algorithmica, vol. 13 no. 4
(1995),
pp. 325345, ISSN 01784617 [doi] [abs]
 Agarwal, PK; Katz, MJ; Sharir, M, Computing depth orders for fat objects and related problems,
Computational Geometry, vol. 5 no. 4
(1995),
pp. 187206, ISSN 09257721 [abs]
 Agarwal, PK; Schwarzkopf, O; Sharir, M, The Overlay of Lower Envelopes in Three Dimensions and Its Applications., edited by Snoeyink, J,
Symposium on Computational Geometry
(1995),
pp. 182189, ACM, ISBN 0897917243 [doi]
 Agarwal, PK; Efrat, A; Sharir, M, Vertical Decomposition of Shallow Levels in 3Dimensional Arrangements and Its Applications.,
in Eleventh Annual Symposium on Computational Geometry, edited by Snoeyink, J,
Symposium on Computational Geometry
(1995),
pp. 3950, ACM, ISBN 0897917243 [doi]
 Agarwal, PK; Aronov, B; Suri, S, Stabbing Triangulations by Lines in 3D., edited by Snoeyink, J,
Symposium on Computational Geometry
(1995),
pp. 267276, ACM, ISBN 0897917243 [doi]
 Agarwal, PK; Sharir, M, Efficient Randomized Algorithms for Some Geometric Optimization Problems.,
in Eleventh Annual Symposium on Computational Geometry, edited by Snoeyink, J,
Symposium on Computational Geometry
(1995),
pp. 326335, ACM, ISBN 0897917243 [doi]
 Agarwal, PK; Aronov, B; Pach, J; Pollack, R; Sharir, M, QuasiPlanar Graphs Have a Linear Number of Edges.,
in Symposium on Graph Drawing, edited by Brandenburg, FJ,
Graph Drawing, vol. 1027
(1995),
pp. 17, Springer, ISBN 3540607234 [html], [doi]
 M. van Kreveld and P.K. Agarwal, Implicit point location in arrangement segments with application to motion planning,
International Journal of Computational Geometry and Applications, vol. 4
(1994),
pp. 369383
 J. Matousek and P.K. Agarwal, Range searching with semialgebraic sets,
Discrete and Computational Geometry, vol. 11
(1994),
pp. 393418
 P.K. Agarwal and S. Suri, Surface approximation and disjoint geometric covers,
in Fifth Annual ACMSIAM Symposium on Discrete Algorithms
(1994)
 P.K. Agarwal and S. Sen, Selection in monotone matrices and kth nearest neighbors,
in Fourth Scandinavian Workshop on Algorithm Theory
(1994)
 Agarwal, P, Simulation of aggregation in Dictyostelium using the cell programming language,
Computer Applications in the Biosciences, vol. 10 no. 6
(1994),
pp. 647655 [abs]
 Agarwal, P; Sharir, M, Planar geometric location problems,
Algorithmica (New York), vol. 11 no. 2
(1994),
pp. 185195 [abs]
 Agarwal, PK, On stabbling lines for convex polyhedra in 3D,
Computational Geometry, vol. 4 no. 4
(1994),
pp. 177189, ISSN 09257721 [abs]
 Agarwal, PK; Sharir, M; Toledo, S, Applications of Parametric Searching in Geometric Optimization,
Journal of Algorithms, vol. 17 no. 3
(1994),
pp. 292318, ISSN 01966774 [doi] [abs]
 Agarwal, PK; Matousek, J, On range searching with semialgebraic sets,
Discrete & Computational Geometry, vol. 11 no. 1
(1994),
pp. 393418, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Alon, N; Aronov, B; Suri, S, Can visibility graphs Be represented compactly?,
Discrete & Computational Geometry, vol. 12 no. 1
(1994),
pp. 347365, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Sharir, M, On the number of views of polyhedral terrains,
Discrete & Computational Geometry, vol. 12 no. 1
(1994),
pp. 177182, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Suri, S, Surface approximation and geometric partitions,
Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms
(1994),
pp. 2433 [abs]
 Agarwal, PK; Berg, MD; Matousek, J; Schwarzkopf, O, Constructing levels in arrangements and higher order Voronoi diagrams,
in Tenth Annual Symposium on Computational Geometry,
Proceedings of the Annual Symposium on Computational Geometry
(1994),
pp. 6775 [abs]
 Agarwal, PK; Aronov, B; Sharir, M, Computing envelopes in four dimensions with applications,
in Tenth Annual Symposium on Computational Geometry,
Proceedings of the Annual Symposium on Computational Geometry
(1994),
pp. 348358 [abs]
 Agarwal, PK; Matousek, J; Schwarzkopf, O, Computing many faces in arrangements of lines and segments,
in Tenth Annual Symposium on Computational Geometry,
Proceedings of the Annual Symposium on Computational Geometry
(1994),
pp. 7684 [abs]
 Agarwal, PK; Sen, S, Selection in Monotone Matrices and Computing kth Nearest Neighbors., edited by Schmidt, EM; Skyum, S,
SWAT, vol. 824
(1994),
pp. 1324, Springer, ISBN 3540582185 [doi]
 Agarwal, PK; Katz, MJ; Sharir, M, Computing Depth Orders and Related Problems.,
in Fourth Scandinavian Workshop on Algorithm Theory, edited by Schmidt, EM; Skyum, S,
SWAT, vol. 824
(1994),
pp. 112, Springer, ISBN 3540582185 [doi]
 Agarwal, PK; Van Kreveld, M, Connected component and simple polygon intersection searching,
Lecture notes in computer science, vol. 709 LNCS
(January, 1993),
pp. 3747, ISBN 9783540571551 [abs]
 M. Sharir and P.K. Agarwal, Circular visibility of a simple polygon from a fixed point,
International Journal of Computational Geometry and Applications, vol. 3
(1993),
pp. 125
 P.K. Agarwal and M. Sharir, Ray shooting among convex polytopes in 3D,
in Fourth Annual ACMSIAM Symposium on Discrete Algorithms
(1993)
 P.K. Agarwal and M. van Kreveld, Polygon and connected component intersection searching,
in Third Workshop on Algorithms and Data Structures
(1993)
 P.K. Agarwal and M. Sharir, On the number of views of polyhedral terrains,
in Fifth Canadian Conference on Computational Geometry
(1993)
 Agarwal, PK; Sharir, M, Circle Shooting in a Simple Polygon,
Journal of Algorithms, vol. 14 no. 1
(1993),
pp. 6987, ISSN 01966774 [doi] [abs]
 Agarwal, PK; Sharir, M, Ray shooting amidst convex polytopes in three dimensions,
Proceedings of the Fourth Annual ACMSIAM Symposium on Discrete Algorithms
(1993),
pp. 260270 [abs]
 Agarwal, PK; Matousek, J, Ray shooting and parametric search,
SIAM Journal on Computing, vol. 22 no. 4
(1993),
pp. 794806 [abs]
 Agarwal, PK; Aronov, B; Sharir, M; Suri, S, Selecting distances in the plane,
Algorithmica, vol. 9 no. 5
(1993),
pp. 495514, ISSN 01784617 [doi] [abs]
 Agarwal, PK; Pellegrini, M; Sharir, M, Counting circular arc intersections,
SIAM Journal on Computing, vol. 22 no. 4
(1993),
pp. 778793 [abs]
 Agarwal, PK; Efrat, A; Sharir, M; Toledo, S, Computing a Segment Center for a Planar Point Set,
Journal of Algorithms, vol. 15 no. 2
(1993),
pp. 314323, ISSN 01966774 [doi] [abs]
 Agarwal, PK; Vankreveld, M; Overmars, M, Intersection Queries in Curved Objects,
Journal of Algorithms, vol. 15 no. 2
(1993),
pp. 229266, ISSN 01966774 [doi] [abs]
 Agarwal, PK; Sharir, M, Applications of a new spacepartitioning technique,
Discrete & Computational Geometry, vol. 9 no. 1
(1993),
pp. 1138, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Alon, N; Aronov, B; Suri, S, Can visibility graphs be represented compactly?,
in Ninth Annual Symposium on Computational Geometry,
Proceedings of the 9th Annual Symposium on Computational Geometry
(1993),
pp. 338347 [abs]
 Agarwal, PK; van Kreveld, M, Implicit point location of line segments, with an arrangements an application to motion planning,
Lecture notes in computer science, vol. 652 LNCS
(January, 1992),
pp. 8091, ISBN 9783540562870 [abs]
 P.K. Agarwal, Ray shooting and other applications of spanning trees with low stabbing number,
SIAM Journal on Computing, vol. 21
(1992),
pp. 540570
 P.K. Agarwal and J. Matousek, Range searching with semialgebraic sets,
in Seventeenth Symposium on Mathematical Foundations of Computer Science
(1992)
 P.K. Agarwal, D. Eppstein, and J. Matousek, Dynamic halfspace range searching with applications to proximity problems,
in Thirty Third Annual Symposium on Foundations of Computer Science
(1992)
 P.K. Agarwal and M. van Kreveld, Implicit point location in arrangement segments with application to motion planning,
in Twelfth Conference on Foundations of Software Technology and Theoretical Computer Science
(1992)
 Agarwal, PK; Matoušek, J; Suri, S, Farthest neighbors, maximum spanning trees and related problems in higher dimensions,
Computational Geometry, vol. 1 no. 4
(1992),
pp. 189201, ISSN 09257721 [abs]
 Agarwal, PK; Matoušek, J, Relative neighborhood graphs in three dimensions,
Computational Geometry, vol. 2 no. 1
(1992),
pp. 114, ISSN 09257721 [abs]
 Kreveld, MV; Overmars, M; Agarwal, PK, Intersection queries in sets of disks,
BIT Numerical Mathematics, vol. 32 no. 2
(1992),
pp. 268279, ISSN 00063835 [doi] [abs]
 Agarwal, PK; Aronov, B, Counting facets and incidences,
Discrete & Computational Geometry, vol. 7 no. 1
(1992),
pp. 359369, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Shing, MT, Oriented aligned rectangle packing problem,
European Journal of Operational Research, vol. 62 no. 2
(1992),
pp. 210220, ISSN 03772217 [abs]
 Agarwal, PK; Matousek, J, Ray shooting and parametric search,
in Twenty Fourth Annual ACM Symposium on Theory of Computing,
Conference Proceedings of the Annual ACM Symposium on Theory of Computing
(1992),
pp. 517526 [abs]
 Agarwal, PK; Matousek, J, Relative Neighborhood Graphs in Three Dimensions.,
in Third Annual ACMSIAM Symposium on Discrete Algorithms, edited by Frederickson, GN,
SODA
(1992),
pp. 5865, ACM/SIAM, ISBN 089791466X
 Agarwal, PK; Sharir, M; Toledo, S, Applications of Parametric Searching in Geometric Optimization.,
in Third Annual ACMSIAM Symposium on Discrete Algorithms, edited by Frederickson, GN,
SODA
(1992),
pp. 7282, ACM/SIAM, ISBN 089791466X
 Agarwal, PK; Matousek, J, On Range Searching with Semialgebraic Sets., edited by Havel, IM; Koubek, V,
MFCS, vol. 629
(1992),
pp. 113, Springer, ISBN 354055808X [doi]
 H. Edelsbrunner, O. Schwarzkopf, E. Welzl and P.K. Agarwal, Euclidean minimum spanning tree and bichromatic closest pairs,
Discrete and Computational Geometry, vol. 6
(1991),
pp. 407422
 P.K. Agarwal, Geometric partitioning and its applications,
in Discrete and Computational Geometry: Papers from the DIMACS Special Year, edited by J. Goodman, R. Pollack, and W. Steiger
(1991),
pp. 137, American Mathematical Society (Providence, RI.)
 P.K. Agarwal and M. Sharir, Planar geometric location problems and maintaining the width of a planar set,
in Second Annual ACMSIAM Symposium on Discrete Algorithms
(1991)
 P.K. Agarwal and M. Sharir, Counting circular arc intersections,
in Seventh Annual Symposium on Computational Geometry
(1991)
 P.K. Agarwal and M. Sharir, Applications of a new space partitioning technique,
in Second Workshop on Algorithms and Data Structures
(1991)
 P.K. Agarwal, M. van Kreveld, and M. Overmars, Storing and searching curved objects,
in Seventh Annual Symposium on Computational Geometry
(1991)
 P.K. Agarwal, J. Matousek and S. Suri, Farthest neighbors, maximum spanning trees and related problems in higher dimensions,
in Second Workshop on Algorithms and Data Structures
(1991)
 Agarwal, PK; Edelsbrunner, H; Schwarzkopf, O; Welzl, E, Euclidean minimum spanning trees and bichromatic closest pairs,
Discrete & Computational Geometry, vol. 6 no. 1
(1991),
pp. 407422, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Aggarwal, A; Aronov, B; Kosaraju, SR; Schieber, B; Suri, S, Computing external farthest neighbors for a simple polygon,
Discrete Applied Mathematics, vol. 31 no. 2
(1991),
pp. 97111, ISSN 0166218X [abs]
 Agarwal, PK; Sharir, M, Offline dynamic maintenance of the width of a planar point set,
Computational Geometry, vol. 1 no. 2
(1991),
pp. 6578, ISSN 09257721 [abs]
 P.K. Agarwal, Partitioning arrangements of lines: I. A deterministic algorithm,
Discrete and Computational Geometry, vol. 5
(1990),
pp. 449483
 M. T. Shing and P.K. Agarwal, Algorithms for special cases of rectilinear Steiner trees: I. Points on the boundary of a rectangle,
Networks, vol. 20
(1990),
pp. 453485
 P.K. Agarwal, B. Aronov, J. O'Rourke, and C. Schevon, Star unfolding of a polytope with applications,
in Second Scandinavian Workshop on Algorithm Theory
(1990)
 P.K. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, Euclidean minimum spanning tree and bichromatic closest pairs,
in Sixth Annual Symposium on Computational Geometry
(1990)
 Agarwal, PK, Partitioning arrangements of lines I: An efficient deterministic algorithm,
Discrete & Computational Geometry, vol. 5 no. 1
(1990),
pp. 449483, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Edelsbrunner, H; Schwarzkopf, O; Welzl, E, Euclidean minimum spanning trees and bichromatic closest pairs
(1990),
pp. 203210 [abs]
 Agarwal, PK; Sharir, M, Redblue intersection detection algorithms, with applications to motion planning and collision detection,
SIAM Journal on Computing, vol. 19 no. 2
(1990),
pp. 297321 [abs]
 Agarwal, PK, Partitioning arrangements of lines II: Applications,
Discrete & Computational Geometry, vol. 5 no. 1
(1990),
pp. 533573, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Aronov, B; Sharir, M; Suri, S, Selecting distances in the plane,
in Sixth Annual Symposium on Computational Geometry
(1990),
pp. 321331 [abs]
 Agarwal, PK; Aronov, B; O'Rourke, J; Schevon, CA, Star Unfolding of a Polytope with Applications (Extended Abstract)., edited by Gilbert, JR; Karlsson, RG,
SWAT, vol. 447
(1990),
pp. 251263, Springer, ISBN 3540528466 [doi]
 Kreveld, MJV; Overmars, MH; Agarwal, PK, Intersection Queries in Sets of Disks.,
in Second Scandinavian Workshop on Algorithm Theory, edited by Gilbert, JR; Karlsson, RG,
SWAT, vol. 447
(1990),
pp. 393403, Springer, ISBN 3540528466 [doi]
 P.K. Agarwal, A. Aggarwal, B. Aronov, S. Kosaraju, B. Shieber, and S. Suri, Computing all externalfarthest neighbors for a simple polygon,
in First Canadian Conference on Computational Geometry
(1989)
 P.K. Agarwal, An efficient algorithm for partitioning arrangements of lines and its applications,
in Fifth Annual Symposium on Computational Geometry
(1989)
 P.K. Agarwal, Ray shooting and other applications of spanning trees with low stabbing number,
Fifth Annual Symposium on Computational Geometry
(1989)
 Agarwal, PK; Sharir, M; Shor, P, Sharp upper and lower bounds on the length of general DavenportSchinzel sequences,
Journal of Combinatorial Theory, Series A, vol. 52 no. 2
(1989),
pp. 228274, ISSN 00973165 [abs]
 P.K. Agarwal and Micha Sharir, Redblue intersection detection algorithms, with applications to motion planning and collision detection,
Fourth Annual Symposium on Computational Geometry
(1988)
 T. Smith, D. Peuquet, and S. Menon, and P.K. Agarwal, KBGISII: A knowledgebased geographic information system,
International Journal of Geographical Information Systems, vol. 1
(1987),
pp. 149172
 P.K. Agarwal, A. Choudhary and S. Sengupta, A VME bus compatible FFT Processor,
in Conference on Signal Processing
(1983) (Cochin, India.)
Papers Submitted
 Agarwal, PK; Arge, L; Erickson, J, Indexing moving points,
Journal of Computer and System Sciences, vol. 66 no. 1
(2002),
pp. 207243 [doi] [abs]
 Agarwal, PK; Procopiuc, CM, Approximation algorithms for projective clustering,
Journal of Algorithms, vol. 46 no. 2
(2002),
pp. 115139 [doi] [abs]
 Procopiuc, O; Agarwal, PK; Arge, L; Vitter, JS, Bkdtree: A dynamic scalable kdtree,
Lecture notes in computer science, vol. 2750
(2002),
pp. 4665, ISSN 03029743 (submitted for publication.) [abs]
 P.K. Agarwal, B. Bhattacharya, and S. Sen, Outputsensitive algorithms for uniform partitions of points,
in Algorithmica, in press
(2002)
 P.K. Agarwal and M. Sharir, On the numbers of congruent simplices in a point set,
to appear in Discrete and Computational Geometry
(2002)
 P.K. Agarwal (invited) with J. Basch, L.J. Guibas, J. Hershberger, and L. Zhang, Deformable free space tiling for kinetic collision detection,
submitted to International Journal of Robotics
(2002)
 P.K. Agarwal, C. M. Procopiuc, andand K. R. Varadarajan, An approximation algorithm for computing the twoline center,
submitted to Computational Geometry: Theory and Applications
(2002)
 P.K. Agarwal, M. de Berg, S. HarPeled, M. Overmars, M. Sharir and J. Vahrenhold, Reporting all intersecting pairs of polytopes in two and three dimensions,
submitted to Computational Geometry: Theory and Applications
(2002)
 P.K. Agarwal, M. Bern, D. Eppstein, N. Amenta, P. Chew, K. Clarkson, T. Dey, D. P. Dobkin, H. Edelsbrunner, C. Grimm, L. P. Guibas, J. Harer, J. Hass, A. Hicks, C. K. Johnson, G. Lerman, D. Letscher, P. Plassmann, E. Sedgwick, J. Snoeyink, J. Weeks, C. Y, Emerging challenges in computational topology
(2002) (to appear in 2002.)
 P.K. Agarwal, S. Govindarajan, and L. Arge, CRBtree: An eÆcient indexing scheme for range aggregate queries
(2002) (submitted for publication.)
 P.K. Agarwal, R. Klein, C. Knauer, and M. Sharir, Computing the detour of polygonal curves
(2002) (submitted for publication.)
 Agarwal, PK; Procopiuc, CM, Exact and approximation algorithms for clustering,
Algorithmica (New York), vol. 33 no. 2
(2002),
pp. 201226 [abs]
 Agarwal, PK; HarPeled, S; Karia, M, Computing approximate shortest paths on convex polytopes,
Algorithmica (New York), vol. 33 no. 2
(2002),
pp. 227242, to appear in Algorithmica [abs]
 Agarwal, PK; Biedl, T; Lazard, S; Robbins, S; Suri, S; Whitesides, S, Curvatureconstrained shortest paths in a convex polygon,
SIAM Journal on Computing, vol. 31 no. 6
(2002),
pp. 18141851 [doi] [abs]
 Agarwal, PK; Guibas, LJ; Edelsbrunner, H; Erickson, J; Isard, M; HarPeled, S; Hershberger, J; Jensen, C; Kavraki, L; Koehl, P; Lin, M; Manocha, D; Metaxas, D; Mirtich, B; Mount, D; Muthukrishnan, S; Pai, D; Sacks, E; Snoeyink, J; Suri, S; Wolefson, O, Algorithmic issues in modeling motion,
ACM Computing Surveys, vol. 34 no. 4
(2002),
pp. 550572, ISSN 03600300 (to appear in 2002.) [doi] [abs]
 Agarwal, PK; Berg, MD; Gudmundsson, J; Hammar, M; Haverkort, HJ, Boxtrees and Rtrees with nearoptimal query time,
Discrete & Computational Geometry, vol. 28 no. 3
(2002),
pp. 291312, ISSN 01795376 [doi] [abs]
 P.K. Agarwal and P. K. Desikan, Fast algorithms for surface simplication and other related problems,
submitted to Discrete and Computational Geometry
(1999) (Also appears as Technical
Report CS199915, Department of Computer
Science, Duke University, 1999.)
Other
 P.K. Agarwal, Range searching,
Technical Report CS199605, Department of Computer Science, Duke University
(1996)
 P.K. Agarwal, F. Brooks, A. Varshney, H.Weber, and W. Wright, Multiresolution hierarchy generation of polygonal models,
Technical Report CS199520, Department of Computer Science, Duke University
(1995)
 P.K. Agarwal, M. Sharir, and S. Toledo, An efficient multidimensional searching technique and its applications,
Technical Report CS199320, Department of Computer Science, Duke University
(1993)
 P.K. Agarwal and M. T. Shing, Multiterminal flows in planar networks,
Technical Report TRCS8607, Department of Computer Science, Santa Barbara
(1986)
 P.K. Agarwal, Geometric Algorithms,
Technical Report TRCS8517, Department of Computer Science, Santa Barbara
(1985)


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

