Computer Arithmetic of Geometrical Figures: Algorithms and Hardware Design
by Solomon I. Khmelnik
Publisher: MiC 2013
Number of pages: 150
This book describes various versions of processors, designed for affine transformations of many-dimensional figures -- planar and spatial. The book is designed for students, engineers and developers, who intend to use the computer arithmetic of geometrical figures in their own research and development in the field of specialized processors.
Home page url
Download or read it online for free here:
by Jeff Erickson - University of Illinois at Urbana-Champaign
These are lecture notes, homework questions, and exam questions from algorithms courses the author taught at the University of Illinois. It is assumed that the reader has mastered the material covered in the first 2 years of a typical CS curriculum.
by David M. Mount - University of Maryland
The focus is on how to design good algorithms, and how to analyze their efficiency. The text covers some preliminary material, optimization algorithms, graph algorithms, minimum spanning trees, shortest paths, network flows and computational geometry.
by Jurg Nievergelt, Klaus Hinrichs - Prentice Hall
Contents: Programming environments for motion, graphics, and geometry; Programming concepts - beyond notation; Objects, algorithms, programs; Complexity of problems and algorithms; Data structures; Interaction between algorithms and data structures.
by Jianer Chen
The author concentrates on four themes in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems. Solving manufacturing problems requires application of fast-algorithm techniques.