Searching and storing similar lists

Richard Cole

doi:10.1016/0196-6774(86)90004-0

Searching and storing similar lists

Richard Cole

Computer Science

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1016/0196-6774(86)90004-0
State	Published - Jun 1986

ASJC Scopus subject areas

Control and Optimization
Computational Mathematics
Computational Theory and Mathematics

Access to Document

10.1016/0196-6774(86)90004-0

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

Cite this

@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",

month = jun,

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/6

Y1 - 1986/6

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

AN - SCOPUS:38249039076

VL - 7

SP - 202

EP - 220

JO - Journal of Algorithms

JF - Journal of Algorithms

SN - 0196-6774

IS - 2

ER -