Handbook of Discrete and Computational Geometry
Series: Discrete Mathematics and Its Applications; 20;
- Publisher's listprice GBP 97.00
-
46 341 Ft (44 135 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 4 634 Ft off)
- Discounted price 41 708 Ft (39 722 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
46 341 Ft
Availability
Out of print
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 1
- Publisher CRC Press
- Date of Publication 15 July 1997
- ISBN 9780849385247
- Binding Hardback
- No. of pages1008 pages
- Size 254x177 mm
- Weight 1884 g
- Language English
- Illustrations 169 Tables, black & white 0
Categories
Short description:
While much information can be found on discrete and computational geometry, it is scattered among many sources. The Handbook of Discrete and Computational Geometry brings together all of the major results in both these fields into one volume. Thousands of results, theorems, algorithms, and tables definitively cover the field, while numerous applications from many different fields demonstrate practical usage. The material is readily accessible to the novice, but offers enough depth to appeal to the specialist. Every technical term is defined in an easy-to-use glossary. Over 200 figures illustrate the concepts presented and provide supporting examples.
MoreLong description:
Jacob E. Goodman, co-founder and editor of Discrete & Computational Geometry, the preeminent journal on this area in the international mathematics and computer science community, joins forces with the distinguished computer scientist Joseph O'Rourke and other well-known authorities to produce the definitive handbook on these two interrelated fields.
Over the past decade or so, researchers and professionals in discrete geometry and the newer field of computational geometry have developed a highly productive collaborative relationship, where each area benefits from the methods and insights of the other. At the same time that discrete and computational geometry are becoming more closely identified, applications of the results of this work are being used in an increasing number of widely differing areas, from computer graphics and linear programming to manufacturing and robotics. The authors have answered the need for a comprehensive handbook
for workers in these and related fields, and for other users of the body of results.
While much information can be found on discrete and computational geometry, it is scattered among many sources, and individual books and articles are often narrowly focused. Handbook of Discrete and Computational Geometry brings together, for the first time, all of the major results in both these fields into one volume. Thousands of results - theorems, algorithms, and tables - throughout the volume definitively cover the field, while numerous applications from many different fields demonstrate practical usage. The material is presented clearly enough to assist the novice, but in enough depth to appeal to the specialist. Every technical term is clearly defined in an easy-to-use glossary. Over 200 figures illustrate the concepts presented and provide supporting examples. Information on current geometric software - what it does, how efficiently it does it, and where to find it - is also included.
Jacob E. Goodman, co-founder and editor of Discrete & Computational Geometry, the preeminent journal on this area in the international mathematics and computer science community, joins forces with the distinguished computer scientist Joseph O'Rourke and other well-known authorities to produce the definitive handbook on these two interrelated fields.
Over the past decade or so, researchers and professionals in discrete geometry and the newer field of computational geometry have developed a highly productive collaborative relationship, where each area benefits from the methods and insights of the other. At the same time that discrete and computational geometry are becoming more closely identified, applications of the results of this work are being used in an increasing number of widely differing areas, from computer graphics and linear programming to manufacturing and robotics. The authors have answered the need for a comprehensive handbook
for workers in these and related fields, and for other users of the body of results.
While much information can be found on discrete and computational geometry, it is scattered among many sources, and individual books and articles are often narrowly focused. Handbook of Discrete and Computational Geometry brings together, for the first time, all of the major results in both these fields into one volume. Thousands of results - theorems, algorithms, and tables - throughout the volume definitively cover the field, while numerous applications from many different fields demonstrate practical usage. The material is presented clearly enough to assist the novice, but in enough depth to appeal to the specialist. Every technical term is clearly defined in an easy-to-use glossary. Over 200 figures illustrate the concepts presented and provide supporting examples. Information on current geometric software - what it does, how efficiently it does it, and where to find it - is also included.
Table of Contents:
Finite point configurations
Packing and covering
Tilings
Helly-type theorems and geometric transversals
Pseudoline arrangements
Oriented matroids
Lattice points and lattice polytopes
Euclidean Ramsey theory
Discrete aspects of stochastic geometry
Geometric discrepancy theory and uniform distribution
Topological methods
Polyominoes
Basic properties of convex polytopes
Subdivisions and triangulations of polytopes
Face numbers of polytopes and complexes
Symmetry of polytopes and polyhedra
Polytope skeletons and paths
Polyhedral maps
Convex hull computations
Voronoi diagrams and Delaunay triangulations
Arrangements
Triangulations
Polygons
Shortest paths and networks
Visibility
Geometric reconstruction problems
Computational convexity
Computational topology
Computational real algebraic geometry
Point location
Range searching
Ray shooting and lines in space
Geometric intersection
Randomized algorithms
Robust geometric computation
Parallel algorithms in geometry
Parametric search
Linear programming in low dimensions
Mathematical programming
Algorithmic motion planning
Robotics
Computer graphics
Pattern recognition
Graph drawing
Splines and geometric modeling
Manufacturing processes
Solid modeling
Geometric applications of the Grassmann-Cayley algebra
Rigidity and scene analysis
Sphere packing and coding theory
Crystals and quasicrystals
Computational geometry software
Handbook of Discrete and Computational Geometry
46 341 HUF
41 708 HUF
