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

DOI10.1007/BF02939545zbMATH Open0818.68143OpenAlexW2051696576MaRDI QIDQ1312900FDOQ1312900

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
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• The distance between convex sets with Minkowski sum structure: application to collision detection

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• An optimal algorithm for intersecting line segments in the plane 👍 👎
• An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane 👍 👎
• An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons 👍 👎
• Fast algorithms for collision and proximity problems involving moving geometric objects 👍 👎
• Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons 👍 👎
• An accurate distance-calculation algorithm for convex polyhedra 👍 👎
• OPTIMIZATION OF THE ALGORITHM FOR DETERMINING THE HAUSDORFF DISTANCE FOR CONVEX POLYGONS 👍 👎

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

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