This book provides a comprehensive and organized exploration of computational geometry, emphasizing recent research. It features clear presentations of fundamental concepts, algorithmic techniques, and numerous examples, making it suitable for graduate students and valuable for professionals in fields like computer-aided design and robotics.
The reviews highlight the book's engaging narrative and well-developed characters, praising its ability to blend humor with poignant moments. Readers appreciate the author's unique voice and the insightful exploration of themes such as friendship, resilience, and personal growth. The storyline captivates with unexpected twists, keeping audiences invested until the last page. Overall, the book is recognized for its emotional depth and relatability, making it a memorable read.
R. E. Miller: Parallel program schemata.- D. E. Muller: Theory of automata.- R. Karp: Computational complexity of combinatorial and graph-theoretic problems.
This collection explores a range of innovative algorithms and methods across various fields. It includes geometric algorithms tailored for constrained 1-D K-Means clustering and their applications in IMRT. A fast preprocessing algorithm is presented for selecting gene-specific probes in DNA microarrays. The work also addresses approximation algorithms for point-to-surface registration in medical navigation and introduces biometric digital signature key generation based on fingerprints. New algorithms for spaced seeds and region-based selective encryption in medical imaging are discussed, alongside techniques for extracting information on anti-AIDS inhibitors from biological literature using ontology. A novel reversible data hiding fusion scheme is proposed, along with insights into the approximation and smoothed complexity of Leontief market equilibria and coordination among multiple auctions. The on-line rental problem is examined with risk and probabilistic forecasts, while distributed planning for the on-line dial-a-ride problem is also covered. Other topics include maximizing independent labels in the plane, the fractional chromatic number of monotone self-dual Boolean functions, and the complexity of approximation streaming algorithms for the k-center problem. The collection further delves into scheduling techniques for minimizing maximum lateness, semantics of value passing CCS, and constraints for time-sensitive s