Geometric Computing Handbook: Practical Computational Geometry Algorithms for Robust 2D/3D CAD, Robotics, Graphics & Mesh Processing - Softcover

Inhaltsangabe

Robust computational geometry belongs in the implementation, not an appendix…

Written by Lira Byte, Geometric Computing Handbook: Practical Computational Geometry Algorithms for Robust 2D/3D CAD, Robotics, Graphics & Mesh Processing connects geometric reasoning to implementation through a repeatable pattern: visual intuition, algorithm, code, failure cases, and validation. It treats numerical robustness as a core engineering concern, not an afterthought.

Inside, you’ll master:

• Robust predicates and orient2d
• Exact, filtered, and adaptive arithmetic
• Vectors, transforms, and coordinate frames
• Ray–triangle and plane intersections
• Closest-point and polygon-clipping recipes
• AABB, OBB, and BVH queries
• Mesh repair and manifold checks
• Winding, normals, holes, and self-intersections
• Scalable k-d trees and octrees
• CAD Boolean workflows
• Mesh, B-rep, CSG, and SDF trade-offs
• Collision detection with GJK/EPA
• Continuous collision detection
• Point clouds, reconstruction, and remeshing
• Spatial computing and geometric AI

Rather than demanding proof-heavy study or assuming perfect inputs, the handbook emphasizes practical explanations, diagrams, edge cases, and a workflow that can move from Python prototyping to modern C++. Its focus is not eliminating every tolerance; it is choosing numerical strategies deliberately and testing the decisions that affect topology and reliability.

If reliable CAD and mesh pipelines are the goal, put this handbook beside the codebase.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.