Intersection And Decomposition Algorithms For Planar Arrangements
Download Intersection And Decomposition Algorithms For Planar Arrangements PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Intersection And Decomposition Algorithms For Planar Arrangements book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Intersection and Decomposition Algorithms for Planar Arrangements
Author: Pankaj K. Agarwal
language: en
Publisher: Cambridge University Press
Release Date: 1991-04-26
This book, first published in 1991, presents a study of various problems related to arrangements of lines, segments, or curves in the plane.
Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms
Author: SIAM Activity Group on Discrete Mathematics
language: en
Publisher: SIAM
Release Date: 2001-01-01
Contains 130 papers, which were selected based on originality, technical contribution, and relevance. Although the papers were not formally refereed, every attempt was made to verify the main claims. It is expected that most will appear in more complete form in scientific journals. The proceedings also includes the paper presented by invited plenary speaker Ronald Graham, as well as a portion of the papers presented by invited plenary speakers Udi Manber and Christos Papadimitriou.
Handbook of Discrete and Computational Geometry
The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world—as researchers in mathematics and computer science—and in the professional world—as practitioners in fields as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed significantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young field of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography.