Topics in Computational Geometry | Robust Geometric Computing and Optimal Visibility Coverage
Eli Packer
ISBN 10: 3639162951 ISBN 13: 9783639162950
Verlag: VDM Verlag Dr. Müller, 2009
Neu
Taschenbuch
Verkäufer
preigu, Osnabrück, Deutschland
Verkäuferbewertung 5 von 5 Sternen
AbeBooks-Verkäufer seit 5. August 2024
Dieser Artikel ist nicht mehr verfügbar.
Beschreibung
Beschreibung:
Topics in Computational Geometry | Robust Geometric Computing and Optimal Visibility Coverage | Eli Packer | Taschenbuch | Englisch | VDM Verlag Dr. Müller | EAN 9783639162950 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Bestandsnummer des Verkäufers 101553707
Inhaltsangabe:
This book presents work in two of the most popular areas of geometric computation: Robust Geometric Computing and Optimal Visibility Coverage. Both areas have been extensively researched in recent years and attracted the attention of many researchers and software developers. (1) Implementation of geometric algorithms is generally difficult because one must deal with both precision problems and degenerate input. Overlooking these issues often result in program errors or crashes. The first part of this book presents algorithms to approximate an arrangement of line segments, which is a basic and important geometric data structure, in order to make it more robust for further manipulation and computation. (2) The optimal visibility coverage problem, often called the "art gallery problem", is one of the classic geometric problems. The input for the problem is a geometric domain and the challenge is to minimize the number of guards that cover, or see, the domain. This topic is motivated by problems in surveillance, sensor networking, illumination and more. The second part of this book presents algorithms for some of the most popular visibility coverage problems.
Reseña del editor: This book presents work in two of the most popular areas of geometric computation: Robust Geometric Computing and Optimal Visibility Coverage. Both areas have been extensively researched in recent years and attracted the attention of many researchers and software developers. (1) Implementation of geometric algorithms is generally difficult because one must deal with both precision problems and degenerate input. Overlooking these issues often result in program errors or crashes. The first part of this book presents algorithms to approximate an arrangement of line segments, which is a basic and important geometric data structure, in order to make it more robust for further manipulation and computation. (2) The optimal visibility coverage problem, often called the "art gallery problem", is one of the classic geometric problems. The input for the problem is a geometric domain and the challenge is to minimize the number of guards that cover, or see, the domain. This topic is motivated by problems in surveillance, sensor networking, illumination and more. The second part of this book presents algorithms for some of the most popular visibility coverage problems.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Bibliografische Details
Titel: Topics in Computational Geometry | Robust ...
Verlag: VDM Verlag Dr. Müller
Erscheinungsdatum: 2009
Einband: Taschenbuch
Zustand: Neu
Beste Suchergebnisse bei AbeBooks
Foto des Verkäufers
Topics in Computational Geometry
Verlag:
VDM Verlag Dr. Müller, 2009
ISBN 10: 3639162951
ISBN 13: 9783639162950
Neu
Kartoniert / Broschiert
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 4 von 5 Sternen
Kartoniert / Broschiert. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Packer EliDr. Eli Packer works at IBM Research Center in Hawthorne, NewnYork. He received a B.Sc. and an M.Sc. in Computer Science from TelnAviv University, and a Ph.D. from the Department of ComputernScience at Stony Brook Universit. Bestandsnummer des Verkäufers 4963105
Neu kaufen
EUR 46,32
Versand:
EUR 48,99
Von Deutschland nach USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Topics in Computational Geometry: Robust Geometric Computing and Optimal Visibility Coverage
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
Paperback. Zustand: New. Bestandsnummer des Verkäufers 6666-IUK-9783639162950
Neu kaufen
EUR 52,74
Versand:
EUR 17,53
Von Vereinigtes Königreich nach USA
Anzahl: 10 verfügbar
Beispielbild für diese ISBN
Topics in Computational Geometry: Robust Geometric Computing and Optimal Visibility Coverage
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9783639162950_new
Neu kaufen
EUR 54,78
Versand:
EUR 13,56
Von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Topics in Computational Geometry Robust Geometric Computing and Optimal Visibility Coverage
Print-on-DemandAnbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bestandsnummer des Verkäufers L0-9783639162950
Neu kaufen
EUR 56,47
Versand:
EUR 4,71
Von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Topics in Computational Geometry Robust Geometric Computing and Optimal Visibility Coverage
Print-on-DemandAnbieter: PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bestandsnummer des Verkäufers L0-9783639162950
Neu kaufen
EUR 59,38
Versand:
Gratis
Innerhalb der USA
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Topics in Computational Geometry : Robust Geometric Computing and Optimal Visibility Coverage
Print-on-DemandAnbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book presents work in two of the most popularareas of geometric computation: Robust GeometricComputing and Optimal Visibility Coverage. Both areashave been extensively researched in recent years andattracted the attention of many researchers andsoftware developers. (1) Implementation of geometricalgorithms is generally difficult because one mustdeal with both precision problems and degenerateinput. Overlooking these issues often result inprogram errors or crashes. The first part of thisbook presents algorithms to approximate anarrangement of line segments, which is a basic andimportant geometric data structure, in order to makeit more robust for further manipulation andcomputation. (2) The optimal visibility coverageproblem, often called the 'art gallery problem', isone of the classic geometric problems. The input forthe problem is a geometric domain and the challengeis to minimize the number of guards that cover, orsee, the domain. This topic is motivated by problemsin surveillance, sensor networking, illumination andmore. The second part of this book presentsalgorithms for some of the most popular visibilitycoverage problems. Bestandsnummer des Verkäufers 9783639162950
Neu kaufen
EUR 59,71
Versand:
EUR 61,10
Von Deutschland nach USA
Anzahl: 2 verfügbar