Computational geometry. Algorithms and applications. (Q4947407)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1433426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational geometry. Algorithms and applications. |
scientific article; zbMATH DE number 1433426 |
Statements
18 April 2000
0 references
computational geometry
0 references
polygon partitioning
0 references
convex hulls
0 references
Delaunay triangulation
0 references
Voronoi diagrams
0 references
arrangement of lines
0 references
geometric searching
0 references
motion planning
0 references
visibility
0 references
0.8462950587272644
0 references
0.8204048871994019
0 references
0.8061144948005676
0 references
Computational geometry. Algorithms and applications. (English)
0 references
This second edition is largely the same as the first edition (1997; Zbl 0877.68001); most changes are corrections of small errors. First of all, we went carefully over all the exercises, reformulating or removing some old ones and adding a number of new ones. Secondly, larger revisions have occurred in Chapter 4 (where the treatment of unbounded linear programs is different) and in Chapter 7 (where several details in the algorithm have changed).
0 references
