Full metadata record
| DC pole | Hodnota | Jazyk |
|---|---|---|
| dc.contributor.author | Sojka, Eduard | |
| dc.contributor.editor | Skala, Václav | |
| dc.date.accessioned | 2015-09-23T08:49:27Z | |
| dc.date.available | 2015-09-23T08:49:27Z | |
| dc.date.issued | 1997 | |
| dc.identifier.citation | Journal of WSCG. 1997, vol. 5, no. 1-3. | en |
| dc.identifier.issn | 1213-6972 (print) | |
| dc.identifier.issn | 1213-6980 (CD-ROM) | |
| dc.identifier.issn | 1213-6964 (online) | |
| dc.identifier.uri | http://hdl.handle.net/11025/15886 | |
| dc.identifier.uri | http://wscg.zcu.cz/wscg1997/wscg97.htm | |
| dc.format | 10 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | en |
| dc.publisher | Václav Skala - UNION Agency | cs |
| dc.relation.ispartofseries | Journal of WSCG | en |
| dc.rights | © Václav Skala - UNION Agency | cs |
| dc.subject | výpočetní geometrie | cs |
| dc.subject | Jordanovo třídění | cs |
| dc.subject | výstřižek polygonu | cs |
| dc.title | A simple and efficient algorithm for sorting the intersection points between a Jordan curve and a line | en |
| dc.type | článek | cs |
| dc.type | article | en |
| dc.rights.access | openAccess | en |
| dc.type.version | publishedVersion | en |
| dc.description.abstract-translated | In this paper, we focus on the Jordan sorting problem: Given N intersection points of a Jordan curve with the x-axis in the order in which they occur along the curve. The task is to sort these points into the order in which they occur along the x-axis. Contrary to general sorting whose solution (in the algebraic decision-tree model of computation) requires θ(N log N) time in the worst case, the Jordan sorting problem can be solved in θ(N) time. The linear worst-case time algorithms for Jordan sorting were proposed by Hoffman et al., and by Fung et al. Unfortunately, both these algorithms are rather complicated, which makes them difficult to use in practice. In this paper, we propose and analyse a simple algorithm for Jordan sorting. Although the worst-case time complexity of this algorithm is O(N log N), we show that the worst time is achieved only for special inputs. For most inputs, a better performance can be expected. We also show that for a certain class of inputs which may be of practical interest, the algorithm runs even in O(N) expected time. We believe that for many practical applications, the algorithm may be more advantageous than rather complicated worst-case time optimal algorithms. Our main result is the analysis of this otherwise rather straightforward algorithm. | en |
| dc.subject.translated | computational geometry | en |
| dc.subject.translated | Jordan sorting | en |
| dc.subject.translated | polygon clipping | en |
| dc.type.status | Peer-reviewed | en |
| Vyskytuje se v kolekcích: | Volume 5, number 1-3 (1997) | |
Soubory připojené k záznamu:
| Soubor | Popis | Velikost | Formát | |
|---|---|---|---|---|
| Sojka_97.pdf | Plný text | 199,25 kB | Adobe PDF | Zobrazit/otevřít |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/15886Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.