Searching and storing similar lists

Research output: Contribution to journalArticle

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

Fingerprint

Point Location
Polyhedron
Data structures
Data Structures
Arbitrary

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computational Mathematics

Cite this

Searching and storing similar lists. / Cole, Richard.

In: Journal of Algorithms, Vol. 7, No. 2, 1986, p. 202-220.

Research output: Contribution to journalArticle

Cole, Richard. / Searching and storing similar lists. In: Journal of Algorithms. 1986 ; Vol. 7, No. 2. pp. 202-220.
@article{548bb8fe26a243bcbfaade58985d95ca,
title = "Searching and storing similar lists",
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.",
author = "Richard Cole",
year = "1986",
doi = "10.1016/0196-6774(86)90004-0",
language = "English (US)",
volume = "7",
pages = "202--220",
journal = "Journal of Algorithms",
issn = "0196-6774",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Searching and storing similar lists

AU - Cole, Richard

PY - 1986

Y1 - 1986

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38249039076&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38249039076&partnerID=8YFLogxK

U2 - 10.1016/0196-6774(86)90004-0

DO - 10.1016/0196-6774(86)90004-0

M3 - Article

VL - 7

SP - 202

EP - 220

JO - Journal of Algorithms

JF - Journal of Algorithms

SN - 0196-6774

IS - 2

ER -