Guarding Disjoint Orthogonal Polygons in the Plane
Given a set F of disjoint monotone orthogonal polygons, we present bounds on the number of vertex guards required to monitor the free space and the boundaries of the polygons in F. We assume that the range of vision of a guard is bounded by 180\(^{\circ }
- PDF / 28,886,341 Bytes
- 837 Pages / 439.37 x 666.142 pts Page_size
- 37 Downloads / 178 Views
Weili Wu Zhongnan Zhang (Eds.)
Combinatorial Optimization and Applications 14th International Conference, COCOA 2020 Dallas, TX, USA, December 11–13, 2020 Proceedings
Lecture Notes in Computer Science Founding Editors Gerhard Goos Karlsruhe Institute of Technology, Karlsruhe, Germany Juris Hartmanis Cornell University, Ithaca, NY, USA
Editorial Board Members Elisa Bertino Purdue University, West Lafayette, IN, USA Wen Gao Peking University, Beijing, China Bernhard Steffen TU Dortmund University, Dortmund, Germany Gerhard Woeginger RWTH Aachen, Aachen, Germany Moti Yung Columbia University, New York, NY, USA
12577
More information about this subseries at http://www.springer.com/series/7407
Weili Wu Zhongnan Zhang (Eds.) •
Combinatorial Optimization and Applications 14th International Conference, COCOA 2020 Dallas, TX, USA, December 11–13, 2020 Proceedings
123
Editors Weili Wu The University of Texas at Dallas Richardson, TX, USA
Zhongnan Zhang Xiamen University Xiamen, China
ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science ISBN 978-3-030-64842-8 ISBN 978-3-030-64843-5 (eBook) https://doi.org/10.1007/978-3-030-64843-5 LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues © Springer Nature Switzerland AG 2020 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. This Springer imprint is published by the registered company Springer Nature Switzerland AG The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
Preface
The 14th Annual International Conference on Combinatorial Optimization and Application (COCOA 2020) was planned to take place in Dallas, Texas, USA, December 11–13, 2020. As a result of extenuating circumstances due to COVID-19, COCOA 2020 was held as a fully virtual conference. COCOA 2020 provided a forum for researchers working in the area of combinatorial optimization and it
