000			04075nam a22005175i 4500
001			978-3-540-70680-9
003			DE-He213
005			20160624102103.0
007			cr nn 008mamaa
008			121227s1996 gw | s |||| 0|eng d
020			_a9783540706809 _9978-3-540-70680-9
024	7		_a10.1007/BFb0014474 _2doi
050		4	_aT385
072		7	_aUML _2bicssc
072		7	_aCOM012000 _2bisacsh
082	0	4	_a006.6 _223
245	1	0	_aApplied Computational Geometry Towards Geometric Engineering _h[electronic resource] : _bFCRC'96 Workshop, WACG'96 Philadelphia, PA, May 27–28, 1996 Selected Papers / _cedited by Ming C. Lin, Dinesh Manocha.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1996.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1996.
300			_aIX, 222 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v1148
505	0		_aHow solid is solid modeling? -- Robustness issues in geometric algorithms -- Implementing geometric algorithms robustly -- Robustness in geometric algorithms -- Applications of computational geometry in mechanical engineering design and manufacture -- On some applications of computational geometry in manufacturing and virtual environments -- Visualizing geometric algorithms — State of the art -- Geometric algorithm visualization, current status and future -- Position paper for panel discussion -- Designing the computational geometry algorithms library CGAL -- The computational geometry impact task force report: An executive summary -- Geometric manipulation of flexible ligands -- Ray-representation formalism for geometric computations on protein solid models -- Column-based strip packing using ordered and compliant containment -- Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design -- Geometric problems in machine learning -- Matching convex polygons and polyhedra, allowing for occlusion -- Stably placing piecewise smooth objects -- A beam-tracing algorithm for prediction of indoor radio propagation -- Extracting geometric information from architectural drawings -- Using the visibility complex for radiosity computation -- The CGAL kernel: A basis for geometric computation -- Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator.
520			_aThis anthology is based on the First ACM Workshop on Applied Computational Geometry, WACG '96, held in Philadelphia, PA, USA, in May 1996, as part of the FCRC Conference. Today, CG is in transition and applied computational geometry has established itself as a fertile meeting ground for theorists from core computational geometry and practitioners from the potential application areas to exchange their ideas and identify issues of common interest. The book presents 11 invited contributions and state-of-the-art reports by leading experts together with 12 refereed full papers selected from 32 submissions. It points the way towards geometrical engineering and addresses researchers and professionals sharing an interest in geometric algorithms and techniques and their use in computational sciences and engineering.
650		0	_aComputer science.
650		0	_aComputer graphics.
650		0	_aComputer aided design.
650		0	_aVisualization.
650	1	4	_aComputer Science.
650	2	4	_aComputer Graphics.
650	2	4	_aComputer-Aided Engineering (CAD, CAE) and Design.
650	2	4	_aVisualization.
700	1		_aLin, Ming C. _eeditor.
700	1		_aManocha, Dinesh. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540617853
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v1148
856	4	0	_uhttp://dx.doi.org/10.1007/BFb0014474
942			_2EBK7456 _cEBK
999			_c36750 _d36750