|
Showing 1 - 25 of
26 matches in All Departments
An impressive collection of original research papers in discrete and computational geometry, contributed by many leading researchers in these fields, as a tribute to Jacob E. Goodman and Richard Pollack, two of the ‘founding fathers’ of the area, on the occasion of their 2/3 x 100 birthdays. The topics covered by the 41 papers provide professionals and graduate students with a comprehensive presentation of the state of the art in most aspects of discrete and computational geometry, including geometric algorithms, study of arrangements, geometric graph theory, quantitative and algorithmic real algebraic geometry, with important connections to algebraic geometry, convexity, polyhedral combinatorics, the theory of packing, covering, and tiling. The book serves as an invaluable source of reference in this discipline.
Applications of Davenport-Schinzel sequences arise in areas as diverse as robot motion planning, computer graphics and vision, and pattern matching. These sequences exhibit some surprising properties that make them a fascinating subject for research in combinatorial analysis. This book provides a comprehensive study of the combinatorial properties of Davenport-Schinzel sequences and their numerous geometric applications. These sequences are sophisticated tools for solving problems in computational and combinatorial geometry. This first book on the subject by two of its leading researchers will be an important resource for students and professionals in combinatorics, computational geometry, and related fields.
These sequences exhibit some surprising properties that make them a
fascinating subject for research in combinatorial analysis. This
1995 book on the subject by two of its leading researchers will be
an important resource for students and professionals in
combinatorics, computational geometry and related fields.
|
|