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

DOI10.1016/S0166-218X(99)00011-6zbMATH Open0942.68034OpenAlexW2081186021MaRDI QIDQ1289031FDOQ1289031

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

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

zbMATH Keywords

Jordan sorting

Mathematics Subject Classification ID

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

Cites Work

• Self-adjusting binary search trees
• Title not available (Why is that?)
• Reentrant polygon clipping
• Sorting jordan sequences in linear time using level-linked search trees
• Simplified linear-time Jordan sorting and polygon clipping
• Title not available (Why is that?)

Cited In (2)

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

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)