서지주요정보
Twentieth Anniversary Volume: Discrete & Computational Geometry [electronic resource]
서명 / 저자 Twentieth Anniversary Volume: Discrete & Computational Geometry [electronic resource] / edited by Jacob E. Goodman, János Pach, Richard Pollack.
저자명 Goodman, Jacob E. editor. edt http://id.loc.gov/vocabulary/relators/edt ; Pach, János. editor. edt http://id.loc.gov/vocabulary/relators/edt ; Pollack, Richard. editor. edt http://id.loc.gov/vocabulary/relators/edt
단체명 SpringerLink (Online service)
발행사항 New York, NY : Springer New York : Imprint: Springer, 2009.
Online Access https://doi.org/10.1007/978-0-387-87363-3 URL

서지기타정보

서지기타정보
청구기호 QA639.5-640.7
판사항 1st ed. 2009.
형태사항 XVIII, 635 p. 212 illus. online resource.
언어 English
내용 There Are Not Too Many Magic Configurations -- Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles -- Robust Shape Fitting via Peeling and Grating Coresets -- Siegel’s Lemma and Sum-Distinct Sets -- Slicing Convex Sets and Measures by a Hyperplane -- A Centrally Symmetric Version of the Cyclic Polytope -- On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities -- Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres -- Isotopic Implicit Surface Meshing -- Line Transversals to Disjoint Balls -- Norm Bounds for Ehrhart Polynomial Roots -- Helly-Type Theorems for Line Transversals to Disjoint Unit Balls -- Grid Vertex-Unfolding Orthogonal Polyhedra -- Empty Convex Hexagons in Planar Point Sets -- Affinely Regular Polygons as Extremals of Area Functionals -- Improved Output-Sensitive Snap Rounding -- Generating All Vertices of a Polyhedron Is Hard -- Pure Point Diffractive Substitution Delone Sets Have the Meyer Property -- Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings -- Empty Simplices of Polytopes and Graded Betti Numbers -- Rigidity and the Lower Bound Theorem for Doubly Cohen–Macaulay Complexes -- Finding the Homology of Submanifolds with High Confidence from Random Samples -- Odd Crossing Number and Crossing Number Are Not the Same -- Visibility Graphs of Point Sets in the Plane -- Decomposability of Polytopes -- An Inscribing Model for Random Polytopes -- An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions -- General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties.
주제 Convex geometry .
Discrete geometry.
Discrete mathematics.
Algebraic geometry.
Computer science—Mathematics.
Computer graphics.
Computer mathematics.
Convex and Discrete Geometry. --https://scigraph.springernature.com/ontologies/product-market-codes/M21014
Discrete Mathematics. --https://scigraph.springernature.com/ontologies/product-market-codes/M29000
Algebraic Geometry. --https://scigraph.springernature.com/ontologies/product-market-codes/M11019
Discrete Mathematics in Computer Science. --https://scigraph.springernature.com/ontologies/product-market-codes/I17028
Computer Graphics. --https://scigraph.springernature.com/ontologies/product-market-codes/I22013
Computational Mathematics and Numerical Analysis. --https://scigraph.springernature.com/ontologies/product-market-codes/M1400X
보유판 및 특별호 저록 Springer Nature eBook
Printed edition: 9780387874234 Printed edition: 9780387873626
ISBN 9780387873633
기타 표준번호 10.1007/978-0-387-87363-3
QR CODE

책소개

전체보기

목차

전체보기

홈으로
닫기