A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram

DOI10.1631/JZUS.2006.A1522MaRDI QIDQ863827zbMATH OpenFDO

Authors Chenglei Yang, Meng Qi, Xiangxu Meng, Xueqing Li, Jiaye Wang

Publication date 2 February 2007

Published in Journal of Zhejiang University. Science A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1631/JZUS.2006.A1522

zbMATH Keywords

Computational geometryDistance computationPolygonVoronoi diagram

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An optimal algorithm for solving collision distance between convex polygons in plane
• Finding the minimum vertex distance between two disjoint convex polygons in linear time
• Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
• scientific article; zbMATH DE number 740451
• Computing the extreme distances between two convex polygons

Cites work

• A hierarchical method for real-time distance computation among moving convex bodies
• Computing the extreme distances between two convex polygons
• scientific article; zbMATH DE number 177829 (Why is no real title available?)
• scientific article; zbMATH DE number 589497 (Why is no real title available?)

Cited in

(1)

• Fast computation of distance between two disjoint 2D convex regions with curved boundaries

Describes a project that uses

Uses Software

• V-Clip

This page was built for publication: A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram

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