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