#### Filter Results:

- Full text PDF available (184)

#### Publication Year

1963

2018

- This year (10)
- Last 5 years (66)
- Last 10 years (129)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

An (n; s) Davenport{Schinzel sequence, for positive integers n and s, is a sequence composed of n distinct symbols with the properties that no two adjacent elements are equal, and that it does notâ€¦ (More)

- Cecilia M. Procopiuc, Michael Jones, Pankaj K. Agarwal, T. M. Murali
- SIGMOD Conference
- 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â€¦ (More)

Handbook of Discrete and Computational Geometry About ten years ago, the eld of range searching, especially simplex range searching, was wide open. At that time, neither e cient algorithms norâ€¦ (More)

- Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan
- J. ACM
- 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â€¦ (More)

- Jonathan D. Cohen, Amitabh Varshney, +5 authors William V. Wright
- SIGGRAPH
- 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â€¦ (More)

- Pankaj K. Agarwal, JirÃ Matousek
- Discrete & Computational Geometry
- 1994

Let P be a set of n points in ~d (where d is a small fixed positive integer), and let F be a collection of subsets of ~d, each of which is defined by a constant number of bounded degree polynomialâ€¦ (More)

- Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri
- CCCG
- 1997

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)â€¦ (More)

- Pankaj K. Agarwal, Cecilia M. Procopiuc
- Algorithmica
- 1998

In this paper we present an n^ O(k 1-1/d ) -time algorithm for solving the k -center problem in \reals d , under L âˆˆ fty - and L 2 -metrics. The algorithm extends to other metrics, and to theâ€¦ (More)

- JÃ¡nos Pach, Pankaj K. Agarwal
- Wiley-Interscience series in discrete mathematicsâ€¦
- 1995

The paradigm of coresets has recently emerged as a powerful tool for efficiently approximating various extent measures of a point set P . Using this paradigm, one quickly computes a small subset Q ofâ€¦ (More)