A simple algorithm for determining the envelope of a set of lines (Q1182080): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(91)90106-r / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2080276023 / rank | |||
Normal rank | |||
Latest revision as of 10:18, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple algorithm for determining the envelope of a set of lines |
scientific article |
Statements
A simple algorithm for determining the envelope of a set of lines (English)
0 references
27 June 1992
0 references
We present an algorithm for constructing the envelope of a set of \(n\) lines which requires only linear time after sorting. Furthermore, the algorithm uses no data structure more complex than a stack.
0 references
envelope of a set of n lines
0 references
