Skip to:Content
|
Bottom
Cover image for Combinatorial and computational geometry
Title:
Combinatorial and computational geometry
Series:
Mathematical Sciences Research Institute publications ; 52
Publication Information:
Cambridge : Cambridge University Press, 2005
ISBN:
9780521848626

Available:*

Library
Item Barcode
Call Number
Material Type
Item Category 1
Status
Searching...
30000004599423 QA640.7 C66 2005 Open Access Book Book
Searching...

On Order

Summary

Summary

During the past few decades, the gradual merger of Discrete Geometry and the newer discipline of Computational Geometry has provided enormous impetus to mathematicians and computer scientists interested in geometric problems. This volume, which contains 32 papers on a broad range of topics of current interest in the field, is an outgrowth of that synergism. It includes surveys and research articles exploring geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension.


Table of Contents

P. K. Agarwal and S. Har-Peled and K. R. VaradarajanImre BaranyAlexander Barvinok and Grigoriy BlekhermanSaugata Basu and Jacob E. Goodman and Andreas Holmsen and Richard PollackSaugata Basu and Richard Pollack and Marie-Francoise RoyMargaret M. BayerAndras BezdekKaroly Bezdek and Tibor Bisztriczky and Karoly BoroczkyAlexander BobenkoPeter BrassGruia Calinescu and Adrian DumitrescuErik D. Demaine and Joseph O'RourkeMike Develin and Francisco Santos and Bernd SturmfelsHerbert Edelsbrunner and Patrice KoehlRichard EhrenborgDavid EppsteinEva Maria FeichtnerGabor Fejes TothPeter Gritzmann and Thorsten TheobaldAladar Heppes and Wlodzimierz KuperbergMichael JoswigHagit LastYuanxin Liu and Jack SnoeyinkBernard Mourrain and Fabrice Rouillier and Marie-Francoise RoyNiranjan NilakantanJanos Pach and Rom PinchasiJorg RambauIstvan TalataCsaba D. TothGeza Toth and Pavel ValtrPavel ValtrSantosh Vempala
Prefacep. xi
Geometric Approximation via Coresetsp. 1
Applications of Graph and Hypergraph Theory in Geometryp. 31
Convex Geometry of Orbitsp. 51
The Hadwiger Transversal Theorem for Pseudolinesp. 79
Betti Number Bounds, Applications and Algorithmsp. 87
Shelling and the h-Vector of the (Extra)ordinary Polytopep. 97
On the Number of Mutually Touching Cylindersp. 121
Edge-Antipodal 3-Polytopesp. 129
A Conformal Energy for Simplicial Surfacesp. 135
On the Size of Higher-Dimensional Triangulationsp. 147
The Carpenter's Ruler Folding Problemp. 155
A Survey of Folding and Unfolding in Computational Geometryp. 167
On the Rank of a Tropical Matrixp. 213
The Geometry of Biomolecular Solvationp. 243
Inequalities for Zonotopesp. 277
Quasiconvex Programmingp. 287
De Concini-Procesi Wonderful Arrangement Models: A Discrete Geometer's Point of Viewp. 333
Thinnest Covering of a Circle by Eight, Nine, or Ten Congruent Circlesp. 361
On the Complexity of Visibility Problems with Moving Viewpointsp. 377
Cylindrical Partitions of Convex Bodiesp. 399
Tropical Halfspacesp. 409
Two Proofs for Sylvester's Problem Using an Allowable Sequence of Permutationsp. 433
A Comparison of Five Implementations of 3D Delaunay Tessellationp. 439
The Bernstein Basis and Real Root Isolationp. 459
Extremal Problems Related to the Sylvester-Gallai Theoremp. 479
A Long Noncrossing Path Among Disjoint Segments in the Planep. 495
On a Generalization of Schonhardt's Polyhedronp. 501
On Hadwiger Numbers of Direct Products of Convex Bodiesp. 517
Binary Space Partitions: Recent Developmentsp. 529
The Erdos-Szekeres Theorem: Upper Bounds and Related Resultsp. 557
On the Pair-Crossing Numberp. 569
Geometric Random Walks: A Surveyp. 577
Go to:Top of Page