Jacob E. Goodman / Janos Pach / Emo Welzl (eds.)
Combinatorial and Computational Geometry
Herausgeber: Goodman, Jacob E.; Welzl, Emo; Pach, Janos
Schade – dieser Artikel ist leider ausverkauft. Sobald wir wissen, ob und wann der Artikel wieder verfügbar ist, informieren wir Sie an dieser Stelle.
Jacob E. Goodman / Janos Pach / Emo Welzl (eds.)
Combinatorial and Computational Geometry
Herausgeber: Goodman, Jacob E.; Welzl, Emo; Pach, Janos
- Gebundenes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
This 2005 book deals with current interest topics in Discrete and Algorithmic aspects of Geometry.
Andere Kunden interessierten sich auch für
This 2005 book deals with current interest topics in Discrete and Algorithmic aspects of Geometry.
Produktdetails
- Produktdetails
- Verlag: Cambridge University Press
- Seitenzahl: 630
- Erscheinungstermin: 8. Oktober 2012
- Englisch
- Abmessung: 240mm x 161mm x 38mm
- Gewicht: 1103g
- ISBN-13: 9780521848626
- ISBN-10: 0521848628
- Artikelnr.: 21918332
- Verlag: Cambridge University Press
- Seitenzahl: 630
- Erscheinungstermin: 8. Oktober 2012
- Englisch
- Abmessung: 240mm x 161mm x 38mm
- Gewicht: 1103g
- ISBN-13: 9780521848626
- ISBN-10: 0521848628
- Artikelnr.: 21918332
Jacob E. Goodman is a professor of Mathematics at City College, CUNY, and the author of a number of papers in Geometry. He is the co-founder and co-editor-in-chief of The Journal of Discrete and Computational Geometry. He is also the co-editor of many other leading books in the field, most notably, The Handbook of Discrete and Computational Geometry, published by CRC Press, whose second edition has just appeared, and several volumes published by the American Mathematical Society. A past winner of the MAA's Lester R. Ford award, Goodman was also the founder and first president of the New York Composers Circle. He is a member of the American Mathematical Society.
János Pach is a distinguished professor of Computer Science at City College, New York, Senior Research Fellow at the Mathematical Institute of the Hungarian Academy of Sciences, and Research Professor at New York University. His main fields of interest are Discrete and Computational Geometry, Convexity and Combinatorics. He has written more than 180 research papers. His book, Combinatorial Geometry (with Pankaj Agarwal) was published by Wiley in 1995. He serves on the editorial boards of seven professional journals. For his scientific achievements, he received the Grünwald medal from The János Bolyai Mathematical Society (1982), The Lester R. Ford award from The Mathematical Association of America (1990), The Rényi Prize, and the Academy Award from the Hungarian Academy of Sciences (1993, 1998).
Emo Welzl is a full professor of Computer Science at the Institute for Theoretical Computer Science of Eth Zurich. His research interests are in the Foundations of Computer Science, mainly Algorithms and Data Structures, in particular, Computational Geometry and Applications, Analysis of Geometric Structures, Randomized Methods, and Discrete Gometry. He was awarded the Max Planck Prize in 1992 and the Gottfried Wilhelm Leibniz Prize in 1995. He has been an ACM Fellow since 1998.
János Pach is a distinguished professor of Computer Science at City College, New York, Senior Research Fellow at the Mathematical Institute of the Hungarian Academy of Sciences, and Research Professor at New York University. His main fields of interest are Discrete and Computational Geometry, Convexity and Combinatorics. He has written more than 180 research papers. His book, Combinatorial Geometry (with Pankaj Agarwal) was published by Wiley in 1995. He serves on the editorial boards of seven professional journals. For his scientific achievements, he received the Grünwald medal from The János Bolyai Mathematical Society (1982), The Lester R. Ford award from The Mathematical Association of America (1990), The Rényi Prize, and the Academy Award from the Hungarian Academy of Sciences (1993, 1998).
Emo Welzl is a full professor of Computer Science at the Institute for Theoretical Computer Science of Eth Zurich. His research interests are in the Foundations of Computer Science, mainly Algorithms and Data Structures, in particular, Computational Geometry and Applications, Analysis of Geometric Structures, Randomized Methods, and Discrete Gometry. He was awarded the Max Planck Prize in 1992 and the Gottfried Wilhelm Leibniz Prize in 1995. He has been an ACM Fellow since 1998.
1. Geometric approximation via core sets Pankaj K. Agarwal, Sariel
Har-Peled and Kasturi Varadarajan; 2. Applications of graph and hypergraph
theory in geometry Imre Barany; 3. Convex geometry of orbits Alexander
Barvinok and Grigoriy Blekherman; 4. The Hadwiger transversal theorem for
pseudolines Saugata Basu, Jacob E. Goodman, Andreas Holmsen and Richard
Pollack; 5. Betti number bounds, applications, and algorithms Saugata Basu,
Richard Pollack and Marie-Francoise Roy; 6. Shelling and the h-vector of
the (extra-)ordinary polytope Margaret M. Bayer; 7. On the number of
mutually touching cylinders Andras Bezdek; 8. Edge-antipodal 3-polytopes
Karoly Bezdek, Tibor Bisztriczky and Karoly Boroczky; 9. A conformal energy
for simplicial surfaces Alexander Bobenko; 10. On the size of
higher-dimensional triangulations Peter Brass; 11. The carpenter's ruler
folding problem Gruia Calinescu and Adrian Dumitrescu; 12. A survey of
folding and unfolding in computational geometry Erik D. Demaine and Joseph
O'Rourke; 13. On the rank of a tropical matrix Mike Develin, Francisco
Santos and Bernd Sturmfels; 14. The geometry of biomolecular solvation
Herbert Edelsbrunner and Patrice Koehl; 15. Inequalities for zonotopes
Richard G. Ehrenborg; 16. Quasiconvex programming David Eppstein; 17. De
Concini-Procesi wonderful arrangement models - a discrete geometer's point
of view Eva Maria Feichtner; 18. Thinnest covering of a circle by eight,
nine, or ten congruent circles Gabor Fejes Toth; 19. On the complexity of
visibility problems with moving viewpoints Peter Gritzmann and Thorsten
Theobald; 20. Cylindrical partitions of convex bodies Aladar Heppes and
Wlodzimierz Kuperberg; 21. Tropical halfspaces Michael Joswig; 22. Two
proofs for Sylvester's problem using an allowable sequence of permutations
Hagit Last; 23. A comparison of five implementations of 3d Delaunay
tessellation Yuanxin Liu and Jack Snoeyink; 24. Bernstein's basis and real
root isolation Bernard Mourrain, Fabrice Rouillier and Marie-Francoise Roy;
25. On some extremal problems in combinatorial geometry Niranjan
Nilakantan; 26. A long non-crossing path among disjoint segments in the
plane Janos Pach and Rom Pinchasi; 27. On a generalization of Schoenhardt's
polyhedron Joerg Rambau; 28. On Hadwiger numbers of direct products of
convex bodies Istvan Talata; 29. Binary space partitions - recent
developments Csaba D. Toth; 30. Erdos-Szekeres theorem: upper bounds and
related results Geza Toth and Pavel Valtr; 31. On the pair-crossing number
Pavel Valtr; 32. Geometric random walks: a survey Santosh Vempala.
Har-Peled and Kasturi Varadarajan; 2. Applications of graph and hypergraph
theory in geometry Imre Barany; 3. Convex geometry of orbits Alexander
Barvinok and Grigoriy Blekherman; 4. The Hadwiger transversal theorem for
pseudolines Saugata Basu, Jacob E. Goodman, Andreas Holmsen and Richard
Pollack; 5. Betti number bounds, applications, and algorithms Saugata Basu,
Richard Pollack and Marie-Francoise Roy; 6. Shelling and the h-vector of
the (extra-)ordinary polytope Margaret M. Bayer; 7. On the number of
mutually touching cylinders Andras Bezdek; 8. Edge-antipodal 3-polytopes
Karoly Bezdek, Tibor Bisztriczky and Karoly Boroczky; 9. A conformal energy
for simplicial surfaces Alexander Bobenko; 10. On the size of
higher-dimensional triangulations Peter Brass; 11. The carpenter's ruler
folding problem Gruia Calinescu and Adrian Dumitrescu; 12. A survey of
folding and unfolding in computational geometry Erik D. Demaine and Joseph
O'Rourke; 13. On the rank of a tropical matrix Mike Develin, Francisco
Santos and Bernd Sturmfels; 14. The geometry of biomolecular solvation
Herbert Edelsbrunner and Patrice Koehl; 15. Inequalities for zonotopes
Richard G. Ehrenborg; 16. Quasiconvex programming David Eppstein; 17. De
Concini-Procesi wonderful arrangement models - a discrete geometer's point
of view Eva Maria Feichtner; 18. Thinnest covering of a circle by eight,
nine, or ten congruent circles Gabor Fejes Toth; 19. On the complexity of
visibility problems with moving viewpoints Peter Gritzmann and Thorsten
Theobald; 20. Cylindrical partitions of convex bodies Aladar Heppes and
Wlodzimierz Kuperberg; 21. Tropical halfspaces Michael Joswig; 22. Two
proofs for Sylvester's problem using an allowable sequence of permutations
Hagit Last; 23. A comparison of five implementations of 3d Delaunay
tessellation Yuanxin Liu and Jack Snoeyink; 24. Bernstein's basis and real
root isolation Bernard Mourrain, Fabrice Rouillier and Marie-Francoise Roy;
25. On some extremal problems in combinatorial geometry Niranjan
Nilakantan; 26. A long non-crossing path among disjoint segments in the
plane Janos Pach and Rom Pinchasi; 27. On a generalization of Schoenhardt's
polyhedron Joerg Rambau; 28. On Hadwiger numbers of direct products of
convex bodies Istvan Talata; 29. Binary space partitions - recent
developments Csaba D. Toth; 30. Erdos-Szekeres theorem: upper bounds and
related results Geza Toth and Pavel Valtr; 31. On the pair-crossing number
Pavel Valtr; 32. Geometric random walks: a survey Santosh Vempala.
1. Geometric approximation via core sets Pankaj K. Agarwal, Sariel
Har-Peled and Kasturi Varadarajan; 2. Applications of graph and hypergraph
theory in geometry Imre Barany; 3. Convex geometry of orbits Alexander
Barvinok and Grigoriy Blekherman; 4. The Hadwiger transversal theorem for
pseudolines Saugata Basu, Jacob E. Goodman, Andreas Holmsen and Richard
Pollack; 5. Betti number bounds, applications, and algorithms Saugata Basu,
Richard Pollack and Marie-Francoise Roy; 6. Shelling and the h-vector of
the (extra-)ordinary polytope Margaret M. Bayer; 7. On the number of
mutually touching cylinders Andras Bezdek; 8. Edge-antipodal 3-polytopes
Karoly Bezdek, Tibor Bisztriczky and Karoly Boroczky; 9. A conformal energy
for simplicial surfaces Alexander Bobenko; 10. On the size of
higher-dimensional triangulations Peter Brass; 11. The carpenter's ruler
folding problem Gruia Calinescu and Adrian Dumitrescu; 12. A survey of
folding and unfolding in computational geometry Erik D. Demaine and Joseph
O'Rourke; 13. On the rank of a tropical matrix Mike Develin, Francisco
Santos and Bernd Sturmfels; 14. The geometry of biomolecular solvation
Herbert Edelsbrunner and Patrice Koehl; 15. Inequalities for zonotopes
Richard G. Ehrenborg; 16. Quasiconvex programming David Eppstein; 17. De
Concini-Procesi wonderful arrangement models - a discrete geometer's point
of view Eva Maria Feichtner; 18. Thinnest covering of a circle by eight,
nine, or ten congruent circles Gabor Fejes Toth; 19. On the complexity of
visibility problems with moving viewpoints Peter Gritzmann and Thorsten
Theobald; 20. Cylindrical partitions of convex bodies Aladar Heppes and
Wlodzimierz Kuperberg; 21. Tropical halfspaces Michael Joswig; 22. Two
proofs for Sylvester's problem using an allowable sequence of permutations
Hagit Last; 23. A comparison of five implementations of 3d Delaunay
tessellation Yuanxin Liu and Jack Snoeyink; 24. Bernstein's basis and real
root isolation Bernard Mourrain, Fabrice Rouillier and Marie-Francoise Roy;
25. On some extremal problems in combinatorial geometry Niranjan
Nilakantan; 26. A long non-crossing path among disjoint segments in the
plane Janos Pach and Rom Pinchasi; 27. On a generalization of Schoenhardt's
polyhedron Joerg Rambau; 28. On Hadwiger numbers of direct products of
convex bodies Istvan Talata; 29. Binary space partitions - recent
developments Csaba D. Toth; 30. Erdos-Szekeres theorem: upper bounds and
related results Geza Toth and Pavel Valtr; 31. On the pair-crossing number
Pavel Valtr; 32. Geometric random walks: a survey Santosh Vempala.
Har-Peled and Kasturi Varadarajan; 2. Applications of graph and hypergraph
theory in geometry Imre Barany; 3. Convex geometry of orbits Alexander
Barvinok and Grigoriy Blekherman; 4. The Hadwiger transversal theorem for
pseudolines Saugata Basu, Jacob E. Goodman, Andreas Holmsen and Richard
Pollack; 5. Betti number bounds, applications, and algorithms Saugata Basu,
Richard Pollack and Marie-Francoise Roy; 6. Shelling and the h-vector of
the (extra-)ordinary polytope Margaret M. Bayer; 7. On the number of
mutually touching cylinders Andras Bezdek; 8. Edge-antipodal 3-polytopes
Karoly Bezdek, Tibor Bisztriczky and Karoly Boroczky; 9. A conformal energy
for simplicial surfaces Alexander Bobenko; 10. On the size of
higher-dimensional triangulations Peter Brass; 11. The carpenter's ruler
folding problem Gruia Calinescu and Adrian Dumitrescu; 12. A survey of
folding and unfolding in computational geometry Erik D. Demaine and Joseph
O'Rourke; 13. On the rank of a tropical matrix Mike Develin, Francisco
Santos and Bernd Sturmfels; 14. The geometry of biomolecular solvation
Herbert Edelsbrunner and Patrice Koehl; 15. Inequalities for zonotopes
Richard G. Ehrenborg; 16. Quasiconvex programming David Eppstein; 17. De
Concini-Procesi wonderful arrangement models - a discrete geometer's point
of view Eva Maria Feichtner; 18. Thinnest covering of a circle by eight,
nine, or ten congruent circles Gabor Fejes Toth; 19. On the complexity of
visibility problems with moving viewpoints Peter Gritzmann and Thorsten
Theobald; 20. Cylindrical partitions of convex bodies Aladar Heppes and
Wlodzimierz Kuperberg; 21. Tropical halfspaces Michael Joswig; 22. Two
proofs for Sylvester's problem using an allowable sequence of permutations
Hagit Last; 23. A comparison of five implementations of 3d Delaunay
tessellation Yuanxin Liu and Jack Snoeyink; 24. Bernstein's basis and real
root isolation Bernard Mourrain, Fabrice Rouillier and Marie-Francoise Roy;
25. On some extremal problems in combinatorial geometry Niranjan
Nilakantan; 26. A long non-crossing path among disjoint segments in the
plane Janos Pach and Rom Pinchasi; 27. On a generalization of Schoenhardt's
polyhedron Joerg Rambau; 28. On Hadwiger numbers of direct products of
convex bodies Istvan Talata; 29. Binary space partitions - recent
developments Csaba D. Toth; 30. Erdos-Szekeres theorem: upper bounds and
related results Geza Toth and Pavel Valtr; 31. On the pair-crossing number
Pavel Valtr; 32. Geometric random walks: a survey Santosh Vempala.