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

DOI10.1016/S0166-218X(99)00011-6MaRDI QIDQ1289031zbMATH OpenOpenAlexFDO

Authors E. Sojka

Publication date 24 May 1999

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00011-6

zbMATH Keywords

Jordan sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• Sorting jordan sequences in linear time using level-linked search trees
• Simplified linear-time Jordan sorting and polygon clipping
• Sorting Points Along an Algebraic Curve
• scientific article; zbMATH DE number 3915641
• A fast planar partition algorithm. I

Cites work

• scientific article; zbMATH DE number 619546 (Why is no real title available?)
• scientific article; zbMATH DE number 1032051 (Why is no real title available?)
• Reentrant polygon clipping
• Self-adjusting binary search trees
• Simplified linear-time Jordan sorting and polygon clipping
• Sorting jordan sequences in linear time using level-linked search trees

Cited in

(2)

• Sorting jordan sequences in linear time using level-linked search trees
• A note on average-case sorting

This page was built for publication: A new algorithm for Jordan sorting: Its average-case analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1289031)