A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles

A general and simple algorithm is presented which computes the set FP of all free configurations for a polygonal object I (with m edges) which is free to translate and/or to rotate but not to intersect another polygonal object E. The worst-case time complexity of the algorithm is O(m/sup 3/n/sup 3/...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Avnaim, F., Boissonnat, J.D., Faverjon, B.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Joining processes
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!