Pages that link to "Item:Q2489016"

The following pages link to Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (Q2489016):

Displaying 10 items.

• Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
• Space-time trade-offs for stack-based algorithms (Q494797) (← links)
• Memory efficient algorithms for cactus graphs and block graphs (Q528335) (← links)
• In-place algorithms for computing (Layers of) maxima (Q848632) (← links)
• A new algorithm for computing the convex hull of a planar point set (Q926679) (← links)
• Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
• Covering paths for planar point sets (Q2250054) (← links)
• Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
• Memory-constrained algorithms for simple polygons (Q2391542) (← links)
• Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)