Cutting glass
From MaRDI portal
Publication:1580771
DOI10.1007/s004540010050zbMath0956.68146OpenAlexW4214914128MaRDI QIDQ1580771
Publication date: 14 September 2000
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004540010050
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) General convexity (52A99)
Related Items (8)
An approximation algorithm for cutting out convex polygons ⋮ The cost of cutting out convex \(n\)-gons ⋮ An improvement of the crossing number bound ⋮ Snipperclips: cutting tools into desired polygons using themselves ⋮ Independent set of intersection graphs of convex objects in 2D ⋮ Polygons cuttable by a circular saw ⋮ Crossing patterns of semi-algebraic sets ⋮ Cutting out polygon collections with a saw
This page was built for publication: Cutting glass
