Computing in Euclidean Geometry

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.

List 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.

Product details

• Assisted by: Ding-Zhu Du (Editor), Frank Kwang Hwang (Editor), Frank Kwang-Ming Hwang (Editor)
• Publisher: World Scientific Publishing Company
• Languages: English
• Product format: Hardback
• Released: 01.09.1992
• EAN: 9789810209667
• ISBN: 978-981-02-0966-7
• No. of pages: 400
• Series: Lecture Notes Computing
• Subject: Natural sciences, medicine, IT, technology > IT, data processing > IT