Traveling the boundary of Minkowski sums.

DOI10.1016/S0020-0190(98)00053-2zbMATH Open1078.68800MaRDI QIDQ2583555FDOQ2583555

Authors: Sándor P. Fekete, William R. Pulleyblank 

Publication date: 17 January 2006

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

Recommendations

• COMPUTING MINKOWSKI SUMS OF PLANE CURVES
• Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions
• Area and volume of the Minkowski sum
• Algorithms – ESA 2004
• A MONOTONIC CONVOLUTION FOR MINKOWSKI SUMS

zbMATH Keywords

Computational geometryHamiltonian cycleMinkowski sumMotion planningCauchy's formulaGeometric optimizationContour linesGeometric inequalities

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Spatial Planning: A Configuration Space Approach
• Computing convolutions by reciprocal search
• Title not available (Why is that?)

Cited In (3)

• Winding indexes of max. and min. Hamiltonians in \(N\)-gons
• Approximation algorithms for lawn mowing and milling
• New techniques for cost sharing in combinatorial optimization games

This page was built for publication: Traveling the boundary of Minkowski sums.

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