| Tag |
First Indicator |
Second Indicator |
Subfields |
| LEADER |
00000cam a2200000Ma 4500 |
| 001 |
in00003553349 |
| 006 |
m o d |
| 007 |
cr cn||||||||| |
| 008 |
030529s2003 gw a ob 010 0 eng d |
| 005 |
20260421164742.4 |
| 020 |
|
|
|a 9783642555664 (electronic bk.)
|
| 020 |
|
|
|a 3642555667 (electronic bk.)
|
| 020 |
|
|
|z 3540003711 (acid-free paper)
|
| 020 |
|
|
|z 9783642624421
|
| 035 |
|
|
|a (OCoLC)828736591
|
| 040 |
|
|
|a E7B
|b eng
|e pn
|c E7B
|d OCLCO
|d OCLCQ
|d GW5XE
|d OCLCQ
|d OCLCF
|d OCLCO
|d UtOrBLW
|
| 049 |
|
|
|a TXAM
|
| 050 |
|
4 |
|a QA167
|b .D57 2003eb
|
| 082 |
0 |
4 |
|a 516/.13
|2 21
|
| 245 |
0 |
0 |
|a Discrete and computational geometry :
|b the Goodman-Pollack festschrift /
|c Boris Aronov [and others], editors.
|
| 264 |
|
1 |
|a Berlin ;
|a New York :
|b Springer,
|c [2003]
|
| 264 |
|
4 |
|c ©2003
|
| 300 |
|
|
|a 1 online resource (xii, 853 pages) :
|b illustrations.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Algorithms and combinatorics,
|x 0937-5511 ;
|v 25
|
| 500 |
|
|
|a Softcover reprint of the hardcover 1st edition 2003.
|
| 504 |
|
|
|a Includes bibliographical references.
|
| 505 |
0 |
|
|a Preface -- Pankaj K. Agarwal, Boris Aronov, Micha Sharir: On the complexity of many faces in arrangements of pseudo-segments and of circles -- Maya Ahmed, Jesus De Loera, Raymond Hemmecke: Polyhedral cones of magic cubes and squares -- Jin Akiyama, Gisaku Nakamura: Congruent Dudeney dissections of triangles and convex quadrilaterals with hinge points on the sides of the polygon -- Helmut Alt, Peter Brass, Michael Godau, Christian Knauer, Carola Wenk: Computing the Hausdorff distance of geometric patterns and shapes -- Pierre Angelier, Michel Pocchiola: A sum of squares theorem for visibility complexes and applications -- Esther Arkin, Sandor Fekete, Ferran Hurtado, Joseph Mitchell, Marc Noy, Vera Sacristan, Saurabh Sethia: On the reflexivity of point sets -- Andrei Asinowski, Andreas Holmsen, Meir Katchalski, Helge Tverberg: Geometric permutations of large families of translates -- Imre Barany, Jiri Matousek: Integer points in rotating convex bodies -- Alexander Below, Vanessa Krummeck, Jurgen Richter-Gebert: Complex matroids, phirotopes and their realizations in rank 2 -- Karoly Boroczky, Jr., Gergely Wintsche: Covering the sphere by equal spherical balls -- Allan Borodin, Rafail Ostrovsky, Yuval Rabani: Lower bounds for high dimensional nearest neighbor search and related problems -- Peter Brass, Gyula Karolyi, Pavel Valtr: An extremal theory of convex geometric graphs and related structures -- Andreas Brieden, Peter Gritzman: On the approximability of polynomial-programming, the geometry of stable sets, and the power of relaxation -- Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov: A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube -- Tamal Dey, Joachim Giesen: Detecting undersampling in surface reconstruction -- Jurgen Eckhoff: A survey of the Hadwiger-Debrunner (p, q)-problem -- Herbert Edelsbrunner: Surface reconstruction by wrapping finite sets in space -- Stefan Felsner, Nicole Morawe: Infeasibility of systems of halfspaces -- Lukas Finschi, Komei Fukuda: Combinatorial generation of small point configurations and hyperplane arrangements -- Andrei Gabrielov: Relative closure of semi-Pfaffian sets -- Branko Grunbaum: Are your polyhedra the same as my polyhedra?- Thomas C. Hales: Some algorithms arising in the proof of the Kepler conjecture -- Joel Hass, Jeffrey C. Lagarias: The Number of Triangles Needed to Span a Polygon Embedded in R^d -- W. He, N. Prabhu: Jacobi decomposition and eigenvalues of symmetric matrices -- Atsushi Kaneko, Mikio Kano: Discrete geometry on red and blue points in the plane -- A survey -- Miklos Laczkovich: Configurations with rational angles and trigonometric Diphantine equations -- Boris D. Lubachevsky, Ronald L. Graham: Dense packings of congruent circles in rectangles with a variable aspect ratio -- Jaroslav Nesetril, Patrice Ossona de Mendez: Colorings and homomorphisms of minor closed classes -- Janos Pach and Geza Toth: Conflict free colorings -- Sawas Pericleous, Nicolai Vorobjov: New complexity bounds for cylindrical decompositions of sub-Pfaffian sets -- Rados Radoicic, Geza Toth: On the Hadwiger-Nelson problem -- Gunter Rote, Francisco Santos, Ileana Streinu: Expansive motions and the polytope of pointed pseudo-triangulations -- Marie-Francoise Roy: Some recent quantitative and algorithmic results in real algebraic geometry -- Peter Scholl, Achill Schurmann, Jorg M. Wills: A discrete isoperimetric inequality and its application to sphere packings -- Zvi Schur, Yakov Kupitz, Horst Martini, Micha Perles: On the number of regular simplices determined by n points in R^d -- Micha Sharir, Emo Welzl: Balanced lines, halving triangles, and the generalized lower bound theorem -- Steve Skiena, Warren D. Smith, Paul Lemke: Reconstructing sets from interpoint distances -- N.J.A. Sloane, B. Beferull-Lozano: Quantizing using lattice intersections -- Jozsef Solymosi: Note on a generalization of Roth's theorem -- Sinisa Vrecica, Rade Zivaljevic: Arrangements, equivariant maps and partitions of measures by 4-fans -- Tudor Zamfirescu: Qualitative infinite version of Erdos' problem about empty polygons.
|
| 520 |
|
|
|a 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.
|
| 500 |
|
|
|a Electronic resource.
|
| 650 |
|
0 |
|a Combinatorial geometry.
|
| 650 |
|
0 |
|a Geometry
|x Data processing.
|
| 650 |
|
7 |
|a Combinatorial geometry.
|2 fast
|0 (OCoLC)fst00868972
|
| 650 |
|
7 |
|a Geometry
|x Data processing.
|2 fast
|0 (OCoLC)fst00940870
|
| 655 |
|
7 |
|a Electronic books.
|2 local
|
| 700 |
1 |
|
|a Goodman, Jacob E.
|
| 700 |
1 |
|
|a Pollack, Richard.
|
| 700 |
1 |
|
|a Aronov, Boris.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 776 |
1 |
8 |
|i Print version:
|t Discrete and computational geometry.
|d Berlin ; New York : Springer, ©2003
|w (DLC) 2003054783
|
| 830 |
|
0 |
|a Algorithms and combinatorics ;
|v 25.
|x 0937-5511
|
| 856 |
4 |
0 |
|u http://proxy.library.tamu.edu/login?url=https://link.springer.com/10.1007/978-3-642-55566-4
|z Connect to the full text of this electronic book
|t 0
|
| 994 |
|
|
|a 92
|b TXA
|
| 999 |
|
|
|a MARS
|
| 999 |
f |
f |
|s 260975b9-8331-3fb3-8235-7bbb793a957c
|i 04fbf675-1684-343c-b3b2-bf0ac9933a6c
|t 0
|
| 952 |
f |
f |
|a Texas A&M University
|b College Station
|c Electronic Resources
|s www_evans
|d Available Online
|t 0
|e QA167 .D57 2003eb
|h Library of Congress classification
|
| 998 |
f |
f |
|a QA167 .D57 2003eb
|t 0
|l Available Online
|