Pages that link to "Item:Q5946382"

The following pages link to A randomized algorithm for triangulating a simple polygon in linear time (Q5946382):

Displaying 12 items.

• A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions (Q728493) (← links)
• A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (Q809630) (← links)
• Simplified linear-time Jordan sorting and polygon clipping (Q911762) (← links)
• Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)
• High-order polygonal discontinuous Petrov-Galerkin (PolyDPG) methods using ultraweak formulations (Q2310869) (← links)
• A linear-time construction of Reuleaux polygons (Q2365262) (← links)
• Use of simple polygonal chains in generating random simple polygons (Q2400166) (← links)
• Three problems about simple polygons (Q2432735) (← links)
• GRP_CH Heuristic for Generating Random Simple Polygon (Q2876594) (← links)
• (Q3704927) (← links)
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon (Q3777450) (← links)
• Time-space trade-offs for triangulating a simple polygon (Q5745387) (← links)