 | 2009 |
|---|
| 250 |       | Pankaj K. Agarwal,
Esther Ezra,
Shashidhara K. Ganjugunte:
Efficient Sensor Placement for Surveillance Problems.
DCOSS 2009: 301-314 |
| 249 | | Pankaj K. Agarwal,
Siu-Wing Cheng,
Yufei Tao,
Ke Yi:
Indexing uncertain data.
PODS 2009: 137-146 |
| 248 | | Pankaj K. Agarwal,
R. Sharathkumar,
Hai Yu:
Approximate Euclidean shortest paths amid convex obstacles.
SODA 2009: 283-292 |
| 247 | | Pankaj K. Agarwal,
Esther Ezra,
Micha Sharir:
Near-linear approximation algorithms for geometric hitting sets.
Symposium on Computational Geometry 2009: 23-32 |
| 246 | | Pankaj K. Agarwal,
Junyi Xie,
Jun Yang,
Hai Yu:
Input-sensitive scalable continuous join query processing.
ACM Trans. Database Syst. 34(3): (2009) |
| 2008 |
|---|
| 245 | | Pankaj K. Agarwal,
Danny Z. Chen,
Shashidhara K. Ganjugunte,
Ewa Misiolek,
Micha Sharir,
Kai Tang:
Stabbing Convex Polygons with a Segment or a Polygon.
ESA 2008: 52-63 |
| 244 | | Pankaj K. Agarwal,
Jeff M. Phillips:
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers.
ESA 2008: 64-75 |
| 243 | | Badrish Chandramouli,
Jun Yang,
Pankaj K. Agarwal,
Albert Yu,
Ying Zheng:
ProSem: scalable wide-area publish/subscribe.
SIGMOD Conference 2008: 1315-1318 |
| 242 | | Pankaj K. Agarwal,
Lars Arge,
Thomas Mølhave,
Bardia Sadri:
I/o-efficient efficient algorithms for computing contours on a terrain.
Symposium on Computational Geometry 2008: 129-138 |
| 241 | | Pankaj K. Agarwal,
Bardia Sadri,
Hai Yu:
Untangling triangulations through local explorations.
Symposium on Computational Geometry 2008: 288-297 |
| 240 | | Pankaj K. Agarwal,
Micha Sharir,
Emo Welzl:
Algorithms for center and Tverberg points.
ACM Transactions on Algorithms 5(1): (2008) |
| 239 | | Pankaj K. Agarwal,
Haim Kaplan,
Micha Sharir:
Kinetic and dynamic data structures for closest pair and all nearest neighbors.
ACM Transactions on Algorithms 5(1): (2008) |
| 238 | | Hai Yu,
Pankaj K. Agarwal,
Raghunath Poreddy,
Kasturi R. Varadarajan:
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets.
Algorithmica 52(3): 378-402 (2008) |
| 237 | | Pankaj K. Agarwal,
Jeff M. Phillips:
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
CoRR abs/0806.4326: (2008) |
| 236 | | Pankaj K. Agarwal,
Rolf Klein,
Christian Knauer,
Stefan Langerman,
Pat Morin,
Micha Sharir,
Michael A. Soss:
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D.
Discrete & Computational Geometry 39(1-3): 17-37 (2008) |
| 235 | | Pankaj K. Agarwal,
Sariel Har-Peled,
Hai Yu:
Robust Shape Fitting via Peeling and Grating Coresets.
Discrete & Computational Geometry 39(1-3): 38-58 (2008) |
| 234 | | Pankaj K. Agarwal,
Ferran Hurtado,
Godfried T. Toussaint,
Joan Trias:
On polyhedra induced by point sets in space.
Discrete Applied Mathematics 156(1): 42-54 (2008) |
| 2007 |
|---|
| 233 | | Andrew Danner,
Thomas Mølhave,
Ke Yi,
Pankaj K. Agarwal,
Lars Arge,
Helena Mitásová:
TerraStream: from elevation data to watershed hierarchies.
GIS 2007: 28 |
| 232 | | Pankaj K. Agarwal:
Modeling and Analyzing Massive Terrain Data Sets.
ISAAC 2007: 1 |
| 231 | | Paul G. Flikkema,
Pankaj K. Agarwal,
James S. Clark,
Carla Schlatter Ellis,
Alan Gelfand,
Kamesh Munagala,
Jun Yang:
From Data Reverence to Data Relevance: Model-Mediated Wireless Sensing of the Physical Environment.
International Conference on Computational Science (1) 2007: 988-994 |
| 230 | | Pankaj K. Agarwal,
Hai Yu:
A space-optimal data-stream algorithm for coresets in the plane.
Symposium on Computational Geometry 2007: 1-10 |
| 229 | | Pankaj K. Agarwal,
Roel Apfelbaum,
George B. Purdy,
Micha Sharir:
Similar simplices in a d-dimensional point set.
Symposium on Computational Geometry 2007: 232-238 |
| 228 | | Pankaj K. Agarwal,
Haim Kaplan,
Micha Sharir:
Computing the volume of the union of cubes.
Symposium on Computational Geometry 2007: 294-301 |
| 227 | | Pankaj K. Agarwal,
Sariel Har-Peled,
Hai Yu:
Embeddings of surfaces, curves, and moving points in euclidean space.
Symposium on Computational Geometry 2007: 381-389 |
| 226 | | Sathish Govindarajan,
Michael C. Dietze,
Pankaj K. Agarwal,
James S. Clark:
A scalable algorithm for dispersing population.
J. Intell. Inf. Syst. 29(1): 39-61 (2007) |
| 225 | | Pankaj K. Agarwal,
Nabil H. Mustafa,
Yusu Wang:
Fast Molecular Shape Matching Using Contact Maps.
Journal of Computational Biology 14(2): 131-143 (2007) |
| 224 | | Yunhui Zheng,
David J. Brady,
Pankaj K. Agarwal:
Localization using boundary sensors: An analysis based on graph theory.
TOSN 3(4): (2007) |
| 2006 |
|---|
| 223 | | Jeff M. Phillips,
Pankaj K. Agarwal:
On Bipartite Matching under the RMS Distance.
CCCG 2006 |
| 222 | | Mohammad Ali Abam,
Pankaj K. Agarwal,
Mark de Berg,
Hai Yu:
Out-of-Order Event Processing in Kinetic Data Structures.
ESA 2006: 624-635 |
| 221 | | Pankaj K. Agarwal,
Sergio Cabello,
Joan Antoni Sellarès,
Micha Sharir:
Computing a Center-Transversal Line.
FSTTCS 2006: 93-104 |
| 220 | | Paul G. Flikkema,
Pankaj K. Agarwal,
James S. Clark,
Carla Schlatter Ellis,
Alan Gelfand,
Kamesh Munagala,
Jun Yang:
Model-Driven Dynamic Control of Embedded Wireless Sensor Networks.
International Conference on Computational Science (3) 2006: 409-416 |
| 219 | | Pankaj K. Agarwal,
Sariel Har-Peled,
Hai Yu:
Robust shape fitting via peeling and grating coresets.
SODA 2006: 182-191 |
| 218 | | Pankaj K. Agarwal,
Lars Arge,
Ke Yi:
I/O-efficient batched union-find and its applications to terrain analysis.
Symposium on Computational Geometry 2006: 167-176 |
| 217 | | Pankaj K. Agarwal,
Junyi Xie,
Jun Yang,
Hai Yu:
Scalable Continuous Query Processing by Tracking Hotspots.
VLDB 2006: 31-42 |
| 216 | | Jeff M. Phillips,
Johannes Rudolph,
Pankaj K. Agarwal:
Segmenting Motifs in Protein-Protein Interface Surfaces.
WABI 2006: 207-218 |
| 215 | | Pankaj K. Agarwal,
Boris Aronov,
Vladlen Koltun:
Efficient algorithms for bichromatic separability.
ACM Transactions on Algorithms 2(2): 209-227 (2006) |
| 214 | | Pankaj K. Agarwal,
Nabil H. Mustafa:
Independent set of intersection graphs of convex objects in 2D.
Comput. Geom. 34(2): 83-95 (2006) |
| 213 | | Pankaj K. Agarwal,
Herbert Edelsbrunner,
John Harer,
Yusu Wang:
Extreme Elevation on a 2-Manifold.
Discrete & Computational Geometry 36(4): 553-572 (2006) |
| 212 | | Pankaj K. Agarwal,
Yusu Wang,
Hai Yu:
A Two-Dimensional Kinetic Triangulation with Near-Quadratic Topological Changes.
Discrete & Computational Geometry 36(4): 573-592 (2006) |
| 211 | | Yonatan Bilu,
Pankaj K. Agarwal,
Rachel Kolodny:
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons.
IEEE/ACM Trans. Comput. Biology Bioinform. 3(4): 408-422 (2006) |
| 210 | | Pankaj K. Agarwal,
Mark H. Overmars,
Micha Sharir:
Computing Maximally Separated Sets in the Plane.
SIAM J. Comput. 36(3): 815-834 (2006) |
| 209 | | Pankaj K. Agarwal,
David J. Brady,
Jirí Matousek:
Segmenting object space by geometric reference structures.
TOSN 2(4): 455-465 (2006) |
| 2005 |
|---|
| 208 | | Pankaj K. Agarwal,
Mark de Berg,
Jie Gao,
Leonidas J. Guibas,
Sariel Har-Peled:
Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points.
CCCG 2005: 43-46 |
| 207 | | Pankaj K. Agarwal,
Lars Arge,
Ke Yi:
I/O-Efficient Construction of Constrained Delaunay Triangulations.
ESA 2005: 355-366 |
| 206 | | Pankaj K. Agarwal,
Junyi Xie,
Jun Yang,
Hai Yu:
Monitoring Continuous Band-Join Queries over Dynamic Data.
ISAAC 2005: 349-359 |
| 205 | | Yusu Wang,
Pankaj K. Agarwal,
P. Brown,
Herbert Edelsbrunner,
Johannes Rudolph:
Coarse and Reliable Geometric Alignment for Protein Docking.
Pacific Symposium on Biocomputing 2005: 66-77 |
| 204 | | Pankaj K. Agarwal,
Yusu Wang,
Peng Yin:
Lower bound for sparse Euclidean spanners.
SODA 2005: 670-671 |
| 203 | | Pankaj K. Agarwal,
Lars Arge,
Ke Yi:
An optimal dynamic interval stabbing-max data structure?
SODA 2005: 803-812 |
| 202 | | Pankaj K. Agarwal,
Sergey Bereg,
Ovidiu Daescu,
Haim Kaplan,
Simeon C. Ntafos,
Binhai Zhu:
Guarding a terrain by two watchtowers.
Symposium on Computational Geometry 2005: 346-355 |
| 201 | | Pankaj K. Agarwal,
Yonatan Bilu,
Rachel Kolodny:
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons.
WABI 2005: 315-327 |
| 200 | | Pankaj K. Agarwal,
Sariel Har-Peled,
Nabil H. Mustafa,
Yusu Wang:
Near-Linear Time Approximation Algorithms for Curve Simplification.
Algorithmica 42(3-4): 203-219 (2005) |
| 199 | | Pankaj K. Agarwal,
Cecilia Magdalena Procopiuc,
Kasturi R. Varadarajan:
Approximation Algorithms for a k-Line Center.
Algorithmica 42(3-4): 221-230 (2005) |
| 198 | | Pankaj K. Agarwal,
Robert-Paul Berretty,
Anne D. Collins:
A Near-Quadratic Algorithm for Fence Design.
Discrete & Computational Geometry 33(3): 463-481 (2005) |
| 197 | | Pankaj K. Agarwal,
Boris Aronov,
Vladlen Koltun,
Micha Sharir:
Lines Avoiding Unit Balls in Three Dimensions.
Discrete & Computational Geometry 34(2): 231-250 (2005) |
| 196 | | Pankaj K. Agarwal,
Micha Sharir:
Pseudo-Line Arrangements: Duality, Algorithms, and Applications.
SIAM J. Comput. 34(3): 526-552 (2005) |
| 2004 |
|---|
| 195 | | Pankaj K. Agarwal,
Lars Arge,
Jeff Erickson,
Hai Yu:
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects.
ESA 2004: 4-15 |
| 194 | | Pankaj K. Agarwal,
Nabil H. Mustafa:
k-Means Projective Clustering.
PODS 2004: 155-165 |
| 193 | | 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 |
| 192 | | Pankaj K. Agarwal,
Boris Aronov,
Vladlen Koltun:
Efficient algorithms for bichromatic separability.
SODA 2004: 682-690 |
| 191 | | Pankaj K. Agarwal,
Nabil H. Mustafa:
Independent Set of Intersection Graphs of Convex Objects in 2D.
SWAT 2004: 127-137 |
| 190 | | Sathish Govindarajan,
Mike Dietze,
Pankaj K. Agarwal,
James S. Clark:
A scalable simulator for forest dynamics.
Symposium on Computational Geometry 2004: 106-115 |
| 189 | | Pankaj K. Agarwal,
Yusu Wang,
Hai Yu:
A 2D kinetic triangulation with near-quadratic topological changes.
Symposium on Computational Geometry 2004: 180-189 |
| 188 | | Pankaj K. Agarwal,
Kasturi R. Varadarajan:
A near-linear constant-factor approximation for euclidean bipartite matching?
Symposium on Computational Geometry 2004: 247-252 |
| 187 | | Hai Yu,
Pankaj K. Agarwal,
Raghunath Poreddy,
Kasturi R. Varadarajan:
Practical methods for shape fitting and kinetic data structures using core sets.
Symposium on Computational Geometry 2004: 263-272 |
| 186 | | Pankaj K. Agarwal,
Herbert Edelsbrunner,
John Harer,
Yusu Wang:
Extreme elevation on a 2-manifold.
Symposium on Computational Geometry 2004: 357-365 |
| 185 | | Pankaj K. Agarwal,
Boris Aronov,
Vladlen Koltun,
Micha Sharir:
On lines avoiding unit balls in three dimensions.
Symposium on Computational Geometry 2004: 36-45 |
| 184 | | Pankaj K. Agarwal,
Micha Sharir,
Emo Welzl:
Algorithms for center and Tverberg points.
Symposium on Computational Geometry 2004: 61-67 |
| 183 | | Vicky Choi,
Pankaj K. Agarwal,
Herbert Edelsbrunner,
Johannes Rudolph:
Local Search Heuristic for Rigid Protein Docking.
WABI 2004: 218-229 |
| 182 | | Pankaj K. Agarwal,
Leonidas J. Guibas,
An Thai Nguyen,
Daniel Russel,
Li Zhang:
Collision detection for deforming necklaces.
Comput. Geom. 28(2-3): 137-163 (2004) |
| 181 | | Pankaj K. Agarwal,
Herbert Edelsbrunner,
Yusu Wang:
Computing the Writhing Number of a Polygonal Knot.
Discrete & Computational Geometry 32(1): 37-53 (2004) |
| 180 | | 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) |
| 179 | | Pankaj K. Agarwal,
Sariel Har-Peled,
Kasturi R. Varadarajan:
Approximating extent measures of points.
J. ACM 51(4): 606-635 (2004) |
| 2003 |
|---|
| 178 | | Pankaj K. Agarwal,
Shankar Krishnan,
Nabil H. Mustafa,
Suresh Venkatasubramanian:
Streaming Geometric Optimization Using Graphics Hardware.
ESA 2003: 544-555 |
| 177 | | 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 |
| 176 | | Sathish Govindarajan,
Pankaj K. Agarwal,
Lars Arge:
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries.
ICDT 2003: 143-157 |
| 175 |  | Anne D. Collins,
Pankaj K. Agarwal,
John Harer:
HPRM: a hierarchical PRM.
ICRA 2003: 4433-4438 |
| 174 | | Octavian Procopiuc,
Pankaj K. Agarwal,
Lars Arge,
Jeffrey Scott Vitter:
Bkd-Tree: A Dznamic Scalable kd-Tree.
SSTD 2003: 46-65 |
| 173 | | 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 |
| 172 | | 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 |
| 171 | | Pankaj K. Agarwal,
Cecilia Magdalena Procopiuc,
Kasturi R. Varadarajan:
A (1+)-approximation algorithm for 2-line-center.
Comput. Geom. 26(2): 119-128 (2003) |
| 170 | | Pankaj K. Agarwal,
Cecilia Magdalena Procopiuc:
Approximation algorithms for projective clustering.
J. Algorithms 46(2): 115-139 (2003) |
| 169 | | Pankaj K. Agarwal,
Lars Arge,
Jeff Erickson:
Indexing Moving Points.
J. Comput. Syst. Sci. 66(1): 207-243 (2003) |
| 2002 |
|---|
| 168 | | Cecilia Magdalena Procopiuc,
Pankaj K. Agarwal,
Sariel Har-Peled:
STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects.
ALENEX 2002: 178-193 |
| 167 | | James S. Clark,
Pankaj K. Agarwal,
Michael Lavin:
Computation and Uncertainty in Ecological Forecasting.
DG.O 2002 |
| 166 | | Pankaj K. Agarwal,
Sathish Govindarajan,
S. Muthukrishnan:
Range Searching in Categorical Data: Colored Range Searching on Grid.
ESA 2002: 17-28 |
| 165 | | Pankaj K. Agarwal,
Sariel Har-Peled,
Nabil H. Mustafa,
Yusu Wang:
Near-Linear Time Approximation Algorithms for Curve Simplification.
ESA 2002: 29-41 |
| 164 | | 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 |
| 163 | | Pankaj K. Agarwal,
Jie Gao,
Leonidas J. Guibas:
Kinetic Medians and kd-Trees.
ESA 2002: 5-16 |
| 162 | | Pankaj K. Agarwal,
Cecilia Magdalena Procopiuc,
Kasturi R. Varadarajan:
Approximation Algorithms for k-Line Center.
ESA 2002: 54-63 |
| 161 | | Cecilia Magdalena Procopiuc,
Michael Jones,
Pankaj K. Agarwal,
T. M. Murali:
A Monte Carlo algorithm for fast projective clustering.
SIGMOD Conference 2002: 418-427 |
| 160 | | Pankaj K. Agarwal,
Herbert Edelsbrunner,
Yusu Wang:
Computing the writhing number of a polygonal knot.
SODA 2002: 791-799 |
| 159 | | Pankaj K. Agarwal,
Micha Sharir:
Pseudo-line arrangements: duality, algorithms, and applications.
SODA 2002: 800-809 |
| 158 | | 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 C. 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) |
| 157 | | Pankaj K. Agarwal,
Binay K. Bhattacharya,
Sandeep Sen:
Improved Algorithms for Uniform Partitions of Points.
Algorithmica 32(4): 521-539 (2002) |
| 156 | | Pankaj K. Agarwal,
Cecilia Magdalena Procopiuc:
Exact and Approximation Algorithms for Clustering.
Algorithmica 33(2): 201-226 (2002) |
| 155 | | Pankaj K. Agarwal,
Sariel Har-Peled,
Meetesh Karia:
Computing Approximate Shortest Paths on Convex Polytopes.
Algorithmica 33(2): 227-242 (2002) |
| 154 | | Pankaj K. Agarwal,
Eyal Flato,
Dan Halperin:
Polygon decomposition for efficient construction of Minkowski sums.
Comput. Geom. 21(1-2): 39-61 (2002) |
| 153 | | 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) |
| 152 | | 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) |
| 151 | | 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) |
| 150 | | Pankaj K. Agarwal,
Cecilia Magdalena Procopiuc:
Advances in Indexing for Mobile Objects.
IEEE Data Eng. Bull. 25(2): 25-34 (2002) |
| 149 | | 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) |
| 2001 |
|---|
| 148 | | Pankaj K. Agarwal,
Boris Aronov,
Micha Sharir:
On the Complexity of Many Faces in Arrangements of Circles.
FOCS 2001: 74-83 |
| 147 | | Pankaj K. Agarwal,
Lars Arge,
Octavian Procopiuc,
Jeffrey Scott Vitter:
A Framework for Index Bulk Loading and Dynamization.
ICALP 2001: 115-127 |
| 146 | | Pankaj K. Agarwal,
Anne D. Collins,
John Harer:
Minimal Trap Design.
ICRA 2001: 2243-2248 |
| 145 | | Pankaj K. Agarwal,
Sariel Har-Peled:
Maintaining approximate extent measures of moving points.
SODA 2001: 148-157 |
| 144 | | Pankaj K. Agarwal,
Micha Sharir:
On the number of congruent simplices in a point.
Symposium on Computational Geometry 2001: 1-9 |
| 143 | | 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 |
| 142 | | 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 |
| 141 | | Pankaj K. Agarwal,
Lars Arge,
Jan Vahrenhold:
Time Responsive External Data Structures for Moving Points.
WADS 2001: 50-61 |
| 140 | | Pankaj K. Agarwal,
Dan Halperin,
Richard Pollack:
Guest Editors' Foreword.
Discrete & Computational Geometry 25(4): 505-506 (2001) |
| 139 | | Pankaj K. Agarwal:
Guest Editor's Foreword.
Discrete & Computational Geometry 26(2): 185-186 (2001) |
| 138 | | Pankaj K. Agarwal,
Boris Aronov,
Micha Sharir:
Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells.
Discrete & Computational Geometry 26(3): 307-320 (2001) |
| 137 | | 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) |
| 2000 |
|---|
| 136 | | Pankaj K. Agarwal,
Eyal Flato,
Dan Halperin:
Polygon Decomposition for Efficient Construction of Minkowski Sums.
ESA 2000: 20-31 |
| 135 | | Pankaj K. Agarwal,
Lars Arge,
Jeff Erickson:
Indexing Moving Points.
PODS 2000: 175-186 |
| 134 | | Pankaj K. Agarwal,
Boris Aronov,
Micha Sharir:
Exact and approximation algorithms for minimum-width cylindrical shells.
SODA 2000: 510-517 |
| 133 | | Pankaj K. Agarwal,
Pavan K. Desikan:
Approximation algorithms for layered manufacturing.
SODA 2000: 528-537 |
| 132 | | Pankaj K. Agarwal,
Cecilia Magdalena Procopiuc:
Approximation algorithms for projective clustering.
SODA 2000: 538-547 |
| 131 | | 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 |
| 130 | | Pankaj K. Agarwal,
Sariel Har-Peled,
Meetesh Karia:
Computing approximate shortest paths on convex polytopes.
Symposium on Computational Geometry 2000: 270-279 |
| 129 | | 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) |
| 128 | | Pankaj K. Agarwal,
Kasturi R. Varadarajan:
Efficient Algorithms for Approximating Polygonal Chains.
Discrete & Computational Geometry 23(2): 273-291 (2000) |
| 127 | | 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) |
| 126 | | 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) |
| 125 | | 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) |
| 124 | | 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) |
| 123 | | 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) |
| 122 | | 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) |
| 121 | | Kasturi R. Varadarajan,
Pankaj K. Agarwal:
Approximating Shortest Paths on a Nonconvex Polyhedron.
SIAM J. Comput. 30(4): 1321-1340 (2000) |
| 120 | | Pankaj K. Agarwal,
Hongyan Wang:
Approximation Algorithms for Curvature-Constrained Shortest Paths.
SIAM J. Comput. 30(6): 1739-1772 (2000) |
| 1999 |
|---|
| 119 | | Pankaj K. Agarwal,
Binay K. Bhattacharya,
Sandeep Sen:
Output-Sensitive Algorithms for Uniform Partitions of Points.
ISAAC 1999: 403-414 |
| 118 | | 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 |
| 117 | | Pankaj K. Agarwal,
Micha Sharir:
Motion Planning of a Ball Amid Segments in Three Dimensions.
SODA 1999: 21-30 |
| 116 | | Kasturi R. Varadarajan,
Pankaj K. Agarwal:
Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane.
SODA 1999: 805-814 |
| 115 | | Pankaj K. Agarwal,
Micha Sharir:
Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions.
Symposium on Computational Geometry 1999: 143-153 |
| 114 | | 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 |
| 113 | | 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 |
| 112 | | Marshall W. Bern,
David Eppstein,
Pankaj K. Agarwal,
Nina Amenta,
L. Paul Chew,
Tamal K. Dey,
David P. Dobkin,
Herbert Edelsbrunner,
Cindy Grimm,
Leonidas J. Guibas,
John Harer,
Joel Hass,
Andrew Hicks,
Carroll K. Johnson,
Gilad Lerman,
David Letscher,
Paul E. Plassmann,
Eric Sedgwick,
Jack Snoeyink,
Jeff Weeks,
Chee-Keng Yap,
Denis Zorin:
Emerging Challenges in Computational Topology
CoRR cs.CG/9909001: (1999) |
| 111 | | 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) |
| 110 | | 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) |
| 109 | | Pankaj K. Agarwal:
Guest Editor's Foreword.
Int. J. Comput. Geometry Appl. 9(4/5): 325- (1999) |
| 108 | | Samir Khuller,
Pankaj K. Agarwal,
Joseph O'Rourke:
Open Problems Presented at SCG'98.
J. Algorithms 30(2): 449-453 (1999) |
| 107 | | 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) |
| 1998 |
|---|
| 106 | | T. M. Murali,
Pankaj K. Agarwal,
Jeffrey Scott Vitter:
Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice.
ESA 1998: 211-222 |
| 105 | | Pankaj K. Agarwal,
David Eppstein,
Leonidas J. Guibas,
Monika Rauch Henzinger:
Parametric and Kinetic Minimum Spanning Trees.
FOCS 1998: 596-605 |
| 104 | | Pankaj K. Agarwal,
Lars Arge,
Jeff Erickson,
Paolo Giulio Franciosa,
Jeffrey Scott Vitter:
Efficient Searching with Linear Constraints.
PODS 1998: 169-178 |
| 103 | | Pankaj K. Agarwal,
Jeff Erickson,
Leonidas J. Guibas:
Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract).
SODA 1998: 107-116 |
| 102 | | 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 |
| 101 | | Pankaj K. Agarwal,
Cecilia Magdalena Procopiuc:
Exact and Approximation Algorithms for Clustering (Extended Abstract).
SODA 1998: 658-667 |
| 100 | | 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 |
| 99 | | Pankaj K. Agarwal,
Micha Sharir:
Efficient Algorithms for Geometric Optimization.
ACM Comput. Surv. 30(4): 412-458 (1998) |
| 98 | | Pankaj K. Agarwal,
Joseph O'Rourke:
Computational Geometry Column 34
CoRR cs.CG/9808008: (1998) |
| 97 | | 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) |
| 96 | | Pankaj K. Agarwal,
Nina Amenta,
Micha Sharir:
Largest Placement of One Convex Polygon Inside Another.
Discrete & Computational Geometry 19(1): 95-104 (1998) |
| 95 | | 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) |
| 94 | | Pankaj K. Agarwal,
Micha Sharir,
Emo Welzl:
The Discrete 2-Center Problem.
Discrete & Computational Geometry 20(3): 287-305 (1998) |
| 93 | | Pankaj K. Agarwal,
Joseph O'Rourke:
Computational Geometry Column 34.
Int. J. Comput. Geometry Appl. 8(5/6): 637- (1998) |
| 92 | | Pankaj K. Agarwal,
Jirí Matousek,
Otfried Schwarzkopf:
Computing Many Faces in Arrangements of Lines and Segments.
SIAM J. Comput. 27(2): 491-505 (1998) |
| 91 | | 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) |
| 90 | | Pankaj K. Agarwal,
Subhash Suri:
Surface Approximation and Geometric Partitions.
SIAM J. Comput. 27(4): 1016-1035 (1998) |
| 1997 |
|---|
| 89 | | Pankaj K. Agarwal,
Marc J. van Kreveld,
Subhash Suri:
Label placement by maximum independent set in rectangles.
CCCG 1997 |
| 88 | | Kasturi R. Varadarajan,
Pankaj K. Agarwal:
Approximating Shortest Paths on an Nonconvex Polyhedron.
FOCS 1997: 182-191 |
| 87 | | Pankaj K. Agarwal,
Pavan K. Desikan:
An Efficient Algorithm for Terraine Simplification.
SODA 1997: 139-147 |
| 86 | | Pankaj K. Agarwal,
Boris Aronov,
Micha Sharir:
Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions.
SODA 1997: 483-492 |
| 85 | | Pankaj K. Agarwal,
Micha Sharir,
Emo Welzl:
The Discrete 2-Center Problem.
Symposium on Computational Geometry 1997: 147-155 |
| 84 | | Pankaj K. Agarwal,
Boris Aronov,
Micha Sharir:
On Levels in Arrangements of Lines, Segments, Planes, and Triangles.
Symposium on Computational Geometry 1997: 30-38 |
| 83 | | 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 |
| 82 | | 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 |
| 81 | | Pankaj K. Agarwal,
Leonidas J. Guibas,
John Hershberger,
Eric Veach:
Maintaining the Extent of a Moving Point Set.
WADS 1997: 31-44 |
| 80 | | 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) |
| 79 | | Kasturi R. Varadarajan,
Pankaj K. Agarwal:
Linear Approximation of Simple Objects.
Inf. Process. Lett. 62(2): 89-94 (1997) |
| 78 | | 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) |
| 77 | | 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) |
| 76 | | Pankaj K. Agarwal,
Boris Aronov,
Micha Sharir:
Computing Envelopes in Four Dimensions with Applications.
SIAM J. Comput. 26(6): 1714-1732 (1997) |
| 1996 |
|---|
| 75 | | Pankaj K. Agarwal,
Edward F. Grove,
T. M. Murali,
Jeffrey Scott Vitter:
Binary Search Partitions for Fat Rectangles.
FOCS 1996: 482-491 |
| 74 | | 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 |
| 73 | | Pankaj K. Agarwal,
Mark de Berg,
Dan Halperin,
Micha Sharir:
Efficient Generation of k-Directional Assembly Sequences.
SODA 1996: 122-131 |
| 72 | | Hongyan Wang,
Pankaj K. Agarwal:
Approximation Algorithms for Curvature-Constrained Shortest Paths.
SODA 1996: 409-418 |
| 71 | | Pankaj K. Agarwal,
Subhash Suri:
Simple and Practical Geometric Algorithms.
ACM Comput. Surv. 28(4es): 16 (1996) |
| 70 | | Pankaj K. Agarwal,
Marc J. van Kreveld:
Connected Component and Simple Polygon Intersection Searching.
Algorithmica 15(6): 626-660 (1996) |
| 69 | | Pankaj K. Agarwal,
Otfried Schwarzkopf,
Micha Sharir:
The Overlay of Lower Envelopes and Its Applications.
Discrete & Computational Geometry 15(1): 1-13 (1996) |
| 68 | | Pankaj K. Agarwal,
Micha Sharir:
Efficient Randomized Algorithms for Some Geometric. Optimization Problems.
Discrete & Computational Geometry 16(4): 317-337 (1996) |
| 67 | | Pankaj K. Agarwal,
Sandeep Sen:
Selection in Monotone Matrices and Computing kth Nearest Neighbors.
J. Algorithms 20(3): 581-601 (1996) |
| 66 | | Pankaj K. Agarwal,
Micha Sharir:
Ray Shooting Amidst Convex Polygons in 2D.
J. Algorithms 21(3): 508-519 (1996) |
| 65 | | Pankaj K. Agarwal,
Micha Sharir:
Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions.
SIAM J. Comput. 25(1): 100-116 (1996) |
| 1995 |
|---|
| 64 | | 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 |
| 63 | | Pankaj K. Agarwal,
Prabhakar Raghavan,
Hisao Tamaki:
Motion planning for a steering-constrained robot through moderate obstacles.
STOC 1995: 343-352 |
| 62 | | 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 |
| 61 | | Pankaj K. Agarwal,
Boris Aronov,
Subhash Suri:
Stabbing Triangulations by Lines in 3D.
Symposium on Computational Geometry 1995: 267-276 |
| 60 | | Pankaj K. Agarwal,
Micha Sharir:
Efficient Randomized Algorithms for Some Geometric Optimization Problems.
Symposium on Computational Geometry 1995: 326-335 |
| 59 | | 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 |
| 58 | | Pankaj K. Agarwal,
Micha Sharir:
Algorithmic Techniques for Geometric Optimization.
Computer Science Today 1995: 234-253 |
| 57 | | Pankaj K. Agarwal,
Jirí Matousek:
Dynamic Half-Space Range Reporting and Its Applications.
Algorithmica 13(4): 325-345 (1995) |
| 56 | | Pankaj K. Agarwal,
Matthew J. Katz,
Micha Sharir:
Computing Depth Orders for Fat Objects and Related Problems.
Comput. Geom. 5: 187-206 (1995) |
| 1994 |
|---|
| 55 | | Pankaj K. Agarwal,
Subhash Suri:
Surface Approximation and Geometric Partitions.
SODA 1994: 24-33 |
| 54 | | Pankaj K. Agarwal,
Matthew J. Katz,
Micha Sharir:
Computing Depth Orders and Related Problems.
SWAT 1994: 1-12 |
| 53 | | Pankaj K. Agarwal,
Sandeep Sen:
Selection in Monotone Matrices and Computing kth Nearest Neighbors.
SWAT 1994: 13-24 |
| 52 | | Pankaj K. Agarwal,
Boris Aronov,
Micha Sharir:
Computing Envelopes in Four Dimensions with Applications.
Symposium on Computational Geometry 1994: 348-358 |
| 51 | | 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 |
| 50 | | Pankaj K. Agarwal,
Jirí Matousek,
Otfried Schwarzkopf:
Computing Many Faces in Arrangements of Lines and Segments.
Symposium on Computational Geometry 1994: 76-84 |
| 49 | | Pankaj K. Agarwal,
Micha Sharir:
Planar Geometric Location Problems.
Algorithmica 11(2): 185-195 (1994) |
| 48 | | Pankaj K. Agarwal:
On Stabbling Lines for Convex Polyhedra in 3D.
Comput. Geom. 4: 177-189 (1994) |
| 47 | | Pankaj K. Agarwal,
Jirí Matousek:
On Range Searching with Semialgebraic Sets.
Discrete & Computational Geometry 11: 393-418 (1994) |
| 46 | | Pankaj K. Agarwal,
Micha Sharir:
On the Number of Views of Polyhedral Terrains.
Discrete & Computational Geometry 12: 177-182 (1994) |
| 45 | | Pankaj K. Agarwal,
Noga Alon,
Boris Aronov,
Subhash Suri:
Can Visibility Graphs Be Represented Compactly?.
Discrete & Computational Geometry 12: 347-365 (1994) |
| 44 | | 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) |
| 43 | | Pankaj K. Agarwal,
Micha Sharir,
Sivan Toledo:
Applications of Parametric Searching in Geometric Optimization.
J. Algorithms 17(3): 292-318 (1994) |
| 1993 |
|---|
| 42 | | Pankaj K. Agarwal,
Micha Sharir:
On the Number of Views of Polyhedral Terrains.
CCCG 1993: 55-60 |
| 41 | | Pankaj K. Agarwal,
Micha Sharir:
Ray Shooting Amidst Convex Polytopes in Three Dimensions.
SODA 1993: 260-270 |
| 40 | | Pankaj K. Agarwal,
Noga Alon,
Boris Aronov,
Subhash Suri:
Can Visibility Graphs be Represented Compactly?
Symposium on Computational Geometry 1993: 338-347 |
| 39 | | Pankaj K. Agarwal,
Marc J. van Kreveld:
Connected Component and Simple Polygon Intersection Searching (Extended Abstract).
WADS 1993: 36-47 |
| 38 | | Pankaj K. Agarwal,
Boris Aronov,
Micha Sharir,
Subhash Suri:
Selecting Distances in the Plane.
Algorithmica 9(5): 495-514 (1993) |
| 37 | | Pankaj K. Agarwal,
Micha Sharir:
Applications of a New Space-Partitioning Technique.
Discrete & Computational Geometry 9: 11-38 (1993) |
| 36 | | 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) |
| 35 | | Pankaj K. Agarwal,
Micha Sharir:
Circle Shooting in a Simple Polygon.
J. Algorithms 14(1): 69-87 (1993) |
| 34 | | Pankaj K. Agarwal,
Marc J. van Kreveld,
Mark H. Overmars:
Intersection Queries in Curved Objects.
J. Algorithms 15(2): 229-266 (1993) |
| 33 | | 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) |
| 32 | | Pankaj K. Agarwal,
Marco Pellegrini,
Micha Sharir:
Counting Circular Arc Intersections.
SIAM J. Comput. 22(4): 778-793 (1993) |
| 31 | | Pankaj K. Agarwal,
Jirí Matousek:
Ray Shooting and Parametric Search.
SIAM J. Comput. 22(4): 794-806 (1993) |
| 1992 |
|---|
| 30 | | Pankaj K. Agarwal,
David Eppstein,
Jirí Matousek:
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees
FOCS 1992: 80-89 |
| 29 | | 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 |
| 28 | | Pankaj K. Agarwal,
Jirí Matousek:
On Range Searching with Semialgebraic Sets.
MFCS 1992: 1-13 |
| 27 | | Pankaj K. Agarwal,
Jirí Matousek:
Relative Neighborhood Graphs in Three Dimensions.
SODA 1992: 58-65 |
| 26 | | Pankaj K. Agarwal,
Micha Sharir,
Sivan Toledo:
Applications of Parametric Searching in Geometric Optimization.
SODA 1992: 72-82 |
| 25 | | Pankaj K. Agarwal,
Jirí Matousek:
Ray Shooting and Parametric Search
STOC 1992: 517-526 |
| 24 | | Marc J. van Kreveld,
Mark H. Overmars,
Pankaj K. Agarwal:
Intersection Queries in Sets of Disks.
BIT 32(2): 268-279 (1992) |
| 23 | | Pankaj K. Agarwal,
Jirí Matousek:
Relative Neighborhood Graphs in Three Dimensions.
Comput. Geom. 2: 1-14 (1992) |
| 22 | | Pankaj K. Agarwal,
Boris Aronov:
Counting Facets and Incidences.
Discrete & Computational Geometry 7: 359-369 (1992) |
| 21 | | Pankaj K. Agarwal:
Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number.
SIAM J. Comput. 21(3): 540-570 (1992) |
| 1991 |
|---|
| 20 | | Pankaj K. Agarwal,
Micha Sharir:
Planar Geometric Location Problems and Maintaining the Width of a Planar Set.
SODA 1991: 449-458 |
| 19 | | Pankaj K. Agarwal,
Micha Sharir:
Counting Circular Arc Intersections.
Symposium on Computational Geometry 1991: 10-20 |
| 18 | | Pankaj K. Agarwal,
Marc J. van Kreveld,
Mark H. Overmars:
Intersection Queries for Curved Objects (Extended Abstract).
Symposium on Computational Geometry 1991: 41-50 |
| 17 | | Pankaj K. Agarwal,
Jirí Matousek,
Subhash Suri:
Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions.
WADS 1991: 105-116 |
| 16 | | Pankaj K. Agarwal,
Micha Sharir:
Applications of a New Space Partitioning Technique.
WADS 1991: 379-391 |
| 15 | | Pankaj K. Agarwal,
Jirí Matousek,
Subhash Suri:
Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions.
Comput. Geom. 1: 189-201 (1991) |
| 14 | | Pankaj K. Agarwal,
Micha Sharir:
Off-line Dynamic Maintenance of the Width of a Planar Point Set.
Comput. Geom. 1: 65-78 (1991) |
| 13 | | Pankaj K. Agarwal,
Herbert Edelsbrunner,
Otfried Schwarzkopf:
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
Discrete & Computational Geometry 6: 407-422 (1991) |
| 12 | | Pankaj K. Agarwal,
Alok Aggarwal,
Boris Aronov,
S. Rao Kosaraju,
Baruch Schieber,
Subhash Suri:
Computing external farthest neighbors for a simple polygon.
Discrete Applied Mathematics 31(2): 97-111 (1991) |
| 1990 |
|---|
| 11 | | Pankaj K. Agarwal,
Boris Aronov,
Joseph O'Rourke,
Catherine A. Schevon:
Star Unfolding of a Polytope with Applications (Extended Abstract).
SWAT 1990: 251-263 |
| 10 | | Marc J. van Kreveld,
Mark H. Overmars,
Pankaj K. Agarwal:
Intersection Queries in Sets of Disks.
SWAT 1990: 393-403 |
| 9 | | Pankaj K. Agarwal,
Herbert Edelsbrunner,
Otfried Schwarzkopf,
Emo Welzl:
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
Symposium on Computational Geometry 1990: 203-210 |
| 8 | | Pankaj K. Agarwal,
Boris Aronov,
Micha Sharir,
Subhash Suri:
Selecting Distances in the Plane.
Symposium on Computational Geometry 1990: 321-331 |
| 7 | | Pankaj K. Agarwal:
Partitioning Arrangements of Lines I: An Efficient deterministic Algorithm.
Discrete & Computational Geometry 5: 449-483 (1990) |
| 6 | | Pankaj K. Agarwal:
Parititoning Arrangements of Lines II: Applications.
Discrete & Computational Geometry 5: 533-573 (1990) |
| 5 | | 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) |
| 1989 |
|---|
| 4 | | Pankaj K. Agarwal:
A Deterministic Algorithm for Partitioning Arrangements of Lines and Its Application.
Symposium on Computational Geometry 1989: 11-22 |
| 3 | | Pankaj K. Agarwal:
Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number.
Symposium on Computational Geometry 1989: 315-325 |
| 2 | | Pankaj K. Agarwal,
Micha Sharir,
Peter W. Shor:
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences.
J. Comb. Theory, Ser. A 52(2): 228-274 (1989) |
| 1988 |
|---|
| 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 |
