Polygon nesting and robustness

DOI10.1016/0020-0190(90)90169-XzbMath0704.68053MaRDI QIDQ917303

Chanderjit L. Bajaj, Tamal Krishna Dey

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computer graphicscomputational geometrypolygon nesting problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (2)

Nesting planning based on production priorities and technological efficiency ⋮ Planar median graphs and cubesquare-graphs

Cites Work

• Unnamed Item
• Verifiable implementations of geometric algorithms using finite precision arithmetic
• Topologically sweeping an arrangement
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm

This page was built for publication: Polygon nesting and robustness