The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

A Fire Fighter's Problem.

På svenska

Author

Editor

  • Lars Arge
  • Janos Pach

Summary, in English

Suppose that a circular fire spreads in the plane at unit speed. A fire fighter can build a barrier at speed v > 1. How large must v be to ensure that the fire can be contained, and how should the fire fighter proceed? We provide two results. First, we analyze the natural strategy where the fighter keeps building a barrier along the frontier of the expanding fire. We prove that this approach contains the fire if v > v_c = 2.6144... holds. Second, we show that any "spiralling" strategy must have speed v > 1.618, the golden ratio, in order to succeed.

Publishing year

2015

Language

English

Pages

768-780

Publication/Series

Leibniz International Proceedings in Informatics (LIPIcs)

Volume

34

Document type

Conference paper

Publisher

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Topic

  • Computer Science

Keywords

  • Motion Planning
  • Dynamic Environments
  • Spiralling strategies
  • Lower and upper bounds

Conference name

31st International Symposium on Computational Geometry (SoCG 2015)

Conference date

2015-06-22

Conference place

Netherlands

Status

Published

Research group

  • Algorithms

ISBN/ISSN/Other

  • ISSN: 1868-8969