Machine Intelligence and Pattern Recognition
eBook - PDF

Machine Intelligence and Pattern Recognition

  1. 472 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Machine Intelligence and Pattern Recognition

About this book

Machine Intelligence and Pattern Recognition, Volume 2: Computational Geometry focuses on the operations, processes, methodologies, and approaches involved in computational geometry, including algorithms, polygons, convex hulls, and bucketing techniques. The selection first ponders on optimal parallel algorithms for selection, sorting, and computing convex hulls, simple on-line algorithms for convex polygons, and geometric algorithms that use the furthest-point Voronoi diagram. Discussions focus on algorithms that use the furthest-point Voronoi diagram, intersection of a convex polygon and a halfplane, point insertion, convex hulls and polygons and their representations, and parallel algorithm for selection and computing convex hulls. The text then examines optimal convex decompositions, expected time analysis of algorithms in computational geometry, and practical use of bucketing techniques in computational geometry. The book takes a look at minimum decompositions of polygonal objects, framework for computational morphology, display of visible edges of a set of convex polygons, and implementation study of two algorithms for the minimum spanning circle problem. Topics include rolling algorithm, shape of point sets, and decomposition of rectilinear and simple polygons and polygons with holes. The selection is a valuable source of data for researchers interested in computational geometry.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Machine Intelligence and Pattern Recognition by Godfried T. Toussaint in PDF and/or ePUB format, as well as other popular books in Mathematics & Geometry. We have over one million books available in our catalogue for you to explore.

Information

Publisher
North Holland
Year
2014
Print ISBN
9780444878069
eBook ISBN
9781483257112
Topic
Mathematics
Subtopic
Geometry
Index
Mathematics

Table of contents

  1. Front Cover
  2. Computational Geometry
  3. Copyright Page
  4. Table of Contents
  5. Dedication
  6. PREFACE
  7. CHAPTER 1. OPTIMAL PARALLEL ALGORITHMS FOR SELECTION, SORTING AND COMPUTING CONVEX HULLS
  8. CHAPTER 2. SIMPLE ON-LINE ALGORITHMS FOR CONVEX POLYGONS
  9. CHAPTER 3. ON GEOMETRIC ALGORITHMS THAT USE THE FURTHEST-POINT VORONOI DIAGRAM
  10. CHAPTER 4. OPTIMAL CONVEX DECOMPOSITIONS
  11. CHAPTER 5. EXPECTED TIME ANALYSIS OF ALGORITHMS IN COMPUTATIONAL GEOMETRY
  12. Chapter 6. Practical Use of Bucketing Techniques in Computational Geometry
  13. Chapter 7. Minimum Decompositions of Polygonal Objects
  14. CHAPTER 8. A FRAMEWORK FOR COMPUTATIONAL MORPHOLOGY
  15. CHAPTER 9. DISPLAY OF VISIBLE EDGES OF A SET OF CONVEX POLYGONS
  16. CHAPTER 10. AN IMPLEMENTATION STUDY OF TWO ALGORITHMS FOR THE MINIMUM SPANNING CIRCLE PROBLEM
  17. Chapter 11. Curve Similarity via Signatures
  18. CHAPTER 12. A METHOD FOR PROVING LOWER BOUNDS FOR CERTAIN GEOMETRIC PROBLEMS
  19. CHAPTER 13. MOVABLE SEPARABILITY OF SETS
  20. Chapter 14. Computational Geometry and Motion Planning
  21. CHAPTER 15. AN ISOTHETIC VIEW OF COMPUTATIONAL GEOMETRY