TY - JOUR
T1 - Searching and storing similar lists
AU - Cole, Richard
N1 - Funding Information:
*This work was supported in part by NSF Grant DCR-84-01633 and by an IBM faculty development award.
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 -