Зарегистрироваться
Восстановить пароль
FAQ по входу

Mount D.M. Computational Geometry

  • Файл формата pdf
  • размером 961,06 КБ
  • Добавлен пользователем
  • Описание отредактировано
Mount D.M. Computational Geometry
University of Maryland, 2002, -122 pp.
Курс лекций.
Fixed-Radius Near Neighbors and Geometric Basics
Orientations and Convex Hulls
More Convex Hull Algorithms
Line Segment Intersection
Planar Graphs, Polygons and Art Galleries
Polygon Triangulation
Halfplane Intersection
Linear Programming
More Linear Programming and Smallest Enclosing Disk
Orthogonal Range Searching and kd-Trees
Orthogonal Range Trees
Hereditary Segment Trees and Red-Blue Intersection
Planar Point Location and Trapezoidal Maps
More on Planar Point Location
Voronoi Diagrams and Fortune’s Algorithm
Delaunay Triangulations
Delaunay Triangulations: Incremental Construction
Line Arrangements
Applications of Arrangements
Shortest Paths and Visibility Graphs
Motion Planning
DCEL’s and Subdivision Intersection
Interval Trees
Kirkpatrick’s Planar Point Location
Lower Bound for Convex Hulls
Voronoi Diagrams
Delaunay Triangulations and Convex Hulls
Topological Plane Sweep
  • Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.
  • Регистрация