scientific article; zbMATH DE number 6472585

MaRDI QIDQ5501788zbMATH OpenFDO

Authors Christian A. Duncan, Michael T. Goodrich, Edgar A. Ramos

Publication date 14 August 2015

Mathematics Subject Classification ID

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

Cited in

(15)

• On overlays and minimization diagrams
• Offset-polygon annulus placement problems
• A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center
• Computing a minimum-width square annulus in arbitrary orientation
• Optimizing a constrained convex polygonal annulus
• Rearranging a sequence of points onto a line
• Covering points with a polygon
• Faster core-set constructions and data-stream algorithms in fixed dimensions
• Computing a Minimum-Width Square Annulus in Arbitrary Orientation
• Minimum Width Rectangular Annulus
• Minimum-width rectangular annulus
• Approximate convex intersection detection with applications to width and Minkowski sums
• Offset-polygon annulus placement problems
• Computing constrained minimum-width annuli of point sets
• Dynamic coresets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501788)