Discrete and Computational Geometry

The Goodman-Pollack Festschrift (Algorithms and Combinatorics)

1 edition
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today


Buy this book

Last edited by MARC Bot
September 28, 2024 | History

Discrete and Computational Geometry

The Goodman-Pollack Festschrift (Algorithms and Combinatorics)

1 edition

This is an impressive collection of original research papers in discrete and computational geometry, contributed by many leading researchers in these fields, as a tribute to Jacob E. Goodman and Richard Pollack, two of the `founding fathers' of the area, on the occasion of their 2/3 x 100 birthdays. The topics covered by the 41 papers provide professionals and graduate students with a comprehensive presentation of the state of the art in most aspects of discrete and computational geometry, including geometric algorithms, arrangements, geometric graph theory and quantitative and algorithmic real algebraic geometry, with important connections to algebraic geometry, convexity, polyhedral combinatorics, and the theory of packing, covering, and tiling. The book will serve as an invaluable source of reference in this discipline, and an indispensible component of the library of anyone working in the above areas.

Publish Date
Publisher
Springer
Language
English
Pages
853

Buy this book

Previews available in: English

Edition Availability
Cover of: Discrete and Computational Geometry
Discrete and Computational Geometry: The Goodman-Pollack Festschrift
2012, Springer London, Limited
in English
Cover of: Discrete and Computational Geometry
Discrete and Computational Geometry: The Goodman-Pollack Festschrift
2012, Springer Berlin / Heidelberg
in English
Cover of: Discrete and Computational Geometry
Discrete and Computational Geometry: The Goodman-Pollack Festschrift (Algorithms and Combinatorics)
August 13, 2003, Springer
Hardcover in English - 1 edition

Add another edition?

Book Details


First Sentence

"The arrangement A( ) of a finite collection of curves or surfaces in Rd is the decomposition of the space into relatively open connected cells of dimensions 0,..., d induced by , where each cell is a maximal connected set of points lying in the intersection of a fixed subset of and avoiding all other elements of ."

Classifications

Library of Congress
QA167 .D57 2003, QA1-939

The Physical Object

Format
Hardcover
Number of pages
853
Dimensions
9.3 x 5.9 x 1.5 inches
Weight
3 pounds

ID Numbers

Open Library
OL9426863M
Internet Archive
discretecomputat00agar
ISBN 10
3540003711
ISBN 13
9783540003717
LCCN
2003054783
OCLC/WorldCat
52375130
Library Thing
7805106
Goodreads
1964262

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
September 28, 2024 Edited by MARC Bot import existing book
October 4, 2021 Edited by ImportBot import existing book
February 13, 2019 Created by MARC Bot import existing book