000 04013nam a22005295i 4500
001 978-3-642-17283-0
003 DE-He213
005 20140220083256.0
007 cr nn 008mamaa
008 120103s2012 gw | s |||| 0|eng d
020 _a9783642172830
_9978-3-642-17283-0
024 7 _a10.1007/978-3-642-17283-0
_2doi
050 4 _aT385
050 4 _aTA1637-1638
050 4 _aTK7882.P3
072 7 _aUYQV
_2bicssc
072 7 _aCOM016000
_2bisacsh
082 0 4 _a006.6
_223
100 1 _aFogel, Efi.
_eauthor.
245 1 0 _aCGAL Arrangements and Their Applications
_h[electronic resource] :
_bA Step-by-Step Guide /
_cby Efi Fogel, Dan Halperin, Ron Wein.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2012.
300 _aXIX, 293p. 125 illus., 120 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aGeometry and Computing,
_x1866-6795 ;
_v7
505 0 _aIntroduction -- Basic Arrangements -- Queries and Free Functions -- Arrangements of Unbounded Curves -- Arrangement-Traits Classes -- Extending the Arrangement -- Adapting to Boost Graphs -- Operations on (Curved) Polygons -- Minkowski Sums and Offset Polygons -- Envelopes -- Prospects -- Bibliography -- Index.
520 _aArrangements of curves constitute fundamental structures that have been intensively studied in computational geometry. Arrangements have numerous applications in a wide range of areas – examples include geographic information systems, robot motion planning, statistics, computer-assisted surgery and molecular biology. Implementing robust algorithms for arrangements is a notoriously difficult task, and the CGAL arrangements package is the first robust, comprehensive, generic and efficient implementation of data structures and algorithms for arrangements of curves.   This book is about how to use CGAL two-dimensional arrangements to solve problems. The authors first demonstrate the features of the arrangement package and related packages using small example programs. They then describe applications, i.e., complete standalone programs written on top of CGAL arrangements used to solve meaningful problems – for example, finding the minimum-area triangle defined by a set of points, planning the motion of a polygon translating among polygons in the plane, computing the offset polygon, finding the largest common point sets under approximate congruence, constructing the farthest-point Voronoi diagram, coordinating the motion of two discs moving among obstacles in the plane, and performing Boolean operations on curved polygons.   The book contains comprehensive explanations of the solution programs, many illustrations, and detailed notes on further reading, and it is supported by a website that contains downloadable software and exercises. It will be suitable for graduate students and researchers involved in applied research in computational geometry, and for professionals who require worked-out solutions to real-life geometric problems. It is assumed that the reader is familiar with the C++ programming-language and with the basics of the generic-programming paradigm.
650 0 _aComputer science.
650 0 _aComputer vision.
650 0 _aGeometry.
650 0 _aEngineering mathematics.
650 1 4 _aComputer Science.
650 2 4 _aComputer Imaging, Vision, Pattern Recognition and Graphics.
650 2 4 _aGeometry.
650 2 4 _aAppl.Mathematics/Computational Methods of Engineering.
700 1 _aHalperin, Dan.
_eauthor.
700 1 _aWein, Ron.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642172823
830 0 _aGeometry and Computing,
_x1866-6795 ;
_v7
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-17283-0
912 _aZDB-2-SMA
999 _c101873
_d101873