#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2008

2015

- This year (0)
- Last 5 years (4)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- David M. Mount, Eunhui Park
- Symposium on Computational Geometry
- 2010

In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a <i>quadtreap</i>. This data structure is a randomized, balanced variant of a quadtree data structure. In particular, it defines a hierarchical decomposition of space into cells, which are based on hyperrectangles of bounded aspect ratio,… (More)

- Minkyoung Cho, David M. Mount, Eunhui Park
- ISAAC
- 2009

The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point motion is continuous and predictable, but in practice, motion is typically presented incrementally in discrete time steps and may not be predictable. We consider the problem of… (More)

- Eunhui Park, David M. Mount
- ESA
- 2012

A data structure is said to be self-adjusting if it dynamically reorganizes itself to adapt to the pattern of accesses. Efficiency is typically measured in terms of amortized complexity, that is, the average running time of an access over an arbitrary sequence of accesses. The best known example of such a data structure is Sleator and Tarjan’s splay tree.… (More)

- Eunhui Park, David M. Mount
- SIGSPATIAL/GIS
- 2013

The well-separated pair decomposition (WSPD) is a fundamental structure in computational geometry. Given a set <i>P</i> of <i>n</i> points in <i>d</i>-dimensional space and a positive separation parameter <i>s</i>, an <i>s</i>-WSPD is a concise representation of all the <i>O</i>(<i>n</i><sup>2</sup>) pairs of <i>P</i> requiring only… (More)

- Sunil Arya, David M. Mount, Eunhui Park
- Symposium on Computational Geometry
- 2015

Range searching is a widely-used method in computational geometry for efficiently accessing local regions of a large data set. Typically, range searching involves either counting or reporting the points lying within a given query region, but it is often desirable to compute statistics that better describe the structure of the point set lying within the… (More)

- Eunhui Park, Kunsoo Park
- Fundam. Inform.
- 2008

- Eunhui Park
- 2013

Title of dissertation: DYNAMIC DATA STRUCTURES FOR GEOMETRIC SEARCH AND RETRIEVAL Eunhui Park, 2013 Dissertation directed by: Professor David M. Mount Department of Computer Science Data structures for geometric search and retrieval are of significant interest in areas such as computational geometry, computer graphics, and computer vision. The focus of this… (More)

- ‹
- 1
- ›