Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
de Berg M., van Kreveld M., Overmars M. — Computational Geometry : Algorithms and applications
de Berg M., van Kreveld M., Overmars M. — Computational Geometry : Algorithms and applications



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Computational Geometry : Algorithms and applications

Авторы: de Berg M., van Kreveld M., Overmars M.

Аннотация:

This well-accepted introduction to computational geometry is a textbook for high-level undergraduate and low-level graduate courses. The focus is on algorithms and hence the book is well suited for students in computer science and engineering. Motivation is provided from the application areas: all solutions and techniques from computational geometry are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. For students this motivation will be especially welcome. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement. All the basic techniques and topics from computational geometry, as well as several more advanced topics, are covered. The book is largely self-contained and can be used for self-study by anyone with a basic background in algorithms. In the second edition, besides revisions to the first edition, a number of new exercises have been added.


Язык: en

Рубрика: Математика/Алгебра/Комбинаторика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Издание: second edition

Год издания: 2000

Количество страниц: 379

Добавлена в каталог: 14.11.2004

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Slab      122 227
SLOWCONVEXHULL      3
Smallest enclosing ball      91
Smallest enclosing disc      86
Smallest enclosing ellipse      91
Solution, feasible      72
Split free      257
Split vertex      50
Stabber      181 182
Stabbing counting query      229
Stabbing number of polygon      61
Stabbing query      229
Star-shaped polygon      93 145
Start vertex      50
Status of sweep line      22 25 52 155 312
Status structure      25 52 155 312
Steiner point      206 293
Steiner triangulation      293
Strictly monotone polygon      56
Structural change      197 202 242
Subdivision      30 121
Subdivision quadtree      294
Subdivision, complexity of      30
Subdivision, connected      30
Subdivision, maximal planar      185
Subdivision, overlay      33
Subdivision, representation of      30
Sum of two points      275
Sum vector      275
Sum, Minkowski      275
Supersampling      166
Sweep algorithm      22 34 51 68 152 312
Sweep algorithm, rotational      312
Sweep line      22 51 152
Symbolic perturbation      9 14
Tail estimate      140
Terrain      183
Terrain, domain of      183
Terrain, polyhedral      184
Tetrahedralization of polytope      60
Thales’ Theorem      186
Thematic map layer      79 319
Thematic map overlay      20
Top facet      64
Trading area      147
Transform duality      169
Transform inversion      179
Transform shear      138
Translating polygon, configuration space of      275
Translating polygon, configuration-space obstacle for      275
Transversal      181 182
Trapezoidal decomposition      124
Trapezoidal map      122 124 271 308
Trapezoidal map computation      128
Trapezoidal map of the free space      271 308
Trapezoidal map pseudo code      129
Trapezoidal map, complexity of      127
TRAPEZOIDALMAP      129
Traveling salesman problem      209
Tree, 1-dimensional range      99
Tree, binary search      96
Tree, binary space partition      253 254
Tree, BSP      253 254
Tree, cutting      330
Tree, heap      219
Tree, interval      212 214 229
Tree, partition      320 322
Tree, priority search      218 229
Tree, range      105 109
Tree, segment      223 225 229
Triangle, well-shaped      292
Triangular mesh      292
Triangular range query      320
Triangulated polygon dual graph      47
Triangulated polygon, 3-coloring      47 59
TRIANGULATEMONOTONEPOLYGON      57
Triangulation computation      49 55
Triangulation lower bound      59
Triangulation minimum weight      207 210
Triangulation of monotone polygon      55
Triangulation of point set      184 185
Triangulation of polygon      45 46
Triangulation pseudo code      53 57
Triangulation refinement, point location by      143
Triangulation, Delaunay      189
Triangulation, legal      187
Triangulation, Steiner      293
Turn vertex      49
Twin of half-edge      31
Unbounded linear program      73 80
Uniform mesh      293
Union of polygons      39
Upper Bound Theorem      248
Upper envelope      246
Upper hull      6 245
Upper vertical extension      124
Vector, sum      275
Vertex      30
Vertex, inner      309
Vertex, isolated      31
Vertex, optimal      73
Vertex, record of      32
Vertical decomposition      124
Vertical extension      124
Vertical extension lower      124
Vertical extension upper      124
Viewing volume      212
Visibility edge      309
Visibility graph      307
Visibility graph computation      310
Visibility graph pseudo code      310
Visibility, complex      316
Visible      313
Visible region      61 239
VISIBLEVERTICES      312
VlSIBILITYGRAPH      310
Voronoi assignment model      148
Voronoi cell      149
Voronoi diagram      1 147 148 247
Voronoi diagram computation      151
Voronoi diagram lower bound      162
Voronoi diagram pseudo code      157
Voronoi diagram skeleton      162
Voronoi diagram, abstract      161
Voronoi diagram, complexity of      150 161
Voronoi diagram, degenerate cases      159
Voronoi diagram, farthest-point      162
Voronoi diagram, higher-order      162
Voronoi diagram, medial axis      162
Voronoi diagram, power diagram      161
Voronoi diagram, weighted      161
Voronoi diagram. order-k      162 180
VORONOIDIAGRAM      158
Weighted Voronoi diagram      161
Well-shaped triangle      292
Window      211 319
Window system      122
Windowing query      211 319
Work space      268 308
y-monotone polygon      49
z-buffer algorithm      252
Zone of hyperplane      179
Zone of line      175 261
Zone Theorem      176 179
1 2 3
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте