scientific article
From MaRDI portal
Publication:4038728
zbMath0765.68201MaRDI QIDQ4038728
Johannes Blömer, Michael Godau, Helmut Alt, Hubert Wagener
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Computing a maximum axis-aligned rectangle in a convex polygon, Area-preserving approximations of polygonal paths, Maximizing the overlap of two planar convex sets under rigid motions, Approximate matching of polygonal shapes, Large \(k\)-gons in a 1.5D terrain, Aligning two convex figures to minimize area or perimeter, Shape matching under rigid motion, Scandinavian thins on top of cake: new and improved algorithms for stacking and packing, Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets, Polygonal chain approximation: A query based approach, Polygonal path simplification with angle constraints
