CHAPTER 13 COMPUTATIONAL GEOMETRY TOPICS
The field of computational geometry is quite large and is one of the most rapidly advancing fields in recent times. This chapter is by no means comprehensive. The general topics covered are binary space-partitioning (BSP) trees in two and three dimensions, point-in-polygon and point-in-polyhedron tests, convex hulls of finite point sets, Delaunay triangulation in two and three dimensions, partitioning of polygons into convex pieces or triangles, containment of point sets by circles or oriented boxes in two dimensions and by spheres or oriented boxes in three dimensions, area calculations of polygons, and volume calculations of polyhedra.
The emphasis is, of course, on algorithms to implement the various ...
Get Geometric Tools for Computer Graphics now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
