Rotational polygon containment and minimum enclosure using only robust 2D constructions

DOI10.1016/S0925-7721(99)00006-1zbMath0930.68152OpenAlexW1997669863MaRDI QIDQ1305861

Victor J. Milenkovic

Publication date: 22 September 1999

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(99)00006-1

zbMATH Keywords

rotational polygon containment

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (15)

AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES ⋮ Complete and robust no-fit polygon generation for the irregular stock cutting problem ⋮ A customized branch-and-bound approach for irregular shape nesting ⋮ Robust atlas generation via angle-based segmentation ⋮ Aligning two convex figures to minimize area or perimeter ⋮ Phi-functions for 2D objects formed by line segments and circular arcs ⋮ Bundling Two Simple Polygons to Minimize Their Convex Hull ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ A fully general, exact algorithm for nesting irregular shapes ⋮ TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS ⋮ Mathematical model and efficient algorithms for object packing problem ⋮ Optimal clustering of a pair of irregular objects ⋮ Two-dimensional profile-packing approach for multi-torch flame cutting ⋮ 3D mesh cutting for high quality atlas packing ⋮ Iterated snap rounding

This page was built for publication: Rotational polygon containment and minimum enclosure using only robust 2D constructions