rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: CGAL Arrangements and Their Applications
    sub title: A Step-by-Step Guide
  name:
    name part: Fogel, Efi.
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: Halperin, Dan.
    role:
      role term: author.
  name:
    name part: Wein, Ron.
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2012
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XIX, 293 p. 125 illus., 120 illus. in color. online resource.
  abstract: 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.
  table of contents: Introduction -- 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.
  note: by Efi Fogel, Dan Halperin, Ron Wein.
  subject:
    topic: Computer science
  subject:
    topic: Computer graphics
  subject:
    topic: Geometry
  subject:
    topic: Applied mathematics
  subject:
    topic: Engineering mathematics
  subject:
    topic: Computer Science
  subject:
    topic: Computer Imaging, Vision, Pattern Recognition and Graphics
  subject:
    topic: Geometry
  subject:
    topic: Appl.Mathematics/Computational Methods of Engineering
  classification: T385
  classification: TA1637-1638
  classification: TK7882.P3
  classification: 006.6
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Geometry and Computing, 7
  identifier: 9783642172830
  identifier: http://dx.doi.org/10.1007/978-3-642-17283-0
  record info:
    record creation date: 120103
    record change date: 20151204172717.0
    record identifier: 978-3-642-17283-0