Handbook of Discrete and Computational Geometry

Regular price €341.00
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
advanced discrete geometry research
Age Group_Uncategorized
Age Group_Uncategorized
Alexander Barvinok
Alexandr Andoni
Anastasios Sidiropoulos
Anders Bjorner
Andreas Holmsen
Andrew J. Blumberg
automatic-update
B01=Csaba D. Toth
B01=Jacob E. Goodman
B01=Joseph O'Rourke
Benjamin Lorenz
Bernd Gartner
Bernd Schulze
Bernd Schulze NA
Betti Numbers
Bhubaneswar Mishra
Carl W. Lee
Category1=Non-Fiction
Category=PBM
Category=PBV
Category=PBW
Chandrjit L. Bajaj
Chee K. Yap
Christoph M. Hoffmann
combinatorial optimization
Computational Geometry
Configuration Space
Constrained Delaunay Triangulation
convex
Convex Bodies
Convex Hull
Convex Polygon
Convex Polyhedra
Convex Polytope
COP=United States
Csaba D. Tth
D. Schattschneider
D.A. Klarner
Dan Halperin
Davenport Schinzel Sequence
David Dobkin
David M. Mount
delaunay
Delaunay Triangulation
Delivery_Delivery within 10-20 working days
diagram
Dinesh Manocha
Dmitriy Morozov
E. Harriss
Edgar Ramos
Egon Schulte
Emilio Di Giacomo
Emo Welzl
eq_isMigrated=2
eq_nobargain
Eric Colin de Verdiere
Erik D. Demaine
Francisco Santos
Frederic Chazal
G. Barequet
G.T. Toussaint
geometric data analysis
geometric graph theory
Gil Kalai
Giuseppe Liotte
Gr Fejes Tth
Gunter M. Ziegler
Herbert Edelsbrunner
hull
J. Ralph Alexander
Jack Snoeyink
Jacob E. Goodman
Jeff M. Phillips
Jiri Matousek
Jonathan R. Shewchuk
Joseph O'Rourke
Joseph S.B. Mitchell
Js Pach
Jurgen Richter-Gebert
Jzsef Beck
Kasturi Varadarajan
Ketan Mulmuley
Kiril Solovey
Language_English
lattice point enumeration
Leonidas J Guibas
Louis J. Billera
Lutz Kettner
Lydia E. Kavraki
M. Hubert
M. Senechal
M. van Kreveld NA
Marcel Roeloffzen
Marco Pellegrini
Marjorie Senechal NA
Marshall Bern
Martin Dyer
Martin Henk
Matthew Kahle
Metric Space
Micha Sharir
Michael Hoffmann
Michael Joswig
Michael T. Goodrich
Ming C. Lin
Minkowski Sum
molecular modeling applications
motion planning algorithms
N.L. White
Nabil H. Mustafa
Nimrod Megiddo
Nina Amenta
Nodari Sitchinava
Oren Salzman
Oriented Matroid
Otfried Cheong
PA=Available
Pankaj K. Agarwal
Patrice Koehl
Persistent Homology
Peter Gritzmann
Peter J. Rousseeuw
Piotr Indyk
polygon
polyhedra
polytope
Price_€100 and above
PS=Active
Pseudoline Arrangements
R.L. Graham NA
Rade T. Zivaljevic
Raimund Seidel
Relative Neighborhood Graph
Rephael Wenger
Robert Connelly
Roberto Tamassia
Rolf Schneider
Running Time
S.W. Golomb
Saugata Basu
Semialgebraic Set
Seth Teller
simple
Simple Polygon
Simplicial Complex
Simplicial Polytopes
softlaunch
Stefan Felsner
Stefan Naher
Steven Fortune
Steven S. Skiena
Subhash Suri
Tamal K. Dey
Topological Data Analysis
triangulation
Ulrich Brehm
Vadim Shapiro
Victor Klee
Vikram Sharma
voronoi
Voronoi Cell
Voronoi Diagrams
Walter Whiteley
William W.L. Chen
Yann Disser
Young J. Kim

Product details

  • ISBN 9781498711395
  • Weight: 3780g
  • Dimensions: 178 x 254mm
  • Publication Date: 09 Nov 2017
  • Publisher: Taylor & Francis Inc
  • Publication City/Country: US
  • Product Form: Hardback
  • Language: English
Secure checkout Fast Shipping Easy returns

The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields.

The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world—as researchers in mathematics and computer science—and in the professional world—as practitioners in fields as diverse as operations research, molecular biology and robotics.

Discrete geometry has contributed significantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young field of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook.

A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography.

Csaba D. Toth is a professor of mathematics at Cal State Northridge, located in the city of Los Angeles, and a visiting professor of computer science at Tufts University in the Boston metro area. He is the author of more than 90 papers in discrete and computational geometry. His main research interests are in hierarchical subdivisions in low-dimensional spaces, topological graph theory, and geometric optimization.

Joseph O'Rourke is professor of Computer Science and of Mathematics at Smith College, and director of the Statistical and Data Science program. His research is in computational geometry, developing algorithms for geometric computations. He has authored or coauthored five books besides this Handbook. His most recent book, "How To Fold It," is written for high-school students.

Jacob E. Goodman is, along with Richard Pollack, a Founding Editor of the journal "Discrete & Computational Geometry." He retired from City College, C.U.N.Y. in 2008. The author of over 60 papers in algebraic geometry, combinatorics, and discrete geometry, he has spent most of his time since his retirement composing music and working on a mystery novel. Goodman received the Lester R. Ford Award from the MAA in 1990, and is a Fellow of the AMS.