Traveling the boundary of Minkowski sums.

DOI10.1016/S0020-0190(98)00053-2zbMath1078.68800MaRDI QIDQ2583555

Sándor P. Fekete, William R. Pulleyblank

Publication date: 17 January 2006

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

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)

Related Items (3)

New techniques for cost sharing in combinatorial optimization games ⋮ Winding indexes of Max. and Min. Hamiltonians in N-Gons ⋮ Approximation algorithms for lawn mowing and milling

Cites Work

• Unnamed Item
• Unnamed Item
• Computing convolutions by reciprocal search
• Spatial Planning: A Configuration Space Approach

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