Pages that link to "Item:Q991174"
From MaRDI portal
The following pages link to Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174):
Displaying 5 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)
- Intersections and circuits in sets of line segments (Q2084612) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)
