TY - BOOK ID - 8655755 TI - CGAL Arrangements and Their Applications : A Step-by-Step Guide AU - Fogel, Efi. AU - Halperin, Dan. AU - Wein, Ron. PY - 2012 VL - 7 SN - 3642172822 3642172830 PB - Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, DB - UniCat KW - Algorithms. KW - Combinatorial geometry -- Data processing. KW - Geometrical constructions -- Data processing. KW - Geometry -- Data processing. KW - Geometry KW - Geometrical constructions KW - Combinatorial geometry KW - Algorithms KW - Mathematics KW - Engineering & Applied Sciences KW - Electrical & Computer Engineering KW - Physical Sciences & Mathematics KW - Applied Physics KW - Electrical Engineering KW - Technology - General KW - Data processing KW - Data processing. KW - Constructions, Geometric KW - Constructions, Geometrical KW - Geometric constructions KW - Geometric combinatorics KW - Geometrical combinatorics KW - Algorism KW - Computer science. KW - Computer graphics. KW - Geometry. KW - Applied mathematics. KW - Engineering mathematics. KW - Computer Science. KW - Computer Imaging, Vision, Pattern Recognition and Graphics. KW - Appl.Mathematics/Computational Methods of Engineering. KW - Combinatorial analysis KW - Discrete geometry KW - Algebra KW - Arithmetic KW - Foundations KW - Computer vision. KW - Mathematical and Computational Engineering. KW - Machine vision KW - Vision, Computer KW - Artificial intelligence KW - Image processing KW - Pattern recognition systems KW - Euclid's Elements KW - Engineering KW - Engineering analysis KW - Mathematical analysis KW - Optical data processing. KW - Optical computing KW - Visual data processing KW - Bionics KW - Electronic data processing KW - Integrated optics KW - Photonics KW - Computers KW - Optical equipment UR - https://www.unicat.be/uniCat?func=search&query=sysid:8655755 AB - Arrangements 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. ER -