000			04123nam a22004933i 4500
001			EBC3113314
003			MiAaPQ
005			20240729124539.0
006			m o d |
007			cr cnu||||||||
008			240724s2008 xx o ||||0 eng d
020			_a9780821881323 _q(electronic bk.)
020			_z9780821842393
035			_a(MiAaPQ)EBC3113314
035			_a(Au-PeEL)EBL3113314
035			_a(CaPaEBR)ebr10878769
035			_a(OCoLC)922980815
040			_aMiAaPQ _beng _erda _epn _cMiAaPQ _dMiAaPQ
050		4	_aQA167 -- .S876 2006eb
082	0		_a516/.13
100	1		_aGoodman, Jacob E.
245	1	0	_aSurveys on Discrete and Computational Geometry : _bTwenty Years Later.
250			_a1st ed.
264		1	_aProvidence : _bAmerican Mathematical Society, _c2008.
264		4	_c©2008.
300			_a1 online resource (568 pages)
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aContemporary Mathematics ; _vv.453
505	0		_aIntro -- Contents -- Preface -- Musings on discrete geometry and "20 years of Discrete &amp -- Computational Geometry -- State of the union (of geometric objects) -- Metric graph theory and geometry: a survey -- Extremal problems for convex lattice polytopes: a survey -- On simple arrangements of lines and pseudo-lines in P2 and R2 with the maximum number of triangles -- The computational complexity of convex bodies -- Algorithmic semi-algebraic geometry and topology - recent progress and open problems -- 1. Introduction -- 2. Semi-algebraic Geometry: Background -- 3. Recent Algorithmic Results -- 4. Algorithmic Preliminaries -- 5. Topological Preliminaries -- 6. Algorithms for Computing the First Few Betti Numbers -- 7. The Quadratic Case -- 8. Betti Numbers of Arrangements -- 9. Open Problems -- Acknowledgment -- References -- Expansive motions -- All polygons flip finitely … right? -- Persistent homology-a survey -- Recent progress on line transversals to families of translated ovals -- An improved, simple construction of many halving edges -- Unfolding orthogonal polyhedra -- The discharging method in combinatorial geometry and the Pach-Sharir conjecture -- Pseudo-triangulations-a survey -- 1. Introduction -- 2. Basic Properties of Pseudo-Triangulations -- 3. The Set of all Pseudo-Triangulations -- 4. 3D Liftings and Locally Convex Functions -- 5. Self-Stresses, Reciprocal Diagrams, and the Maxwell-Cremona Correspondence -- 6. Pseudo-Triangulations and Rigidity -- 7. Planar Rigid Graphs are Pseudo-Triangulations -- 8. Polytopes of Pseudo-Triangulations -- 9. Applications of Pseudo-Triangulations -- References -- Line problems in nonlinear computational geometry -- On empty hexagons -- k-sets and k-facets -- 1. Introduction -- 2. Preliminaries -- 3. Random Sampling -- 4. Special Point Sets -- 5. Lower Bounds.
505	8		_a6. Upper Bounds for Halving Facets in All Dimensions -- 7. Crossings in Dimension 2. -- 8. Improvements in Three And Four Dimensions -- 9. Convex Quadrilaterals -- 10. Connections to the Combinatorial Theory of Convex Polytopes -- References -- An Erdős-Szekeres type problem for interior points -- The kissing number, blocking number and covering number of a convex body -- Open problems.
588			_aDescription based on publisher supplied metadata and other sources.
590			_aElectronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.
650		0	_aCombinatorial geometry -- Congresses.
650		0	_aGeometry -- Data processing -- Congresses.
655		4	_aElectronic books.
700	1		_aPach, János.
700	1		_aPollack, Richard.
776	0	8	_iPrint version: _aGoodman, Jacob E. _tSurveys on Discrete and Computational Geometry _dProvidence : American Mathematical Society,c2008 _z9780821842393
797	2		_aProQuest (Firm)
830		0	_aContemporary Mathematics
856	4	0	_uhttps://ebookcentral.proquest.com/lib/orpp/detail.action?docID=3113314 _zClick to View
999			_c68848 _d68848