Please use this identifier to cite or link to this item: doi:10.22028/D291-26142
Title: Sorting Jordan sequences in linear time
Author(s): Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
Language: English
Year of Publication: 1984
OPUS Source: Saarbrücken, 1984
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: For a Jordan curve C in the plane, let x_{1},x_{2},...,x_{n} be the abscissas of the intersection points of C with the x-axis, listed in the order the points occur on C. We call x_{1},x_{2},...,x_{n} a Jordan sequence. In this paper we describe an O(n)-time algorithm for recognizing and sorting Jordan sequences. The problem of sorting such sequences arises in computational geometry and computational geography. Our algorithm is based on a reduction of the recognition and sorting problem to a list-splitting problem. To solve the list-splitting problem we use level linked search trees.
Link to this record: urn:nbn:de:bsz:291-scidok-42129
Series name: Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes
Series volume: 1984/09
Date of registration: 7-Sep-2011
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14_1984_09.pdf7,35 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.