Skip to main content
Springer Nature Link
Log in

Shortest paths of a disc inside a polygonal region

  • Advanced Algorithms
  • Conference paper
  • First Online:
Eurocal '87 (EUROCAL 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 378))

Included in the following conference series:

  • 146 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  • Whitesides, S.H., "Computational Geometry and Motion Planning", in: Toussaint, G.T. (ed.), Computational Geometry (North Holland, 1985)

    Google Scholar 

  • O'Dunlaing, C., Sharir, M., Yap, C.K., "Retraction: A new approach to motion planning", 15th ACM STOC (1983), 207–220

    Google Scholar 

  • Bentley, J.L., Shamos, M.I., "Divide-and-Conquer in Multidimensional Space", Proc. 8th ACM STOC (1976), 220–230

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Sektion, Friedrich-Schiller-University, 6900, Jena, GDR

    Günter Werner

Authors
  1. Günter Werner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

James H. Davenport

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Werner, G. (1989). Shortest paths of a disc inside a polygonal region. In: Davenport, J.H. (eds) Eurocal '87. EUROCAL 1987. Lecture Notes in Computer Science, vol 378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51517-8_152

Download citation

  • DOI: https://doi.org/10.1007/3-540-51517-8_152

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51517-3

  • Online ISBN: 978-3-540-48207-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics