Title
Art Gallery Theorems And Algorithms (International Series Of Monographs On Computer Science)
Processing time: 1-3 days
US Orders Ships in: 3-5 days
International Orders Ships in: 8-12 days
Return Policy: 15-days return on defective items
Payment Option
Art Gallery Theorems And Algorithms Are So Called Because They Relate To Problems Involving The Visibility Of Geometrical Shapes And Their Internal Surfaces. This Book Explores Generalizations And Specializations In These Areas. Among The Presentations Are Recently Discovered Theorems On Orthogonal Polygons, Polygons With Holes, Exterior Visibility, Visibility Graphs, And Visibility In Three Dimensions. The Author Formulates Many Open Problems And Offers Several Conjectures, Providing Arguments Which May Be Followed By Anyone Familiar With Basic Graph Theory And Algorithms. This Work May Be Applied To Robotics And Artificial Intelligence As Well As Other Fields, And Will Be Especially Useful To Computer Scientists Working With Computational And Combinatorial Geometry.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: What is the size of the book? A: The book measures six point three eight inches in length, one point zero eight inches in width, and nine point five inches in height.
- Q: How many pages does this book have? A: This book contains three hundred and four pages, offering a comprehensive exploration of art gallery theorems and algorithms.
- Q: What type of binding does the book have? A: The book is bound in hardcover, providing durability and a professional appearance.
- Q: Who is the author of this book? A: The author of this book is Joseph O'Rourke, known for his contributions to computer science and geometry.
- Q: What topics are covered in this book? A: The book explores visibility problems in geometry, including orthogonal polygons, visibility graphs, and applications in robotics.
- Q: Is this book suitable for beginners? A: Yes, the book is suitable for those familiar with basic graph theory and algorithms, making it accessible to beginners.
- Q: Can I use this book for academic purposes? A: Yes, this book is an excellent resource for academic study, especially in fields like computer science and mathematics.
- Q: What audience is this book intended for? A: This book is intended for computer scientists, mathematicians, and anyone interested in computational and combinatorial geometry.
- Q: How should I store this book? A: Store the book in a dry, cool place, upright on a shelf to maintain its shape and protect the binding.
- Q: Can I clean the book if it gets dirty? A: Yes, gently wipe the cover with a soft, dry cloth to remove any dust or dirt without damaging the book.
- Q: Is there a warranty for this book? A: No, books typically do not come with a warranty, but check the retailer’s return policy for any issues.
- Q: What if the book arrives damaged? A: If the book arrives damaged, contact the retailer immediately to discuss return or replacement options.
- Q: Does the book contain any illustrations? A: Yes, the book includes illustrations that help clarify the concepts discussed in the text.
- Q: Is this book part of a series? A: Yes, this book is part of the International Series of Monographs on Computer Science.
- Q: What is the main focus of the book? A: The main focus of the book is on visibility problems related to geometrical shapes and their applications.
- Q: Are there any exercises or problems in the book? A: Yes, the book formulates open problems and conjectures for readers to explore further.