A new algorithm for Jordan sorting: its average-case analysis

Show simple item record
dc.contributor.authorSojka, Eduard
dc.date.accessioned2007-08-09T12:34:21Z
dc.date.available2007-08-09T12:34:21Z
dc.date.issued1999
dc.description.abstract-enGiven the intersection points of a planar Jordan curve with the x-axis in the order in which they occur along the curve, sort them into the order in which they occur along the x-axis. In this paper, the average-case analysis of a new simple algorithm that solves the above-mentioned problem is presented. A certain model of generating random Jordan sequences is introduced. The results of the analysis are summarised in the form of theorems that specify the conditions under which the algorithm runs in linear expected time. The results are verified experimentally by a computer simulation.en
dc.identifier.citationDiscrete Applied Mathematics. 1999, vol. 93, issue 1, p. 127-140.en
dc.identifier.doi10.1016/S0166-218X(99)00011-6
dc.identifier.issn0166-218X
dc.identifier.locationNení ve fondu ÚKen
dc.identifier.urihttp://hdl.handle.net/10084/61666
dc.identifier.wos000079893500010
dc.language.isoenen
dc.publisherNorth-Hollanden
dc.relation.ispartofseriesDiscrete Applied Mathematicsen
dc.relation.urihttps://doi.org/10.1016/S0166-218X(99)00011-6en
dc.subjectJordan sortingen
dc.subjectpolygon clippingen
dc.subjectanalysis of algorithmsen
dc.titleA new algorithm for Jordan sorting: its average-case analysisen
dc.typearticleen

Files

Collections

Publikační činnost VŠB-TUO ve Web of Science / Publications of VŠB-TUO in Web of Science