scientific article; zbMATH DE number 740451
From MaRDI portal
Publication:4327151
Recommendations
- scientific article; zbMATH DE number 2202078
- An accurate distance-calculation algorithm for convex polyhedra
- scientific article; zbMATH DE number 1440920
- A linear time algorithm for the computation of some distance functions between convex polygons
- Finding the minimum vertex distance between two disjoint convex polygons in linear time
Cited in
(17)- scientific article; zbMATH DE number 1440917 (Why is no real title available?)
- Fast computation of distance between two disjoint 2D convex regions with curved boundaries
- scientific article; zbMATH DE number 1246408 (Why is no real title available?)
- Distance bound for nonconvex polyhedral models in close proximity
- OPTIMIZATION OF THE ALGORITHM FOR DETERMINING THE HAUSDORFF DISTANCE FOR CONVEX POLYGONS
- scientific article; zbMATH DE number 1440920 (Why is no real title available?)
- Verified convex hull and distance computation for octree-encoded objects
- A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram
- Minimum distance between the faces of two convex polyhedra: A sufficient condition
- scientific article; zbMATH DE number 730000 (Why is no real title available?)
- scientific article; zbMATH DE number 3934326 (Why is no real title available?)
- An optimal algorithm for solving collision distance between convex polygons in plane
- Efficient distance computation in configuration space
- An accurate distance-calculation algorithm for convex polyhedra
- Computing the extreme distances between two convex polygons
- A fast algorithm for determining the distances of the points of a given set in an integral lattice from its complement
- scientific article; zbMATH DE number 2202078 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327151)
