Practical Geometry Algorithms With C Code
Download Practical Geometry Algorithms With C Code PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Practical Geometry Algorithms With C Code book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Practical Geometry Algorithms
Author: Daniel Sunday, PhD
language: en
Publisher: Independently Published
Release Date: 2021-05-16
This book presents practical geometry algorithms with computationally fast C++ code implementations. It covers algorithms for fundamental geometric objects, such as points, lines, rays, segments, triangles, polygons, and planes. These algorithms determine the basic 2D and 3D properties, such as area, distance, inclusion, and intersections. There are also algorithms to compute bounding containers for these objects, including a fast bounding ball, various convex hull algorithms, as well as polygon extreme points and tangents. And there is a fast algorithm for polyline simplification using decimation that works in any dimension. These algorithms have been used in practice for several decades. They are robust, easy to understand, code, and maintain. And they execute very rapidly in practice, not just in theory. For example, the winding number point in polygon inclusion test, first developed by the author in 2000, is the fastest inclusion algorithm known, and works correctly even for non-simple polygons. Also, there is also a fast implementation of the Melkman algorithm for the convex hull of a simple polyline. And much more. If your programming involves geometry, this will be an invaluable reference.
Computational Geometry in C
Author: Joseph O'Rourke
language: en
Publisher: Cambridge University Press
Release Date: 1998-10-13
This is the revised and expanded 1998 edition of a popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The basic techniques used in computational geometry are all covered: polygon triangulations, convex hulls, Voronoi diagrams, arrangements, geometric searching, and motion planning. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research, making it a useful reference for practitioners at all levels. The second edition contains material on several new topics, such as randomized algorithms for polygon triangulation, planar point location, 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron. The code in this edition is significantly improved from the first edition (more efficient and more robust), and four new routines are included. Java versions for this new edition are also available. All code is accessible from the book's Web site (http://cs.smith.edu/~orourke/) or by anonymous ftp.
Computational Geometry and Computer Graphics in C++
This book provides an accessible introduction to methods in computational geometry and computer graphics. It emphasizes the efficient object-oriented implemenation of geometric methods with useable C++ code for all methods discussed.