Welcome to D
SIGMOD'00
PODS'00
SIGMOD Recor
CIKM 2000/CI
COMAD 2000
Data Enginee
DL 2000
DPDJ
EDBT 2000
Hypertext 20
ICDE 2000
KDD 2000
KDD Explorat
KRDB 2000
SBBD 2000
SIGIR 2000
SIGIR Forum
SSDBM 2000
TODS
VLDB'00
VLDBJ
About DiSC 2
Editorial Bo
Acknowledgem
DiSC 2001 Pr
ADVIS
DiSC'01 Feed
DiSC'01 Site
Search DiSC'
<<<Author Index>>>
Copyright No

Pankaj K. Agarwal

Papers on DiSC'01


Indexing Moving Points

Publications


Note: Links lead to the DBLP on the Web.

Pankaj K. Agarwal

97 Pankaj K. Agarwal, Eyal Flato , Dan Halperin : Polygon Decomposition for Efficient Construction of Minkowski Sums. ESA 2000 : 20-31

96 Pankaj K. Agarwal, Lars Arge , Jeff Erickson : Indexing Moving Points. PODS 2000 : 175-186

95 Pankaj K. Agarwal, Boris Aronov , Micha Sharir : Exact and approximation algorithms for minimum-width cylindrical shells. SODA 2000 : 510-517

94 Pankaj K. Agarwal, Pavan K. Desikan : Approximation algorithms for layered manufacturing. SODA 2000 : 528-537

93 Pankaj K. Agarwal, Cecilia Magdalena Procopiuc : Approximation algorithms for projective clustering. SODA 2000 : 538-547

92 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

91 Pankaj K. Agarwal, Sariel Har-Peled , Meetesh Karia : Computing approximate shortest paths on convex polytopes. Symposium on Computational Geometry 2000 : 270-279

90 Pankaj K. Agarwal, Lars Arge , Jeff Erickson , Paulo Giulio Franciosa , Jeffrey Scott Vitter : Efficient Searching with Linear Constraints. JCSS 61 (2): 194-216 (2000)

89 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)

88 Kasturi R. Varadarajan , Pankaj K. Agarwal: Approximating Shortest Paths on a Nonconvex Polyhedron. SIAM J. Comput. 30 (4): 1321-1340 (2000)

87 Pankaj K. Agarwal, Binay K. Bhattacharya , Sandeep Sen : Output-Sensitive Algorithms for Uniform Partitions of Points. ISAAC 1999 : 403-414

86 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

85 Pankaj K. Agarwal, Micha Sharir : Motion Planning of a Ball Amid Segments in Three Dimensions. SODA 1999 : 21-30

84 Kasturi R. Varadarajan , Pankaj K. Agarwal: Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane. SODA 1999 : 805-814

83 Pankaj K. Agarwal, Micha Sharir : Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions. Symposium on Computational Geometry 1999 : 143-153

82 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

81 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

80 Samir Khuller , Pankaj K. Agarwal, Joseph O'Rourke : Open Problems Presented at SCG'98. J. Algorithms 30 (2): 449-453 (1999)

79 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)

78 T. M. Murali , Pankaj K. Agarwal, Jeffrey Scott Vitter : Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice. ESA 1998 : 211-222

77 Pankaj K. Agarwal, David Eppstein , Leonidas J. Guibas , Monika Rauch Henzinger : Parametric and Kinetic Minimum Spanning Trees. FOCS 1998 : 596-605

76 Pankaj K. Agarwal, Lars Arge , Jeff Erickson , Paolo Giulio Franciosa , Jeffrey Scott Vitter : Efficient Searching with Linear Constraints. PODS 1998 : 169-178

75 Pankaj K. Agarwal, Vineet Bafna : Detecting non-adjoining correlations with signals in DNA. RECOMB 1998 : 2-8

74 Pankaj K. Agarwal, Jeff Erickson , Leonidas J. Guibas : Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract). SODA 1998 : 107-116

73 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

72 Pankaj K. Agarwal, Cecilia Magdalena Procopiuc : Exact and Approximation Algorithms for Clustering (Extended Abstract). SODA 1998 : 658-667

71 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

70 Pankaj K. Agarwal, Micha Sharir : Efficient Algorithms for Geometric Optimization. ACM Computing Surveys 30 (4): 412-458 (1998)

69 Pankaj K. Agarwal, Jirí Matousek , Otfried Schwarzkopf : Computing Many Faces in Arrangements of Lines and Segments. SIAM J. Comput. 27 (2): 491-505 (1998)

68 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)

67 Pankaj K. Agarwal, Subhash Suri : Surface Approximation and Geometric Partitions. SIAM J. Comput. 27 (4): 1016-1035 (1998)

66 Kasturi R. Varadarajan , Pankaj K. Agarwal: Approximating Shortest Paths on an Nonconvex Polyhedron. FOCS 1997 : 182-191

65 Pankaj K. Agarwal, Pavan K. Desikan : An Efficient Algorithm for Terraine Simplification. SODA 1997 : 139-147

64 Pankaj K. Agarwal, Boris Aronov , Micha Sharir : Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. SODA 1997 : 483-492

63 Pankaj K. Agarwal, Micha Sharir , Emo Welzl : The Discrete 2-Center Problem. Symposium on Computational Geometry 1997 : 147-155

62 Pankaj K. Agarwal, Boris Aronov , Micha Sharir : On Levels in Arrangements of Lines, Segments, Planes, and Triangles. Symposium on Computational Geometry 1997 : 30-38

61 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

60 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

59 Pankaj K. Agarwal, Leonidas J. Guibas , John Hershberger , Eric Veach : Maintaining the Extent of a Moving Point Set. WADS 1997 : 31-44

58 Kasturi R. Varadarajan , Pankaj K. Agarwal: Linear Approximation of Simple Objects. IPL 62 (2): 89-94 (1997)

57 Pankaj K. Agarwal, Sariel Har-Peled , Micha Sharir , Kasturi R. Varadarajan : Approximating Shortest Paths on a Convex Polytope in Three Dimensions. JACM 44 (4): 567-584 (1997)

56 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)

55 Pankaj K. Agarwal, Boris Aronov , Micha Sharir : Computing Envelopes in Four Dimensions with Applications. SIAM J. Comput. 26 (6): 1714-1732 (1997)

54 Pankaj K. Agarwal, Edward F. Grove , T. M. Murali , Jeffrey Scott Vitter : Binary Search Partitions for Fat Rectangles. FOCS 1996 : 482-491

53 Pankaj K. Agarwal, Mark de Berg , Dan Halperin , Micha Sharir : Efficient Generation of k-Directional Assembly Sequences. SODA 1996 : 122-131

52 Hongyan Wang , Pankaj K. Agarwal: Approximation Algorithms for Curvature-Constrained Shortest Paths. SODA 1996 : 409-418

51 Pankaj K. Agarwal, Subhash Suri : Simple and Practical Geometric Algorithms. ACM Computing Surveys 28 (4es): 16 (1996)

50 Pankaj K. Agarwal, Marc J. van Kreveld : Connected Component and Simple Polygon Intersection Searching. Algorithmica 15 (6): 626-660 (1996)

49 Pankaj K. Agarwal, Sandeep Sen : Selection in Monotone Matrices and Computing k th Nearest Neighbors. J. Algorithms 20 (3): 581-601 (1996)

48 Pankaj K. Agarwal, Micha Sharir : Ray Shooting Amidst Convex Polygons in 2D. J. Algorithms 21 (3): 508-519 (1996)

47 Pankaj K. Agarwal, Micha Sharir : Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions. SIAM J. Comput. 25 (1): 100-116 (1996)

46 Pankaj K. Agarwal, Micha Sharir : Algorithmic Techniques for Geometric Optimization. Computer Science Today 1995 : 234-253

45 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

44 Pankaj K. Agarwal, Prabhakar Raghavan , Hisao Tamaki : Motion planning for a steering-constrained robot through moderate obstacles. STOC 1995 : 343-352

43 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

42 Pankaj K. Agarwal, Boris Aronov , Subhash Suri : Stabbing Triangulations by Lines in 3D. Symposium on Computational Geometry 1995 : 267-276

41 Pankaj K. Agarwal, Micha Sharir : Efficient Randomized Algorithms for Some Geometric Optimization Problems. Symposium on Computational Geometry 1995 : 326-335

40 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

39 Pankaj K. Agarwal, Jirí Matousek : Dynamic Half-Space Range Reporting and Its Applications. Algorithmica 13 (4): 325-345 (1995)

38 Pankaj K. Agarwal, Subhash Suri : Surface Approximation and Geometric Partitions. SODA 1994 : 24-33

37 Pankaj K. Agarwal, Matthew J. Katz , Micha Sharir : Computing Depth Orders and Related Problems. SWAT 1994 : 1-12

36 Pankaj K. Agarwal, Sandeep Sen : Selection in Monotone Matrices and Computing k th Nearest Neighbors. SWAT 1994 : 13-24

35 Pankaj K. Agarwal, Boris Aronov , Micha Sharir : Computing Envelopes in Four Dimensions with Applications. Symposium on Computational Geometry 1994 : 348-358

34 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

33 Pankaj K. Agarwal, Jirí Matousek , Otfried Schwarzkopf : Computing Many Faces in Arrangements of Lines and Segments. Symposium on Computational Geometry 1994 : 76-84

32 Pankaj K. Agarwal, Micha Sharir : Planar Geometric Location Problems. Algorithmica 11 (2): 185-195 (1994)

31 Pankaj K. Agarwal, Micha Sharir , Sivan Toledo : Applications of Parametric Searching in Geometric Optimization. J. Algorithms 17 (3): 292-318 (1994)

30 Pankaj K. Agarwal, Micha Sharir : Ray Shooting Amidst Convex Polytopes in Three Dimensions. SODA 1993 : 260-270

29 Pankaj K. Agarwal, Noga Alon , Boris Aronov , Subhash Suri : Can Visibility Graphs be Represented Compactly? Symposium on Computational Geometry 1993 : 338-347

28 Pankaj K. Agarwal, Marc J. van Kreveld : Connected Component and Simple Polygon Intersection Searching (Extended Abstract). WADS 1993 : 36-47

27 Pankaj K. Agarwal, Boris Aronov , Micha Sharir , Subhash Suri : Selecting Distances in the Plane. Algorithmica 9 (5): 495-514 (1993)

26 Pankaj K. Agarwal, Micha Sharir : Circle Shooting in a Simple Polygon. J. Algorithms 14 (1): 69-87 (1993)

25 Pankaj K. Agarwal, Marc J. van Kreveld , Mark H. Overmars : Intersection Queries in Curved Objects. J. Algorithms 15 (2): 229-266 (1993)

24 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)

23 Pankaj K. Agarwal, Marco Pellegrini , Micha Sharir : Counting Circular Arc Intersections. SIAM J. Comput. 22 (4): 778-793 (1993)

22 Pankaj K. Agarwal, Jirí Matousek : Ray Shooting and Parametric Search. SIAM J. Comput. 22 (4): 794-806 (1993)

21 Pankaj K. Agarwal, David Eppstein , Jirí Matousek : Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees. FOCS 1992 : 80-89

20 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

19 Pankaj K. Agarwal, Jirí Matousek : On Range Searching with Semialgebraic Sets. MFCS 1992 : 1-13

18 Pankaj K. Agarwal, Jirí Matausek : Relative Neighborhood Graphs in Three Dimensions. SODA 1992 : 58-65

17 Pankaj K. Agarwal, Micha Sharir , Sivan Toledo : Applications of Parametric Searching in Geometric Optimization. SODA 1992 : 72-82

16 Pankaj K. Agarwal, Jirí Matousek : Ray Shooting and Parametric Search. STOC 1992 : 517-526

15 Marc J. van Kreveld , Mark H. Overmars , Pankaj K. Agarwal: Intersection Queries in Sets of Disks. BIT 32 (2): 268-279 (1992)

14 Pankaj K. Agarwal: Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number. SIAM J. Comput. 21 (3): 540-570 (1992)

13 Pankaj K. Agarwal, Micha Sharir : Planar Geometric Location Problems and Maintaining the Width of a Planar Set. SODA 1991 : 449-458

12 Pankaj K. Agarwal, Micha Sharir : Counting Circular Arc Intersections. Symposium on Computational Geometry 1991 : 10-20

11 Pankaj K. Agarwal, Marc J. van Kreveld , Mark H. Overmars : Intersection Queries for Curved Objects (Extended Abstract). Symposium on Computational Geometry 1991 : 41-50

10 Pankaj K. Agarwal, Jirí Matousek , Subhash Suri : Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. WADS 1991 : 105-116

9 Pankaj K. Agarwal, Micha Sharir : Applications of a New Space Partitioning Technique. WADS 1991 : 379-391

8 Pankaj K. Agarwal, Boris Aronov , Joseph O'Rourke , Catherine A. Schevon : Star Unfolding of a Polytope with Applications (Extended Abstract). SWAT 1990 : 251-263

7 Marc J. van Kreveld , Mark H. Overmars , Pankaj K. Agarwal: Intersection Queries in Sets of Disks. SWAT 1990 : 393-403

6 Pankaj K. Agarwal, Herbert Edelsbrunner , Otfried Schwarzkopf , Emo Welzl : Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. Symposium on Computational Geometry 1990 : 203-210

5 Pankaj K. Agarwal, Boris Aronov , Micha Sharir , Subhash Suri : Selecting Distances in the Plane. Symposium on Computational Geometry 1990 : 321-331

4 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)

3 Pankaj K. Agarwal: A Deterministic Algorithm for Partitioning Arrangements of Lines and Its Application. Symposium on Computational Geometry 1989 : 11-22

2 Pankaj K. Agarwal: Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number. Symposium on Computational Geometry 1989 : 315-325

1 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





DiSC'01 Copyright ©2002 ACM Inc.