Approximate Motion Planning and the Complexity of the Boundary of the Union of 
Simple Geometric Figures

Alt, Helmut; Fleischer, Rudolf; Kaufmann, Michael; Mehlhorn, Kurt; Näher, Stefan; Schirra, Stefan; Uhrig, Christian

doi:10.1007/BF01758853

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures

MPS-Authors

Alt, Helmut
Max Planck Society;

/persons/resource/persons44431

Fleischer, Rudolf
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44745

Kaufmann, Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45100

Näher, Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45391

Schirra, Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45646

Uhrig, Christian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dwLYC
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Alt, H., Fleischer, R., Kaufmann, M., Mehlhorn, K., Näher, S., Schirra, S., et al. (1992). Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Algorithmica, 8(5-6), 391-408. doi:10.1007/BF01758853.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ADEF-5

Abstract

There is no abstract available