Pages that link to "Item:Q3759941"
From MaRDI portal
The following pages link to A fast algorithm for the Boolean masking problem (Q3759941):
Displaying 5 items.
- Limits of local search: quality and efficiency (Q527441) (← links)
- Time and space efficient algorithms for shortest paths between convex polygons (Q1098634) (← links)
- A worst-case efficient algorithm for hidden-line elimination<sup>†</sup> (Q3802610) (← links)
- Polygon placement under translation and rotation (Q3816980) (← links)
- An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction (Q4513199) (← links)
