Pankaj Kumar Agarwal

Duke Univ., Dept. of Computer Science
http://www.cs.duke.edu/~pankaj/
pankaj@cs.duke.edu

Author, editor, or reviewer of:

• A 2d kinetic triangulation with near-quadratic topological changes
• A near-quadratic algorithm for fence design
• Algorithmic techniqes for geometric optimization
• Algorithms for center and Tverberg points
• An efficient algorithm for terrain simplification
• Approximation algorithms for projective clustering
• Arrangements and their applications
• Combinatorial Geometry
• Cylindrical static and kinetic binary space partitions
• Davenport-Schinzel Sequences and their Geometric Applications
• Davenport-Schinzel sequences and their geometric applications{}
• Deformable free space tilings for kinetic collision detection
• Dynamic algorithms for half-space reporting, proximity problems, and geometric minimum spanning trees
• Dynamic half-space range reporting and its applications
• Efficient algorithms for bichromatic separability
• Efficient algorithms for geometric optimization
• I/O-efficient structures for orthogonal range-max and stabbing-max queries
• Maintaining the extent of a geometric point set
• On levels in arrangements of lines, segments, planes, and triangles
• Parametric and kinetic minimum spanning trees
• Polygon decomposition for efficient construction of Minkowski sums
• Range searching in categorical data: colored range searching on grid
• Selection in monotone matrices and computing $k$th nearest neighbors
• Simplification Envelopes
• Stabbing triangulations by lines in 3D
• Staying in the middle: exact and approximate medians in $R^1$ and $R^2$ for moving points
• The discrete 2-center problem
• Translating a planar object to maximize point containment
• Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications