Computing in Euclidean geometry
Author(s)
Bibliographic Information
Computing in Euclidean geometry
（Lecture notes series on computing, v. 1）
World Scientific, c1992
Available at / 28 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references
Description and Table of Contents
Description
This book is a collection of surveys and exploratory articles about recent developments in the field of computational Euclidean geometry. The topics covered are: a history of Euclidean geometry, Voronoi diagrams, randomized geometric algorithms, computational algebra; triangulations, machine proofs, topological designs, finite-element mesh, computer-aided geometric designs and steiner trees. Each chapter is written by a leading expert in the field and together they provide a clear and authoritative picture of what computational Euclidean geometry is and the direction in which research is going.
Table of Contents
- Mesh generation and optimal triangulation, M. Bern and D. Eppstein
- machine proofs of geometry theorems, S.C. Chou and M. Rethi
- randomized geometric algorithms, K. Clarkson
- Voronoi diagrams and Delanney triangulations, S. Fortune
- the state of art on Steiner ratio problems, D-Z. Du and F. Hwang
- on the development of quantitative geometry from Pythagoras to Grassmann, W-Y. Hsiang
- computational geometry and topological network designs, J. Smith and P. Winter
- polar forms and triangular B-spline surfaces, H-P. Seidel
- algebraic foundations of computational geometry, Chee Yap.
by "Nielsen BookData"