A new staircase separator theorem

DOI10.1007/BFB0002769MaRDI QIDQ4536971zbMATH OpenFDO

Authors Viet Hai Nguyen

Publication date 6 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0002769

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computing methodologies and applications (68U99)

Recommendations

• SEPARATING SETS OF HYPERRECTANGLES
• An optimal parallel algorithm for planar cycle separators
• scientific article; zbMATH DE number 4213450
• Planar separators and parallel polygon triangulation.
• Fast sequential and parallel algorithms for finding the largest rectangle separating two sets

Cited in

(1)

• Staircase connected sets

This page was built for publication: A new staircase separator theorem

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