Pages that link to "Item:Q918739"

The following pages link to An optimal algorithm for computing a minimum nested nonconvex polygon (Q918739):

Displaying 11 items.

• Finding minimal nested polygons (Q802901) (← links)
• A new algorithm for the minimal-area convex enclosure problem (Q1127205) (← links)
• Minimum vertex hulls for polyhedral domains (Q1199529) (← links)
• Computing minimum length paths of a given homotopy class (Q1330462) (← links)
• An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane (Q1335567) (← links)
• Finding minimal convex nested polygons (Q1822960) (← links)
• Polygonal approximation by the minimax method (Q3318070) (← links)
• A finite algorithm for concave minimization over a polyhedron (Q3705227) (← links)
• The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential (Q5216797) (← links)
• The minimum Euclidean-norm point in a convex polytope: Wolfe's combinatorial algorithm is exponential (Q5230318) (← links)
• The irregular nesting problem: a new approach for nofit polygon calculation (Q5429840) (← links)