Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Davenport-Schinzel sequences and their geometric applications

- M. Sharir, P. Agarwal
- Mathematics, Computer Science
- 26 May 1995

An $(n,s)$ Davenport--Schinzel sequence, for positive integers $n$ and $s$, is a sequence composed of $n$ symbols with the properties that no two adjacent elements are equal, and that it does not… Expand

A Monte Carlo algorithm for fast projective clustering

- C. Procopiuc, M. Jones, P. Agarwal, T. Murali
- Computer Science
- SIGMOD '02
- 3 June 2002

We propose a mathematical formulation for the notion of optimal projective cluster, starting from natural requirements on the density of points in subspaces. This allows us to develop a Monte Carlo… Expand

Approximating extent measures of points

- P. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan
- Mathematics, Computer Science
- JACM
- 1 July 2004

We present a general technique for approximating various descriptors of the extent of a set <i>P</i> of <i>n</i> points in R<sup><i>d</i></sup> when the dimension <i>d</i> is an arbitrary fixed… Expand

Geometric Range Searching and Its Relatives

- P. Agarwal, J. Erickson
- Computer Science
- 2007

About ten years ago, the eld of range searching, especially simplex range searching, was wide open. At that time, neither e cient algorithms nor nontrivial lower bounds were known for most… Expand

Wiley‐Interscience Series in Discrete Mathematics and Optimization

- J. Pach, P. Agarwal
- Mathematics
- 28 October 2011

On range searching with semialgebraic sets

- P. Agarwal, J. Matousek
- Computer Science, Mathematics
- Discret. Comput. Geom.
- 1 April 1994

LetP be a set ofn points in ℝd (whered is a small fixed positive integer), and let Γ be a collection of subsets of ℝd, each of which is defined by a constant number of bounded degree polynomial… Expand

Efficient algorithms for geometric optimization

- P. Agarwal, M. Sharir
- Computer Science
- CSUR
- 1 December 1998

We review the recent progress in the design of efficient algorithms for various problems in geometric optimization. We present several techniques used to attack these problems, such as parametric… Expand

Label placement by maximum independent set in rectangles

- P. Agarwal, M. V. Kreveld, S. Suri
- Computer Science, Mathematics
- CCCG
- 1 December 1998

Motivated by the problem of labeling maps, we investigate the problem of computing a large non-intersecting subset in a set of n rectangles in the plane. Our results are as follows. In O(n log n)… Expand

Simplification envelopes

- J. Cohen, A. Varshney, +5 authors W. Wright
- Computer Science
- SIGGRAPH '96
- 1 August 1996

We propose the idea of simplification envelopes for generating a hierarchy of level-of-detail approximations for a given polygonal model. Our approach guarantees that all points of an approximation… Expand