Searching and storing similar lists

Research output: Contribution to journalArticlepeer-review


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 languageEnglish (US)
Pages (from-to)202-220
Number of pages19
JournalJournal of Algorithms
Issue number2
StatePublished - Jun 1986

ASJC Scopus subject areas

  • Control and Optimization
  • Computational Mathematics
  • Computational Theory and Mathematics


Dive into the research topics of 'Searching and storing similar lists'. Together they form a unique fingerprint.

Cite this