Pages that link to "Item:Q991174"

The following pages link to Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174):

Displaying 2 items.

• Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
• In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534) (← links)