GEOMETRIC APPLICATIONS OF DAVENPORT-SCHINZEL SEQUENCES.

Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony

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

Abstract

Efficient algorithms are presented for the following geometric problems: (1) Preprocessing of a 2-D polyhedral terrain so as to support fast ray shooting queries from a fixed point. (2) Determining whether two disjoint interlocking simple polygons can be separated from one another by a sequence of translations. (3) Determining whether a given convex polygon can be translated and rotated so as to fit into another given polygonal region. (4) Motion planning for a convex polygon in the plane amidst polygonal barriers. All the algorithms make use of Davenport-Schinzel sequences and their generalizations; these sequences are a powerful combinatorial tool applicable in contexts that involve the calculation of the pointwise maximum or minimum of a collection of functions.

Original languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
Pages77-86
Number of pages10
DOIs
StatePublished - 1986

Fingerprint

Motion planning

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Sharir, M., Cole, R., Kedem, K., Leven, D., Pollack, R., & Sifrony, S. (1986). GEOMETRIC APPLICATIONS OF DAVENPORT-SCHINZEL SEQUENCES. In Annual Symposium on Foundations of Computer Science (Proceedings) (pp. 77-86) https://doi.org/10.1109/SFCS.1986.23

GEOMETRIC APPLICATIONS OF DAVENPORT-SCHINZEL SEQUENCES. / Sharir, Micha; Cole, Richard; Kedem, Klara; Leven, Daniel; Pollack, Richard; Sifrony, Shmuel.

Annual Symposium on Foundations of Computer Science (Proceedings). 1986. p. 77-86.

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

Sharir, M, Cole, R, Kedem, K, Leven, D, Pollack, R & Sifrony, S 1986, GEOMETRIC APPLICATIONS OF DAVENPORT-SCHINZEL SEQUENCES. in Annual Symposium on Foundations of Computer Science (Proceedings). pp. 77-86. https://doi.org/10.1109/SFCS.1986.23
Sharir M, Cole R, Kedem K, Leven D, Pollack R, Sifrony S. GEOMETRIC APPLICATIONS OF DAVENPORT-SCHINZEL SEQUENCES. In Annual Symposium on Foundations of Computer Science (Proceedings). 1986. p. 77-86 https://doi.org/10.1109/SFCS.1986.23
Sharir, Micha ; Cole, Richard ; Kedem, Klara ; Leven, Daniel ; Pollack, Richard ; Sifrony, Shmuel. / GEOMETRIC APPLICATIONS OF DAVENPORT-SCHINZEL SEQUENCES. Annual Symposium on Foundations of Computer Science (Proceedings). 1986. pp. 77-86
@inproceedings{9bc873260c5b4e01b4671f40bf93446a,
title = "GEOMETRIC APPLICATIONS OF DAVENPORT-SCHINZEL SEQUENCES.",
abstract = "Efficient algorithms are presented for the following geometric problems: (1) Preprocessing of a 2-D polyhedral terrain so as to support fast ray shooting queries from a fixed point. (2) Determining whether two disjoint interlocking simple polygons can be separated from one another by a sequence of translations. (3) Determining whether a given convex polygon can be translated and rotated so as to fit into another given polygonal region. (4) Motion planning for a convex polygon in the plane amidst polygonal barriers. All the algorithms make use of Davenport-Schinzel sequences and their generalizations; these sequences are a powerful combinatorial tool applicable in contexts that involve the calculation of the pointwise maximum or minimum of a collection of functions.",
author = "Micha Sharir and Richard Cole and Klara Kedem and Daniel Leven and Richard Pollack and Shmuel Sifrony",
year = "1986",
doi = "10.1109/SFCS.1986.23",
language = "English (US)",
isbn = "0818607408",
pages = "77--86",
booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",

}

TY - GEN

T1 - GEOMETRIC APPLICATIONS OF DAVENPORT-SCHINZEL SEQUENCES.

AU - Sharir, Micha

AU - Cole, Richard

AU - Kedem, Klara

AU - Leven, Daniel

AU - Pollack, Richard

AU - Sifrony, Shmuel

PY - 1986

Y1 - 1986

N2 - Efficient algorithms are presented for the following geometric problems: (1) Preprocessing of a 2-D polyhedral terrain so as to support fast ray shooting queries from a fixed point. (2) Determining whether two disjoint interlocking simple polygons can be separated from one another by a sequence of translations. (3) Determining whether a given convex polygon can be translated and rotated so as to fit into another given polygonal region. (4) Motion planning for a convex polygon in the plane amidst polygonal barriers. All the algorithms make use of Davenport-Schinzel sequences and their generalizations; these sequences are a powerful combinatorial tool applicable in contexts that involve the calculation of the pointwise maximum or minimum of a collection of functions.

AB - Efficient algorithms are presented for the following geometric problems: (1) Preprocessing of a 2-D polyhedral terrain so as to support fast ray shooting queries from a fixed point. (2) Determining whether two disjoint interlocking simple polygons can be separated from one another by a sequence of translations. (3) Determining whether a given convex polygon can be translated and rotated so as to fit into another given polygonal region. (4) Motion planning for a convex polygon in the plane amidst polygonal barriers. All the algorithms make use of Davenport-Schinzel sequences and their generalizations; these sequences are a powerful combinatorial tool applicable in contexts that involve the calculation of the pointwise maximum or minimum of a collection of functions.

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

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

U2 - 10.1109/SFCS.1986.23

DO - 10.1109/SFCS.1986.23

M3 - Conference contribution

SN - 0818607408

SN - 9780818607400

SP - 77

EP - 86

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

ER -