Planar lower envelope of monotone polygonal chains

•An algorithm to find the lower envelope of monotone polygonal chains is proposed.•Simpler than known methods and requires no complex data structures.•Applies to output-sensitive construction of line segment lower envelope. A simple linear search algorithm running in O(n+mk) time is proposed for con...

Celý popis

Podrobná bibliografia

Vydané v:	Information processing letters Ročník 115; číslo 12; s. 962 - 964
Hlavný autor:	Lu, Daniel L.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.12.2015 Elsevier Sequoia S.A
Predmet:	Algorithms Computational geometry Computer science Lower envelope Output Output-sensitive algorithms Polygons Studies Upper envelope Computational geometry Output-sensitive algorithms Upper envelope Lower envelope
ISSN:	0020-0190, 1872-6119
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!