Pages that link to "Item:Q911762"

The following pages link to Simplified linear-time Jordan sorting and polygon clipping (Q911762):

Displaying 8 items.

• Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)
• A new algorithm for Jordan sorting: Its average-case analysis (Q1289031) (← links)
• A fast Las Vegas algorithm for triangulating a simple polygon (Q1823686) (← links)
• Quadtree, ray shooting and approximate minimum weight Steiner triangulation (Q1862115) (← links)
• Translating a convex polyhedron over monotone polyhedra (Q1862129) (← links)
• Computing optimal shortcuts for networks (Q2001454) (← links)
• Three problems about simple polygons (Q2432735) (← links)
• (Q5091005) (← links)