Lower bounds on the complexity of simplex range reporting on a pointer machine

Bernard Chazelle, Burton J Rosenberg

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

We give a lower bound on the following problem, known as simplex range reporting: Given a collection P of n points in d-space and an arbitrary simplex q, find all the points in P ⊂ q. It is understood that P is fixed and can be preprocessed ahead of time, while q is a query that must be answered on-line. We consider data structures for this problem that can be modeled on a pointer machine and whose query time is bounded by O(nε+r), where r is the number of points to be reported and δ is an arbitrary fixed real. We prove that any such data structure of that form must occupy storage Π(nd(l-δ)-e), for any fixed epsi > 0. This lower bound is tight within a factor of nε.

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 19th International Colloquium, Proceedings
EditorsWerner Kuich
PublisherSpringer Verlag
Pages439-449
Number of pages11
ISBN (Print)9783540557197
DOIs
StatePublished - Jan 1 1992
Externally publishedYes
Event19th International Colloquium on Automata, Languages, and Programming, ICALP 1992 - Wien, Austria
Duration: Jul 13 1992Jul 17 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume623 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other19th International Colloquium on Automata, Languages, and Programming, ICALP 1992
CountryAustria
CityWien
Period7/13/927/17/92

Fingerprint

Data structures
Lower bound
Data Structures
Range of data
Query
D-space
Arbitrary
Form

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chazelle, B., & Rosenberg, B. J. (1992). Lower bounds on the complexity of simplex range reporting on a pointer machine. In W. Kuich (Ed.), Automata, Languages and Programming - 19th International Colloquium, Proceedings (pp. 439-449). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 623 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-55719-9_95

Lower bounds on the complexity of simplex range reporting on a pointer machine. / Chazelle, Bernard; Rosenberg, Burton J.

Automata, Languages and Programming - 19th International Colloquium, Proceedings. ed. / Werner Kuich. Springer Verlag, 1992. p. 439-449 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 623 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chazelle, B & Rosenberg, BJ 1992, Lower bounds on the complexity of simplex range reporting on a pointer machine. in W Kuich (ed.), Automata, Languages and Programming - 19th International Colloquium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 623 LNCS, Springer Verlag, pp. 439-449, 19th International Colloquium on Automata, Languages, and Programming, ICALP 1992, Wien, Austria, 7/13/92. https://doi.org/10.1007/3-540-55719-9_95
Chazelle B, Rosenberg BJ. Lower bounds on the complexity of simplex range reporting on a pointer machine. In Kuich W, editor, Automata, Languages and Programming - 19th International Colloquium, Proceedings. Springer Verlag. 1992. p. 439-449. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-55719-9_95
Chazelle, Bernard ; Rosenberg, Burton J. / Lower bounds on the complexity of simplex range reporting on a pointer machine. Automata, Languages and Programming - 19th International Colloquium, Proceedings. editor / Werner Kuich. Springer Verlag, 1992. pp. 439-449 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a5b94a73771f40bfa5d487d842be72b4,
title = "Lower bounds on the complexity of simplex range reporting on a pointer machine",
abstract = "We give a lower bound on the following problem, known as simplex range reporting: Given a collection P of n points in d-space and an arbitrary simplex q, find all the points in P ⊂ q. It is understood that P is fixed and can be preprocessed ahead of time, while q is a query that must be answered on-line. We consider data structures for this problem that can be modeled on a pointer machine and whose query time is bounded by O(nε+r), where r is the number of points to be reported and δ is an arbitrary fixed real. We prove that any such data structure of that form must occupy storage Π(nd(l-δ)-e), for any fixed epsi > 0. This lower bound is tight within a factor of nε.",
author = "Bernard Chazelle and Rosenberg, {Burton J}",
year = "1992",
month = "1",
day = "1",
doi = "10.1007/3-540-55719-9_95",
language = "English (US)",
isbn = "9783540557197",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "439--449",
editor = "Werner Kuich",
booktitle = "Automata, Languages and Programming - 19th International Colloquium, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Lower bounds on the complexity of simplex range reporting on a pointer machine

AU - Chazelle, Bernard

AU - Rosenberg, Burton J

PY - 1992/1/1

Y1 - 1992/1/1

N2 - We give a lower bound on the following problem, known as simplex range reporting: Given a collection P of n points in d-space and an arbitrary simplex q, find all the points in P ⊂ q. It is understood that P is fixed and can be preprocessed ahead of time, while q is a query that must be answered on-line. We consider data structures for this problem that can be modeled on a pointer machine and whose query time is bounded by O(nε+r), where r is the number of points to be reported and δ is an arbitrary fixed real. We prove that any such data structure of that form must occupy storage Π(nd(l-δ)-e), for any fixed epsi > 0. This lower bound is tight within a factor of nε.

AB - We give a lower bound on the following problem, known as simplex range reporting: Given a collection P of n points in d-space and an arbitrary simplex q, find all the points in P ⊂ q. It is understood that P is fixed and can be preprocessed ahead of time, while q is a query that must be answered on-line. We consider data structures for this problem that can be modeled on a pointer machine and whose query time is bounded by O(nε+r), where r is the number of points to be reported and δ is an arbitrary fixed real. We prove that any such data structure of that form must occupy storage Π(nd(l-δ)-e), for any fixed epsi > 0. This lower bound is tight within a factor of nε.

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

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

U2 - 10.1007/3-540-55719-9_95

DO - 10.1007/3-540-55719-9_95

M3 - Conference contribution

AN - SCOPUS:84976668911

SN - 9783540557197

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 439

EP - 449

BT - Automata, Languages and Programming - 19th International Colloquium, Proceedings

A2 - Kuich, Werner

PB - Springer Verlag

ER -