Abstract
We present an optimal data structure for storing a sequence of similar lists; it supports rapid searching of an arbitrary list. Applications include an optimal planar point location algorithm, more general than previous ones, a 3-dimensional point location algorithm, and a new representation scheme for polyhedra.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 202-220 |
| Number of pages | 19 |
| Journal | Journal of Algorithms |
| Volume | 7 |
| Issue number | 2 |
| DOIs | |
| State | Published - Jun 1986 |
ASJC Scopus subject areas
- Control and Optimization
- Computational Mathematics
- Computational Theory and Mathematics
Fingerprint Dive into the research topics of 'Searching and storing similar lists'. Together they form a unique fingerprint.
Cite this
Cole, R. (1986). Searching and storing similar lists. Journal of Algorithms, 7(2), 202-220. https://doi.org/10.1016/0196-6774(86)90004-0