An optimal algorithm for solving collision distance between convex polygons in plane

DOI10.1007/BF02939545zbMath0818.68143OpenAlexW2051696576MaRDI QIDQ1312900

Yong Yan

Publication date: 7 February 1994

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02939545

zbMATH Keywords

packing problemcollision distanceeffective collision edgeinitial collision vertexplanar convex polygons

Mathematics Subject Classification ID

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

Cites Work

• Approximation schemes for covering and packing problems in image processing and VLSI
• Unnamed Item
• Unnamed Item

This page was built for publication: An optimal algorithm for solving collision distance between convex polygons in plane