Left-bottom and right-top segments

J.P.H.W. van den Eijnde

doi:10.1016/0167-6423(90)90045-F

Left-bottom and right-top segments

J.P.H.W. van den Eijnde

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

3 Citations (Scopus)

Abstract

A series of interesting maximal segment programming problems is formulated and solved, some part of the folklore, and others newly introduced. They range from rather simple to relatively complicated. At first sight they seem unrelated, but it is shown that elegant solutions to all of the problems can be found, after the introduction and calculation of a few simple functions.

Original language	English
Pages (from-to)	79-94
Journal	Science of Computer Programming
Volume	15
Issue number	1
DOIs	https://doi.org/10.1016/0167-6423(90)90045-F
Publication status	Published - 1990

Access to Document

10.1016/0167-6423(90)90045-F

Cite this

@article{f5607529d8d84329861ff251a6955726,

title = "Left-bottom and right-top segments",

abstract = "A series of interesting maximal segment programming problems is formulated and solved, some part of the folklore, and others newly introduced. They range from rather simple to relatively complicated. At first sight they seem unrelated, but it is shown that elegant solutions to all of the problems can be found, after the introduction and calculation of a few simple functions.",

author = "\{van den Eijnde\}, J.P.H.W.",

year = "1990",

doi = "10.1016/0167-6423(90)90045-F",

language = "English",

volume = "15",

pages = "79--94",

journal = "Science of Computer Programming",

issn = "0167-6423",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Left-bottom and right-top segments

AU - van den Eijnde, J.P.H.W.

PY - 1990

Y1 - 1990

N2 - A series of interesting maximal segment programming problems is formulated and solved, some part of the folklore, and others newly introduced. They range from rather simple to relatively complicated. At first sight they seem unrelated, but it is shown that elegant solutions to all of the problems can be found, after the introduction and calculation of a few simple functions.

AB - A series of interesting maximal segment programming problems is formulated and solved, some part of the folklore, and others newly introduced. They range from rather simple to relatively complicated. At first sight they seem unrelated, but it is shown that elegant solutions to all of the problems can be found, after the introduction and calculation of a few simple functions.

U2 - 10.1016/0167-6423(90)90045-F

DO - 10.1016/0167-6423(90)90045-F

M3 - Article

SN - 0167-6423

VL - 15

SP - 79

EP - 94

JO - Science of Computer Programming

JF - Science of Computer Programming

IS - 1

ER -

Left-bottom and right-top segments

Abstract

Access to Document

Fingerprint

Cite this