Congruence, similarity and symmetries of geometric objects
Discrete & Computational Geometry - ACM Symposium on Computational Geometry, Waterloo
Computing minimum length paths of a given homotopy class
Computational Geometry: Theory and Applications
Approximate decision algorithms for point set congruence
Computational Geometry: Theory and Applications
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Approximate congruence in nearly linear time
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Sweeping simple polygons with a chain of guards
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Geometric shape matching and drug design
Geometric shape matching and drug design
| Hi-index | 0.00 |
We address the problem of continuously transforming or morphing one simple polyline into another so that every point p of the initial polyline moves to a point q of the final polyline using the geodesic shortest path from p to q. We optimize the width of the morphing, that is, the longest geodesic path between p and q. We present a linear-time algorithm for finding a morphing with width guaranteed to be at most 1.618 times the minimum width of a morphing. This improves the previous algorithm [9] by a factor of log n. We also develop a linear-time algorithm for computing a medial axis separator.