Goodman, Jacob E.
Twentieth Anniversary Volume:
2. There Are Not Too Many Magic Configurations
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
3. Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles
Pankaj K. Agarwal, Rolf Klein, Christian Knauer, Stefan Langerman, Pat Morin, Micha Sharir, Michael Soss
4. Robust Shape Fitting via Peeling and Grating Coresets
Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
5. Siegel’s Lemma and Sum-Distinct Sets
Iskander Aliev
6. Slicing Convex Sets and Measures by a Hyperplane
Imre Bárány, Alfredo Hubard, Jesús Jerónimo
7. A Centrally Symmetric Version of the Cyclic Polytope
Alexander Barvinok, Isabella Novik
8. On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities
Saugata Basu, Thierry Zell
9. Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres
Louis J. Billera, Samuel K. Hsiao, J. Scott Provan
10. Isotopic Implicit Surface Meshing
Jean-Daniel Boissonnat, David Cohen-Steiner, Gert Vegter
11. Line Transversals to Disjoint Balls
Ciprian Borcea, Xavier Goaoc, Sylvain Petitjean
12. Norm Bounds for Ehrhart Polynomial Roots
Benjamin Braun
13. Helly-Type Theorems for Line Transversals to Disjoint Unit Balls
Otfried Cheong, Xavier Goaoc, Andreas Holmsen, Sylvain Petitjean
14. Grid Vertex-Unfolding Orthogonal Polyhedra
Mirela Damian, Robin Flatland, Joseph O’Rourke
15. Empty Convex Hexagons in Planar Point Sets
Tobias Gerken
16. Affinely Regular Polygons as Extremals of Area Functionals
Paolo Gronchi, Marco Longinetti
17. Improved Output-Sensitive Snap Rounding
John Hershberger
18. Generating All Vertices of a Polyhedron Is Hard
Leonid Khachiyan, Endre Boros, Konrad Borys, Vladimir Gurvich, Khaled Elbassioni
19. Pure Point Diffractive Substitution Delone Sets Have the Meyer Property
Jeong-Yup Lee, Boris Solomyak
20. Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
Ezra Miller, Igor Pak
21. Empty Simplices of Polytopes and Graded Betti Numbers
Uwe Nagel
22. Rigidity and the Lower Bound Theorem for Doubly Cohen–Macaulay Complexes
Eran Nevo
23. Finding the Homology of Submanifolds with High Confidence from Random Samples
Partha Niyogi, Stephen Smale, Shmuel Weinberger
24. Odd Crossing Number and Crossing Number Are Not the Same
Michael J Pelsmajer, Marcus Schaefer, Daniel Štefankovi?c
25. Visibility Graphs of Point Sets in the Plane
Florian Pfender
26. Decomposability of Polytopes
Krzysztof Przes?awski, David Yost
27. An Inscribing Model for Random Polytopes
Ross M. Richardson, Lei Wu, Van H. Vu
28. An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions
Yevgeny Schreiber, Micha Sharir
29. General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Jonathan Richard Shewchuk
Nyckelord: Mathematics, Algebraic Geometry, Computational Mathematics and Numerical Analysis, Computer Graphics, Discrete Mathematics in Computer Science, Convex and Discrete Geometry
- Författare
- Goodman, Jacob E.
- Pach, János
- Pollack, Richard
- Utgivare
- Springer
- Utgivningsår
- 2009
- Språk
- en
- Utgåva
- 1
- Sidantal
- 16 sidor
- Kategori
- Naturvetenskaper
- Format
- E-bok
- eISBN (PDF)
- 9780387873633