Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time

From MaRDI portal

(Redirected from Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Space-efficient_algorithms_for_computing_the_convex_hull_of_a_simple_polygonal_line_in_linear_time&oldid=73482558"