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

DOI10.1631/jzus.2006.A1522zbMath1145.65307MaRDI QIDQ863827

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

Publication date: 2 February 2007

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

zbMATH Keywords

Computational geometryVoronoi diagramPolygonDistance computation

Mathematics Subject Classification ID

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

Uses Software

• V-Clip

Cites Work

• Unnamed Item
• Unnamed Item
• A hierarchical method for real-time distance computation among moving convex bodies
• Computing the extreme distances between two convex polygons

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