| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Pankaj K. Agarwal Pankaj K. Agarwal, Mark H. Overmars , Micha Sharir : Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. SODA 2004 : 516-525 Pankaj K. Agarwal, Boris Aronov , Vladlen Koltun : Efficient algorithms for bichromatic separability. SODA 2004 : 682-690 Pankaj K. Agarwal, Eran Nevo , János Pach , Rom Pinchasi , Micha Sharir , Shakhar Smorodinsky : Lenses in arrangements of pseudo-circles and their applications. J. ACM 51 (2): 139-186 (2004) Pankaj K. Agarwal, Shankar Krishnan , Nabil H. Mustafa , Suresh Venkatasubramanian : Streaming Geometric Optimization Using Graphics Hardware. ESA 2003 : 544-555 Pankaj K. Agarwal, Lars Arge , Jun Yang , Ke Yi : I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. ESA 2003 : 7-18 Sathish Govindarajan , Pankaj K. Agarwal, Lars Arge : CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries. ICDT 2003 : 143-157 Anne D. Collins , Pankaj K. Agarwal, John L. Harer : HPRM: a hierarchical PRM. ICRA 2003 : 4433-4438 Octavian Procopiuc , Pankaj K. Agarwal, Lars Arge , Jeffrey Scott Vitter : Bkd-Tree: A Dznamic Scalable kd-Tree. SSTD 2003 : 46-65 Pankaj K. Agarwal, Lars Arge , Andrew Danner , Bryan Holland-Minkley : Cache-oblivious data structures for orthogonal range searching. Symposium on Computational Geometry 2003 : 237-245 Pankaj K. Agarwal, Sariel Har-Peled , Micha Sharir , Yusu Wang : Hausdorff distance under translation for points and balls. Symposium on Computational Geometry 2003 : 282-291 Pankaj K. Agarwal, Cecilia Magdalena Procopiuc , Kasturi R. Varadarajan : A (1+)-approximation algorithm for 2-line-center. Comput. Geom. 26 (2): 119-128 (2003) Pankaj K. Agarwal, Cecilia Magdalena Procopiuc : Approximation algorithms for projective clustering. J. Algorithms 46 (2): 115-139 (2003) Pankaj K. Agarwal, Lars Arge , Jeff Erickson : Indexing Moving Points. J. Comput. Syst. Sci. 66 (1): 207-243 (2003) Cecilia Magdalena Procopiuc , Pankaj K. Agarwal, Sariel Har-Peled : STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects. ALENEX 2002 : 178-193 Pankaj K. Agarwal, Sathish Govindarajan , S. Muthukrishnan : Range Searching in Categorical Data: Colored Range Searching on Grid. ESA 2002 : 17-28 Pankaj K. Agarwal, Sariel Har-Peled , Nabil H. Mustafa , Yusu Wang : Near-Linear Time Approximation Algorithms for Curve Simplification. ESA 2002 : 29-41 Pankaj K. Agarwal, Torben Hagerup , Rahul Ray , Micha Sharir , Michiel H. M. Smid , Emo Welzl : Translating a Planar Object to Maximize Point Containment. ESA 2002 : 42-53 Pankaj K. Agarwal, Jie Gao , Leonidas J. Guibas : Kinetic Medians and kd-Trees. ESA 2002 : 5-16 Pankaj K. Agarwal, Cecilia Magdalena Procopiuc , Kasturi R. Varadarajan : Approximation Algorithms for k-Line Center. ESA 2002 : 54-63 Cecilia Magdalena Procopiuc , Michael Jones , Pankaj K. Agarwal, T. M. Murali : A Monte Carlo algorithm for fast projective clustering. SIGMOD Conference 2002 : 418-427 Pankaj K. Agarwal, Herbert Edelsbrunner , Yusu Wang : Computing the writhing number of a polygonal knot. SODA 2002 : 791-799 Pankaj K. Agarwal, Micha Sharir : Pseudo-line arrangements: duality, algorithms, and applications. SODA 2002 : 800-809 Pankaj K. Agarwal, Leonidas J. Guibas , Herbert Edelsbrunner , Jeff Erickson , Michael Isard , Sariel Har-Peled , John Hershberger , Christian S. Jensen , Lydia E. Kavraki , Patrice Koehl , Ming Lin , Dinesh Manocha , Dimitris N. Metaxas , Brian Mirtich , David M. Mount , S. Muthukrishnan , Dinesh K. Pai , Elisha Sacks , Jack Snoeyink , Subhash Suri , Ouri Wolfson : Algorithmic issues in modeling motion. ACM Comput. Surv. 34 (4): 550-572 (2002) Pankaj K. Agarwal, Binay K. Bhattacharya , Sandeep Sen : Improved Algorithms for Uniform Partitions of Points. Algorithmica 32 (4): 521-539 (2002) Pankaj K. Agarwal, Cecilia Magdalena Procopiuc : Exact and Approximation Algorithms for Clustering. Algorithmica 33 (2): 201-226 (2002) Pankaj K. Agarwal, Sariel Har-Peled , Meetesh Karia : Computing Approximate Shortest Paths on Convex Polytopes. Algorithmica 33 (2): 227-242 (2002) Pankaj K. Agarwal, Eyal Flato , Dan Halperin : Polygon decomposition for efficient construction of Minkowski sums. Comput. Geom. 21 (1-2): 39-61 (2002) Pankaj K. Agarwal, Mark de Berg , Sariel Har-Peled , Mark H. Overmars , Micha Sharir , Jan Vahrenhold : Reporting intersecting pairs of convex polytopes in two and three dimensions. Comput. Geom. 23 (2): 195-207 (2002) Pankaj K. Agarwal, Mark de Berg , Joachim Gudmundsson , Mikael Hammar , Herman J. Haverkort : Box-Trees and R-Trees with Near-Optimal Query Time. Discrete & Computational Geometry 28 (3): 291-312 (2002) Pankaj K. Agarwal, Julien Basch , Leonidas J. Guibas , John Hershberger , Li Zhang : Deformable Free-Space Tilings for Kinetic Collision Detection. I. J. Robotic Res. 21 (3): 179-198 (2002) Pankaj K. Agarwal, Cecilia Magdalena Procopiuc : Advances in Indexing for Mobile Objects. IEEE Data Eng. Bull. 25 (2): 25-34 (2002) Pankaj K. Agarwal, Therese C. Biedl , Sylvain Lazard , Steve Robbins , Subhash Suri , Sue Whitesides : Curvature-Constrained Shortest Paths in a Convex Polygon. SIAM J. Comput. 31 (6): 1814-1851 (2002) Pankaj K. Agarwal, Boris Aronov , Micha Sharir : On the Complexity of Many Faces in Arrangements of Circles. FOCS 2001 : 74-83 Pankaj K. Agarwal, Lars Arge , Octavian Procopiuc , Jeffrey Scott Vitter : A Framework for Index Bulk Loading and Dynamization. ICALP 2001 : 115-127 Pankaj K. Agarwal, Anne D. Collins , John Harer : Minimal Trap Design. ICRA 2001 : 2243-2248 Pankaj K. Agarwal, Sariel Har-Peled : Maintaining approximate extent measures of moving points. SODA 2001 : 148-157 Pankaj K. Agarwal, Micha Sharir : On the number of congruent simplices in a point. Symposium on Computational Geometry 2001 : 1-9 Pankaj K. Agarwal, Mark de Berg , Joachim Gudmundsson , Mikael Hammar , Herman J. Haverkort : Box-trees and R-trees with near-optimal query time. Symposium on Computational Geometry 2001 : 124-133 Pankaj K. Agarwal, Mark de Berg , Sariel Har-Peled , Mark H. Overmars , Micha Sharir , Jan Vahrenhold : Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. WADS 2001 : 122-134 Pankaj K. Agarwal, Lars Arge , Jan Vahrenhold : Time Responsive External Data Structures for Moving Points. WADS 2001 : 50-61 Pankaj K. Agarwal, Dan Halperin , Richard Pollack : Guest Editors' Foreword. Discrete & Computational Geometry 25 (4): 505-506 (2001) Pankaj K. Agarwal: Guest Editor's Foreword. Discrete & Computational Geometry 26 (2): 185-186 (2001) Pankaj K. Agarwal, Boris Aronov , Micha Sharir : Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. Discrete & Computational Geometry 26 (3): 307-320 (2001) Pankaj K. Agarwal, Leonidas J. Guibas , John Hershberger , Eric Veach : Maintaining the Extent of a Moving Point Set. Discrete & Computational Geometry 26 (3): 353-374 (2001) Pankaj K. Agarwal, Eyal Flato , Dan Halperin : Polygon Decomposition for Efficient Construction of Minkowski Sums. ESA 2000 : 20-31 Pankaj K. Agarwal, Lars Arge , Jeff Erickson : Indexing Moving Points. PODS 2000 : 175-186 Pankaj K. Agarwal, Boris Aronov , Micha Sharir : Exact and approximation algorithms for minimum-width cylindrical shells. SODA 2000 : 510-517 Pankaj K. Agarwal, Pavan K. Desikan : Approximation algorithms for layered manufacturing. SODA 2000 : 528-537 Pankaj K. Agarwal, Cecilia Magdalena Procopiuc : Approximation algorithms for projective clustering. SODA 2000 : 538-547 Pankaj K. Agarwal, Leonidas J. Guibas , Sariel Har-Peled , Alexander Rabinovitch , Micha Sharir : Computing the Penetration Depth of Two Convex Polytopes in 3D. SWAT 2000 : 328-338 Pankaj K. Agarwal, Sariel Har-Peled , Meetesh Karia : Computing approximate shortest paths on convex polytopes. Symposium on Computational Geometry 2000 : 270-279 Pankaj K. Agarwal, Leonidas J. Guibas , T. M. Murali , Jeffrey Scott Vitter : Cylindrical static and kinetic binary space partitions. Comput. Geom. 16 (2): 103-127 (2000) Pankaj K. Agarwal, Kasturi R. Varadarajan : Efficient Algorithms for Approximating Polygonal Chains. Discrete & Computational Geometry 23 (2): 273-291 (2000) Pankaj K. Agarwal, Micha Sharir : Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions. Discrete & Computational Geometry 24 (4): 645-657 (2000) Pankaj K. Agarwal, Boris Aronov , Sariel Har-Peled , Micha Sharir : Approximation Algorithms for Minimum-Width Annuli and Shells. Discrete & Computational Geometry 24 (4): 687-705 (2000) Pankaj K. Agarwal, Julien Basch , Mark de Berg , Leonidas J. Guibas , John Hershberger : Lower Bounds for Kinetic Planar Subdivisions. Discrete & Computational Geometry 24 (4): 721-733 (2000) Pankaj K. Agarwal, Lars Arge , Jeff Erickson , Paolo Giulio Franciosa , Jeffrey Scott Vitter : Efficient Searching with Linear Constraints. J. Comput. Syst. Sci. 61 (2): 194-216 (2000) Pankaj K. Agarwal, Leonidas J. Guibas , Sariel Har-Peled , Alexander Rabinovitch , Micha Sharir : Penetration Depth of Two Convex Polytopes in 3D. Nord. J. Comput. 7 (3): 227-240 (2000) Pankaj K. Agarwal, Edward F. Grove , T. M. Murali , Jeffrey Scott Vitter : Binary Space Partitions for Fat Rectangles. SIAM J. Comput. 29 (5): 1422-1448 (2000) Kasturi R. Varadarajan , Pankaj K. Agarwal: Approximating Shortest Paths on a Nonconvex Polyhedron. SIAM J. Comput. 30 (4): 1321-1340 (2000) Pankaj K. Agarwal, Hongyan Wang : Approximation Algorithms for Curvature-Constrained Shortest Paths. SIAM J. Comput. 30 (6): 1739-1772 (2000) Pankaj K. Agarwal, Binay K. Bhattacharya , Sandeep Sen : Output-Sensitive Algorithms for Uniform Partitions of Points. ISAAC 1999 : 403-414 Pankaj K. Agarwal, Lars Arge , Gerth Stølting Brodal , Jeffrey Scott Vitter : I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. SODA 1999 : 11-20 Pankaj K. Agarwal, Micha Sharir : Motion Planning of a Ball Amid Segments in Three Dimensions. SODA 1999 : 21-30 Kasturi R. Varadarajan , Pankaj K. Agarwal: Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane. SODA 1999 : 805-814 Pankaj K. Agarwal, Micha Sharir : Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions. Symposium on Computational Geometry 1999 : 143-153 Pankaj K. Agarwal, Julien Basch , Mark de Berg , Leonidas J. Guibas , John Hershberger : Lower Bounds for Kinetic Planar Subdivisions. Symposium on Computational Geometry 1999 : 247-254 Pankaj K. Agarwal, Boris Aronov , Sariel Har-Peled , Micha Sharir : Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. Symposium on Computational Geometry 1999 : 380-389 Pankaj K. Agarwal, Boris Aronov , Micha Sharir : Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. Discrete & Computational Geometry 21 (3): 373-388 (1999) Pankaj K. Agarwal, Boris Aronov , Micha Sharir : Motion Planning for a Convex Polygon in a Polygonal Environment. Discrete & Computational Geometry 22 (2): 201-221 (1999) Pankaj K. Agarwal: Guest Editor's Foreword. Int. J. Comput. Geometry Appl. 9 (4/5): 325- (1999) Samir Khuller , Pankaj K. Agarwal, Joseph O'Rourke : Open Problems Presented at SCG'98. J. Algorithms 30 (2): 449-453 (1999) Pankaj K. Agarwal, Alon Efrat , Micha Sharir : Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. SIAM J. Comput. 29 (3): 912-953 (1999) T. M. Murali , Pankaj K. Agarwal, Jeffrey Scott Vitter : Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice. ESA 1998 : 211-222 Pankaj K. Agarwal, David Eppstein , Leonidas J. Guibas , Monika Rauch Henzinger : Parametric and Kinetic Minimum Spanning Trees. FOCS 1998 : 596-605 Pankaj K. Agarwal, Vineet Bafna : The Ribosome Scanning Model for Translation Initiation: Implications for Gene Prediction and Full-Length cDNA Detection. ISMB 1998 : 2-7 Pankaj K. Agarwal, Lars Arge , Jeff Erickson , Paolo Giulio Franciosa , Jeffrey Scott Vitter : Efficient Searching with Linear Constraints. PODS 1998 : 169-178 Pankaj K. Agarwal, Vineet Bafna : Detecting non-adjoining correlations with signals in DNA. RECOMB 1998 : 2-8 Pankaj K. Agarwal, Jeff Erickson , Leonidas J. Guibas : Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract). SODA 1998 : 107-116 Pankaj K. Agarwal, Lars Arge , T. M. Murali , Kasturi R. Varadarajan , Jeffrey Scott Vitter : I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract). SODA 1998 : 117-126 Pankaj K. Agarwal, Cecilia Magdalena Procopiuc : Exact and Approximation Algorithms for Clustering (Extended Abstract). SODA 1998 : 658-667 Pankaj K. Agarwal, Therese C. Biedl , Sylvain Lazard , Steve Robbins , Subhash Suri , Sue Whitesides : Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). Symposium on Computational Geometry 1998 : 392-401 Pankaj K. Agarwal, Micha Sharir : Efficient Algorithms for Geometric Optimization. ACM Comput. Surv. 30 (4): 412-458 (1998) Pankaj K. Agarwal, Marc J. van Kreveld , Subhash Suri : Label placement by maximum independent set in rectangles. Comput. Geom. 11 (3-4): 209-218 (1998) Pankaj K. Agarwal, Nina Amenta , Micha Sharir : Largest Placement of One Convex Polygon Inside Another. Discrete & Computational Geometry 19 (1): 95-104 (1998) Pankaj K. Agarwal, Boris Aronov , Timothy M. Chan , Micha Sharir : On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. Discrete & Computational Geometry 19 (3): 315-331 (1998) Pankaj K. Agarwal, Micha Sharir , Emo Welzl : The Discrete 2-Center Problem. Discrete & Computational Geometry 20 (3): 287-305 (1998) Pankaj K. Agarwal, Joseph O'Rourke : Computational Geometry Column 34. Int. J. Comput. Geometry Appl. 8 (5/6): 637- (1998) Pankaj K. Agarwal, Jirí Matousek , Otfried Schwarzkopf : Computing Many Faces in Arrangements of Lines and Segments. SIAM J. Comput. 27 (2): 491-505 (1998) Pankaj K. Agarwal, Mark de Berg , Jirí Matousek , Otfried Schwarzkopf : Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. SIAM J. Comput. 27 (3): 654-667 (1998) Pankaj K. Agarwal, Subhash Suri : Surface Approximation and Geometric Partitions. SIAM J. Comput. 27 (4): 1016-1035 (1998) Pankaj K. Agarwal, Marc J. van Kreveld , Subhash Suri : Label placement by maximum independent set in rectangles. CCCG 1997 Kasturi R. Varadarajan , Pankaj K. Agarwal: Approximating Shortest Paths on an Nonconvex Polyhedron. FOCS 1997 : 182-191 Pankaj K. Agarwal, Pavan K. Desikan : An Efficient Algorithm for Terraine Simplification. SODA 1997 : 139-147 Pankaj K. Agarwal, Boris Aronov , Micha Sharir : Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. SODA 1997 : 483-492 Pankaj K. Agarwal, Micha Sharir , Emo Welzl : The Discrete 2-Center Problem. Symposium on Computational Geometry 1997 : 147-155 Pankaj K. Agarwal, Boris Aronov , Micha Sharir : On Levels in Arrangements of Lines, Segments, Planes, and Triangles. Symposium on Computational Geometry 1997 : 30-38 Pankaj K. Agarwal, T. M. Murali , Jeffrey Scott Vitter : Practical Techniques for Constructing Binary Space Partitions for Orthogonal Rectangles. Symposium on Computational Geometry 1997 : 382-384 Pankaj K. Agarwal, Leonidas J. Guibas , T. M. Murali , Jeffrey Scott Vitter : Cylindrical Static and Kinetic Binary Space Partitions. Symposium on Computational Geometry 1997 : 39-48 Pankaj K. Agarwal, Leonidas J. Guibas , John Hershberger , Eric Veach : Maintaining the Extent of a Moving Point Set. WADS 1997 : 31-44 Pankaj K. Agarwal, Boris Aronov , János Pach , Richard Pollack , Micha Sharir : Quasi-Planar Graphs Have a Linear Number of Edges. Combinatorica 17 (1): 1-9 (1997) Kasturi R. Varadarajan , Pankaj K. Agarwal: Linear Approximation of Simple Objects. Inf. Process. Lett. 62 (2): 89-94 (1997) Pankaj K. Agarwal, Sariel Har-Peled , Micha Sharir , Kasturi R. Varadarajan : Approximating shortest paths on a convex polytope in three dimensions. J. ACM 44 (4): 567-584 (1997) Pankaj K. Agarwal, Boris Aronov , Joseph O'Rourke , Catherine A. Schevon : Star Unfolding of a Polytope with Applications. SIAM J. Comput. 26 (6): 1689-1713 (1997) Pankaj K. Agarwal, Boris Aronov , Micha Sharir : Computing Envelopes in Four Dimensions with Applications. SIAM J. Comput. 26 (6): 1714-1732 (1997) Pankaj K. Agarwal, Edward F. Grove , T. M. Murali , Jeffrey Scott Vitter : Binary Search Partitions for Fat Rectangles. FOCS 1996 : 482-491 Jonathan D. Cohen , Amitabh Varshney , Dinesh Manocha , Greg Turk , Hans Weber , Pankaj K. Agarwal, Frederick P. Brooks Jr. , William V. Wright : Simplification Envelopes. SIGGRAPH 1996 : 119-128 Pankaj K. Agarwal, Mark de Berg , Dan Halperin , Micha Sharir : Efficient Generation of k-Directional Assembly Sequences. SODA 1996 : 122-131 Hongyan Wang , Pankaj K. Agarwal: Approximation Algorithms for Curvature-Constrained Shortest Paths. SODA 1996 : 409-418 Pankaj K. Agarwal, Subhash Suri : Simple and Practical Geometric Algorithms. ACM Comput. Surv. 28 (4es): 16 (1996) Pankaj K. Agarwal, Marc J. van Kreveld : Connected Component and Simple Polygon Intersection Searching. Algorithmica 15 (6): 626-660 (1996) Pankaj K. Agarwal, Otfried Schwarzkopf , Micha Sharir : The Overlay of Lower Envelopes and Its Applications. Discrete & Computational Geometry 15 (1): 1-13 (1996) Pankaj K. Agarwal, Micha Sharir : Efficient Randomized Algorithms for Some Geometric. Optimization Problems. Discrete & Computational Geometry 16 (4): 317-337 (1996) Pankaj K. Agarwal, Sandeep Sen : Selection in Monotone Matrices and Computing k th Nearest Neighbors. J. Algorithms 20 (3): 581-601 (1996) Pankaj K. Agarwal, Micha Sharir : Ray Shooting Amidst Convex Polygons in 2D. J. Algorithms 21 (3): 508-519 (1996) Pankaj K. Agarwal, Micha Sharir : Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions. SIAM J. Comput. 25 (1): 100-116 (1996) Pankaj K. Agarwal, Boris Aronov , János Pach , Richard Pollack , Micha Sharir : Quasi-Planar Graphs Have a Linear Number of Edges. Graph Drawing 1995 : 1-7 Pankaj K. Agarwal, Prabhakar Raghavan , Hisao Tamaki : Motion planning for a steering-constrained robot through moderate obstacles. STOC 1995 : 343-352 Pankaj K. Agarwal, Otfried Schwarzkopf , Micha Sharir : The Overlay of Lower Envelopes in Three Dimensions and Its Applications. Symposium on Computational Geometry 1995 : 182-189 Pankaj K. Agarwal, Boris Aronov , Subhash Suri : Stabbing Triangulations by Lines in 3D. Symposium on Computational Geometry 1995 : 267-276 Pankaj K. Agarwal, Micha Sharir : Efficient Randomized Algorithms for Some Geometric Optimization Problems. Symposium on Computational Geometry 1995 : 326-335 Pankaj K. Agarwal, Alon Efrat , Micha Sharir : Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. Symposium on Computational Geometry 1995 : 39-50 Pankaj K. Agarwal, Micha Sharir : Algorithmic Techniques for Geometric Optimization. Computer Science Today 1995 : 234-253 Pankaj K. Agarwal, Jirí Matousek : Dynamic Half-Space Range Reporting and Its Applications. Algorithmica 13 (4): 325-345 (1995) Pankaj K. Agarwal, Matthew J. Katz , Micha Sharir : Computing Depth Orders for Fat Objects and Related Problems. Comput. Geom. 5 : 187-206 (1995) Pankaj K. Agarwal, Subhash Suri : Surface Approximation and Geometric Partitions. SODA 1994 : 24-33 Pankaj K. Agarwal, Matthew J. Katz , Micha Sharir : Computing Depth Orders and Related Problems. SWAT 1994 : 1-12 Pankaj K. Agarwal, Sandeep Sen : Selection in Monotone Matrices and Computing k th Nearest Neighbors. SWAT 1994 : 13-24 Pankaj K. Agarwal, Boris Aronov , Micha Sharir : Computing Envelopes in Four Dimensions with Applications. Symposium on Computational Geometry 1994 : 348-358 Pankaj K. Agarwal, Mark de Berg , Jirí Matousek , Otfried Schwarzkopf : Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. Symposium on Computational Geometry 1994 : 67-75 Pankaj K. Agarwal, Jirí Matousek , Otfried Schwarzkopf : Computing Many Faces in Arrangements of Lines and Segments. Symposium on Computational Geometry 1994 : 76-84 Pankaj K. Agarwal, Micha Sharir : Planar Geometric Location Problems. Algorithmica 11 (2): 185-195 (1994) Pankaj K. Agarwal: On Stabbling Lines for Convex Polyhedra in 3D. Comput. Geom. 4 : 177-189 (1994) Pankaj K. Agarwal, Jirí Matousek : On Range Searching with Semialgebraic Sets. Discrete & Computational Geometry 11 : 393-418 (1994) Pankaj K. Agarwal, Micha Sharir : On the Number of Views of Polyhedral Terrains. Discrete & Computational Geometry 12 : 177-182 (1994) Pankaj K. Agarwal, Noga Alon , Boris Aronov , Subhash Suri : Can Visibility Graphs Be Represented Compactly?. Discrete & Computational Geometry 12 : 347-365 (1994) Pankaj K. Agarwal, Marc J. van Kreveld : Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning. Int. J. Comput. Geometry Appl. 4 (4): 369-383 (1994) Pankaj K. Agarwal, Micha Sharir , Sivan Toledo : Applications of Parametric Searching in Geometric Optimization. J. Algorithms 17 (3): 292-318 (1994) Pankaj K. Agarwal, Micha Sharir : On the Number of Views of Polyhedral Terrains. CCCG 1993 : 55-60 Pankaj K. Agarwal, Micha Sharir : Ray Shooting Amidst Convex Polytopes in Three Dimensions. SODA 1993 : 260-270 Pankaj K. Agarwal, Noga Alon , Boris Aronov , Subhash Suri : Can Visibility Graphs be Represented Compactly? Symposium on Computational Geometry 1993 : 338-347 Pankaj K. Agarwal, Marc J. van Kreveld : Connected Component and Simple Polygon Intersection Searching (Extended Abstract). WADS 1993 : 36-47 Pankaj K. Agarwal, Boris Aronov , Micha Sharir , Subhash Suri : Selecting Distances in the Plane. Algorithmica 9 (5): 495-514 (1993) Pankaj K. Agarwal, Micha Sharir : Applications of a New Space-Partitioning Technique. Discrete & Computational Geometry 9 : 11-38 (1993) Pankaj K. Agarwal, Micha Sharir : Circular visibility of a simple polygon from a fixed point. Int. J. Comput. Geometry Appl. 3 (1): 1-25 (1993) Pankaj K. Agarwal, Micha Sharir : Circle Shooting in a Simple Polygon. J. Algorithms 14 (1): 69-87 (1993) Pankaj K. Agarwal, Marc J. van Kreveld , Mark H. Overmars : Intersection Queries in Curved Objects. J. Algorithms 15 (2): 229-266 (1993) Pankaj K. Agarwal, Alon Efrat , Micha Sharir , Sivan Toledo : Computing a Segment Center for a Planar Point Set. J. Algorithms 15 (2): 314-323 (1993) Pankaj K. Agarwal, Marco Pellegrini , Micha Sharir : Counting Circular Arc Intersections. SIAM J. Comput. 22 (4): 778-793 (1993) Pankaj K. Agarwal, Jirí Matousek : Ray Shooting and Parametric Search. SIAM J. Comput. 22 (4): 794-806 (1993) Pankaj K. Agarwal, David Eppstein , Jirí Matousek : Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees FOCS 1992 : 80-89 Pankaj K. Agarwal, Marc J. van Kreveld : Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning. FSTTCS 1992 : 80-91 Pankaj K. Agarwal, Jirí Matousek : On Range Searching with Semialgebraic Sets. MFCS 1992 : 1-13 Pankaj K. Agarwal, Jirí Matousek : Relative Neighborhood Graphs in Three Dimensions. SODA 1992 : 58-65 Pankaj K. Agarwal, Micha Sharir , Sivan Toledo : Applications of Parametric Searching in Geometric Optimization. SODA 1992 : 72-82 Pankaj K. Agarwal, Jirí Matousek : Ray Shooting and Parametric Search STOC 1992 : 517-526 Marc J. van Kreveld , Mark H. Overmars , Pankaj K. Agarwal: Intersection Queries in Sets of Disks. BIT 32 (2): 268-279 (1992) Pankaj K. Agarwal, Jirí Matousek : Relative Neighborhood Graphs in Three Dimensions. Comput. Geom. 2 : 1-14 (1992) Pankaj K. Agarwal, Boris Aronov : Counting Facets and Incidences. Discrete & Computational Geometry 7 : 359-369 (1992) Pankaj K. Agarwal: Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number. SIAM J. Comput. 21 (3): 540-570 (1992) Pankaj K. Agarwal, Micha Sharir : Planar Geometric Location Problems and Maintaining the Width of a Planar Set. SODA 1991 : 449-458 Pankaj K. Agarwal, Micha Sharir : Counting Circular Arc Intersections. Symposium on Computational Geometry 1991 : 10-20 Pankaj K. Agarwal, Marc J. van Kreveld , Mark H. Overmars : Intersection Queries for Curved Objects (Extended Abstract). Symposium on Computational Geometry 1991 : 41-50 Pankaj K. Agarwal, Jirí Matousek , Subhash Suri : Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. WADS 1991 : 105-116 Pankaj K. Agarwal, Micha Sharir : Applications of a New Space Partitioning Technique. WADS 1991 : 379-391 Pankaj K. Agarwal, Jirí Matousek , Subhash Suri : Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions. Comput. Geom. 1 : 189-201 (1991) Pankaj K. Agarwal, Micha Sharir : Off-line Dynamic Maintenance of the Width of a Planar Point Set. Comput. Geom. 1 : 65-78 (1991) Pankaj K. Agarwal, Herbert Edelsbrunner , Otfried Schwarzkopf : Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. Discrete & Computational Geometry 6 : 407-422 (1991) Pankaj K. Agarwal, Boris Aronov , Joseph O'Rourke , Catherine A. Schevon : Star Unfolding of a Polytope with Applications (Extended Abstract). SWAT 1990 : 251-263 Marc J. van Kreveld , Mark H. Overmars , Pankaj K. Agarwal: Intersection Queries in Sets of Disks. SWAT 1990 : 393-403 Pankaj K. Agarwal, Herbert Edelsbrunner , Otfried Schwarzkopf , Emo Welzl : Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. Symposium on Computational Geometry 1990 : 203-210 Pankaj K. Agarwal, Boris Aronov , Micha Sharir , Subhash Suri : Selecting Distances in the Plane. Symposium on Computational Geometry 1990 : 321-331 Pankaj K. Agarwal: Partitioning Arrangements of Lines I: An Efficient deterministic Algorithm. Discrete & Computational Geometry 5 : 449-483 (1990) Pankaj K. Agarwal: Parititoning Arrangements of Lines II: Applications. Discrete & Computational Geometry 5 : 533-573 (1990) Pankaj K. Agarwal, Micha Sharir : Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. SIAM J. Comput. 19 (2): 297-321 (1990) Pankaj K. Agarwal: A Deterministic Algorithm for Partitioning Arrangements of Lines and Its Application. Symposium on Computational Geometry 1989 : 11-22 Pankaj K. Agarwal: Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number. Symposium on Computational Geometry 1989 : 315-325 Pankaj K. Agarwal, Micha Sharir : Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. Symposium on Computational Geometry 1988 : 70-80 1 [ 38 ] [ 43 ] 2 [ 94 ] 3 [ 99 ] [ 102 ] [ 116 ] [ 122 ] [ 133 ] [ 139 ] [ 145 ] [ 166 ] [ 170 ] [ 171 ] [ 173 ] [ 174 ] 4 [ 7 ] [ 10 ] [ 20 ] [ 36 ] [ 38 ] [ 43 ] [ 50 ] [ 59 ] [ 62 ] [ 74 ] [ 75 ] [ 78 ] [ 82 ] [ 84 ] [ 93 ] [ 109 ] [ 110 ] [ 111 ] [ 124 ] [ 132 ] [ 136 ] [ 146 ] [ 177 ] 5 [ 101 ] [ 103 ] 6 [ 112 ] [ 123 ] [ 149 ] 7 [ 49 ] [ 71 ] [ 89 ] [ 112 ] [ 123 ] [ 140 ] [ 141 ] [ 150 ] [ 151 ] 8 [ 117 ] [ 155 ] 9 [ 97 ] [ 147 ] 10 [ 116 ] 11 [ 72 ] 12 [ 93 ] 13 [ 72 ] 14 [ 144 ] [ 172 ] 15 [ 170 ] 16 [ 85 ] [ 131 ] 17 [ 8 ] [ 11 ] [ 156 ] [ 158 ] 18 [ 31 ] [ 57 ] [ 106 ] 19 [ 28 ] [ 104 ] 20 [ 100 ] [ 102 ] [ 122 ] [ 133 ] [ 156 ] [ 166 ] 21 [ 134 ] [ 152 ] 22 [ 102 ] [ 122 ] 23 [ 161 ] 24 [ 164 ] [ 173 ] 25 [ 73 ] [ 120 ] 26 [ 141 ] [ 150 ] 27 [ 79 ] [ 80 ] [ 100 ] [ 104 ] [ 112 ] [ 121 ] [ 123 ] [ 127 ] [ 129 ] [ 135 ] [ 149 ] [ 156 ] [ 161 ] 28 [ 162 ] 29 [ 71 ] [ 134 ] [ 138 ] [ 152 ] 30 [ 141 ] [ 150 ] 31 [ 76 ] [ 111 ] [ 121 ] [ 124 ] [ 128 ] [ 129 ] [ 140 ] [ 143 ] [ 151 ] [ 153 ] [ 156 ] [ 163 ] [ 165 ] [ 169 ] 32 [ 144 ] 33 [ 172 ] 34 [ 141 ] [ 150 ] 35 [ 104 ] 36 [ 79 ] [ 112 ] [ 123 ] [ 135 ] [ 149 ] [ 156 ] 37 [ 170 ] 38 [ 156 ] 39 [ 156 ] 40 [ 159 ] 41 [ 128 ] [ 153 ] 42 [ 52 ] [ 54 ] 43 [ 156 ] 44 [ 107 ] 45 [ 156 ] 46 [ 177 ] 47 [ 9 ] [ 16 ] [ 22 ] [ 27 ] [ 32 ] [ 37 ] [ 42 ] [ 68 ] [ 87 ] [ 95 ] 48 [ 175 ] 49 [ 97 ] [ 147 ] 50 [ 156 ] 51 [ 72 ] [ 156 ] 52 [ 13 ] [ 15 ] [ 21 ] [ 23 ] [ 25 ] [ 26 ] [ 28 ] [ 29 ] [ 45 ] [ 48 ] [ 49 ] [ 55 ] [ 89 ] [ 90 ] 53 [ 156 ] 54 [ 156 ] 55 [ 156 ] 56 [ 73 ] [ 80 ] [ 81 ] [ 99 ] [ 105 ] [ 120 ] [ 127 ] [ 159 ] 57 [ 163 ] [ 175 ] 58 [ 156 ] [ 164 ] 59 [ 176 ] 60 [ 10 ] [ 75 ] [ 91 ] [ 107 ] 61 [ 9 ] [ 16 ] [ 22 ] [ 32 ] [ 140 ] [ 151 ] [ 178 ] 62 [ 62 ] [ 78 ] [ 176 ] 63 [ 156 ] 64 [ 30 ] 65 [ 176 ] 66 [ 62 ] [ 78 ] [ 138 ] 67 [ 98 ] [ 130 ] [ 148 ] [ 154 ] [ 159 ] [ 160 ] [ 165 ] [ 167 ] [ 168 ] 68 [ 145 ] [ 171 ] 69 [ 121 ] [ 129 ] 70 [ 61 ] 71 [ 162 ] 72 [ 97 ] [ 147 ] 73 [ 156 ] 74 [ 10 ] [ 75 ] 75 [ 8 ] [ 11 ] [ 48 ] [ 49 ] [ 60 ] [ 67 ] [ 89 ] [ 90 ] 76 [ 51 ] [ 65 ] [ 117 ] [ 155 ] 77 [ 1 ] [ 4 ] [ 7 ] [ 12 ] [ 14 ] [ 17 ] [ 18 ] [ 24 ] [ 30 ] [ 31 ] [ 33 ] [ 34 ] [ 35 ] [ 36 ] [ 39 ] [ 40 ] [ 41 ] [ 44 ] [ 47 ] [ 50 ] [ 52 ] [ 54 ] [ 56 ] [ 57 ] [ 58 ] [ 60 ] [ 62 ] [ 63 ] [ 64 ] [ 66 ] [ 67 ] [ 71 ] [ 74 ] [ 76 ] [ 78 ] [ 82 ] [ 83 ] [ 84 ] [ 92 ] [ 93 ] [ 94 ] [ 96 ] [ 106 ] [ 109 ] [ 110 ] [ 111 ] [ 113 ] [ 115 ] [ 121 ] [ 124 ] [ 125 ] [ 129 ] [ 132 ] [ 136 ] [ 140 ] [ 142 ] [ 146 ] [ 151 ] [ 157 ] [ 162 ] [ 169 ] [ 176 ] [ 178 ] 78 [ 162 ] 79 [ 176 ] 80 [ 156 ] 81 [ 7 ] [ 13 ] [ 15 ] [ 36 ] [ 38 ] [ 43 ] [ 53 ] [ 59 ] [ 69 ] [ 87 ] [ 88 ] [ 95 ] [ 97 ] [ 147 ] [ 156 ] 82 [ 61 ] 83 [ 24 ] [ 31 ] [ 41 ] 84 [ 72 ] 85 [ 139 ] [ 140 ] [ 151 ] 86 [ 76 ] [ 77 ] [ 86 ] [ 99 ] [ 114 ] [ 119 ] [ 126 ] [ 160 ] [ 168 ] 87 [ 72 ] 88 [ 79 ] [ 135 ] 89 [ 175 ] 90 [ 73 ] [ 80 ] [ 81 ] [ 99 ] [ 102 ] [ 105 ] [ 116 ] [ 120 ] [ 122 ] [ 127 ] [ 145 ] [ 171 ] 91 [ 70 ] [ 118 ] 92 [ 158 ] [ 163 ] [ 169 ] 93 [ 72 ] 94 [ 8 ] [ 83 ] [ 92 ] [ 162 ] 95 [ 97 ] [ 147 ] 96 [ 156 ] 97 [ 72 ] 98 [ 174 ] 99 [ 174 ] 100 [ 149 ]  ©2004 Association for Computing Machinery |
