cs.CG, cs.RO

A Ray Intersection Algorithm for Fast Growth Distance Computation Between Convex Sets

arXiv:2604.10058v1 Announce Type: new
Abstract: In this paper, we discuss an efficient algorithm for computing the growth distance between two compact convex sets with representable support functions. The growth distance between two sets is the minimu…