On fast computation of distance between line segments

DOI10.1016/0020-0190(85)90032-8zbMath0575.68076OpenAlexW1975103987MaRDI QIDQ1064074

Vladimir J. Lumelsky

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90032-8

zbMATH Keywords

algorithmimage processingVLSI designroboticsCAD systemsminimum distancestraight lines

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Related Items (4)

A barrier method for contact avoiding particles in Stokes flow ⋮ An algorithm for computing the distance between two circular disks ⋮ Three-dimensional distinct element simulation of spherocylinder crystallization ⋮ On using LP to collision detection between a manipulator arm and surrounding obstacles

Cites Work

• Unnamed Item

This page was built for publication: On fast computation of distance between line segments