Summer Sale: 50% off print & eBooks in Open Source & Security! Browse now >>

Geometry and Computing

CGAL Arrangements and Their Applications

A Step-by-Step Guide

Authors: Fogel, Efi, Halperin, Dan, Wein, Ron

  • Offers practical guidance on an important area of computational geometry
  • Includes numerous worked examples and program descriptions
  • The text is supported by a dedicated website
see more benefits

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-642-17283-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $89.95
price for USA
  • ISBN 978-3-642-17282-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Rent the ebook  
  • Rental duration: 1 or 6 month
  • low-cost access
  • online reader with highlighting and note-making option
  • can be used across all devices
About this Textbook

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.

About the authors

The author team work in the Applied Computational Laboratory of Tel Aviv University. They are among the key groups worldwide using and contributing to CGAL resources, and they have significant experience in the development of the related theory and programs, and in teaching applied computational geometry to computer science and engineering students. They also have related industrial consulting experience.

Video

Table of contents (11 chapters)

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-642-17283-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $89.95
price for USA
  • ISBN 978-3-642-17282-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Rent the ebook  
  • Rental duration: 1 or 6 month
  • low-cost access
  • online reader with highlighting and note-making option
  • can be used across all devices
Loading...

Bibliographic Information

Bibliographic Information
Book Title
CGAL Arrangements and Their Applications
Book Subtitle
A Step-by-Step Guide
Authors
Series Title
Geometry and Computing
Series Volume
7
Copyright
2012
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-17283-0
DOI
10.1007/978-3-642-17283-0
Hardcover ISBN
978-3-642-17282-3
Series ISSN
1866-6795
Edition Number
1
Number of Pages
XIX, 293
Topics