The following pages link to Pankaj K. Agarwal (Q359871):
Displaying 50 items.
- (Q224191) (redirect page) (← links)
- (Approximate) uncertain skylines (Q359874) (← links)
- Union of random Minkowski sums and network vulnerability analysis (Q471144) (← links)
- Out-of-order event processing in kinetic data structures (Q534768) (← links)
- Computing the writhing number of a polygonal knot (Q701774) (← links)
- Near-linear time approximation algorithms for curve simplification (Q818650) (← links)
- Approximation algorithms for a \(k\)-line center (Q818652) (← links)
- Extreme elevation on a 2-manifold (Q854709) (← links)
- A two-dimensional kinetic triangulation with near-quadratic topological changes (Q854710) (← links)
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions (Q908209) (← links)
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences (Q911595) (← links)
- Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- Practical methods for shape fitting and kinetic data structures using coresets (Q1006384) (← links)
- Computing external farthest neighbors for a simple polygon (Q1175781) (← links)
- Euclidean minimum spanning trees and bichromatic closest pairs (Q1176318) (← links)
- Counting facets and incidences (Q1189286) (← links)
- Off-line dynamic maintenance of the width of a planar point set (Q1190292) (← links)
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions (Q1194310) (← links)
- Oriented aligned rectangle packing problem (Q1196022) (← links)
- Applications of a new space-partitioning technique (Q1196362) (← links)
- Intersection queries in sets of disks (Q1196457) (← links)
- Relative neighborhood graphs in three dimensions (Q1200909) (← links)
- The discrete 2-center problem (Q1272957) (← links)
- Label placement by maximum independent set in rectangles (Q1276946) (← links)
- Line transversals of balls and smallest enclosing cylinders in three dimensions (Q1289240) (← links)
- Motion planning for a convex polygon in a polygonal environment (Q1302036) (← links)
- On range searching with semialgebraic sets (Q1329188) (← links)
- On stabbing lines for convex polyhedra in 3D (Q1334608) (← links)
- On the number of views of polyhedral terrains (Q1334930) (← links)
- Can visibility graphs be represented compactly? (Q1338961) (← links)
- Improved algorithms for uniform partitions of points (Q1348950) (← links)
- Quasi-planar graphs have a linear number of edges (Q1375051) (← links)
- Largest placement of one convex polygon inside another (Q1380791) (← links)
- Indexing moving points (Q1394801) (← links)
- A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center (Q1405006) (← links)
- Cylindrical static and kinetic binary space partitions (Q1577492) (← links)
- Pipes, cigars, and Kreplach: The union of Minkowski sums in three dimensions (Q1591054) (← links)
- Approximation algorithms for minimum-width annuli and shells (Q1591055) (← links)
- Lower bounds for kinetic planar subdivisions (Q1591059) (← links)
- Efficient searching with linear constraints (Q1591152) (← links)
- Exact and approximation algorithms for clustering (Q1601015) (← links)
- Computing approximate shortest paths on convex polytopes (Q1601017) (← links)
- Range-max queries on uncertain data (Q1745722) (← links)
- A near-quadratic algorithm for fence design (Q1773894) (← links)
- Efficient randomized algorithms for some geometric optimization problems (Q1816458) (← links)
- Box-trees and R-trees with near-optimal query time (Q1849440) (← links)
- Reporting intersecting pairs of convex polytopes in two and three dimensions (Q1862123) (← links)
- The number of congruent simplices in a point set (Q1864184) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
