Pages that link to "Item:Q5959553"

The following pages link to Polygon decomposition for efficient construction of Minkowski sums (Q5959553):

Displaying 26 items.

• Contributing vertices-based Minkowski sum computation of convex polyhedra (Q628213) (← links)
• A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q831714) (← links)
• Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces (Q834598) (← links)
• Complete and robust no-fit polygon generation for the irregular stock cutting problem (Q858412) (← links)
• The visibility-Voronoi complex and its applications (Q870429) (← links)
• On the exact maximum complexity of Minkowski sums of polytopes (Q1042457) (← links)
• Efficient regular polygon dissections (Q1573694) (← links)
• Exact Minkowski sums of polygons with holes (Q1615780) (← links)
• Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers (Q1652562) (← links)
• An emergent computation approach to the problem of polygon layout with performance constraints (Q1673263) (← links)
• A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems (Q1992380) (← links)
• Capturing points with a rotating polygon (and a 3D extension) (Q2000002) (← links)
• A general method for decomposing self-intersecting polygon to normal based on self-intersection points (Q2006782) (← links)
• Mathematical model and efficient algorithms for object packing problem (Q2269838) (← links)
• Irregular packing problems: a review of mathematical models (Q2286866) (← links)
• A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering (Q2356195) (← links)
• Approximating multidimensional subset sum and Minkowski decomposition of polygons (Q2364904) (← links)
• Advanced programming techniques applied to CGAL's arrangement package (Q2371336) (← links)
• A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums (Q2384604) (← links)
• The geometry of nesting problems: a tutorial (Q2384608) (← links)
• Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions (Q2475344) (← links)
• Closed-form characterization of the Minkowski sum and difference of two ellipsoids (Q2516422) (← links)
• (Q3424929) (← links)
• Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)
• A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q6126717) (← links)
• Optimal algorithms for separating a polyhedron from its single-part mold (Q6640038) (← links)