11.7 exercises
12 binary space partitions
   the painter's algorithm
    12.1 the definition of bsp trees
    12.2 bsp trees and the painter's algorithm
    12.3 constructing a bsp tree
    12.4' the size of bsp trees in 3-space
    12.5 bsp trees for low-density scenes
    12.6 notes and comments
    12.7 exercises
13 robot motion planning
    getting where you want to be
    13.1 work space and configuration space
    13.2 a point robot
    13.3 minkowski sums
    13.4 translational motion planning
    13.5' motion planning with rotations
    13.6 notes and comments
    13.7 exercises
14 quadtrees
    non-uniform mesh generation
    14.1 uniform and non-uniform meshes
    14.2 quadtrees for point sets
    14.3 from quadtrees to meshes
    14.4 notes and comments
    14.5 exercises
15 visibility graphs
    finding the shortest route
    15.1 shortest paths for a point robot
    15.2 computing the visibility graph
    15.3 shortest paths for a translating polygonalrobot
    15.4 notes and comments
    15.5 exercises
16 simplex range searching
    windowing revisited
    16.1 partition trees
    16.2 multi-level partition trees
    16.3 cutting trees
    16.4 notes and comments
    16.5 exercises
bibliography
index

计算几何-第3版 节选

《计算几何(第3版)》由世界图书出版公司北京公司出版。

 2/2   首页 上一页 1 2

自然科学 数学 几何与拓扑

在线阅读