• Title Computational Geometry: Methods and Applications
• Author(s) Jianer Chen
• Publisher: Texas A&M University, 1996
• Permission: Link to the draft of the book in author's homepage.
• Hardcover/Paperback N/A
• eBook PDF (227 pages)
• Language: English
• ISBN-10: N/A
• ISBN-13: N/A
• Share This:  

Book Description

Geometric objects such as points, lines, and polygons are the basis of a broad variety of important applications and give rise to an interesting set of problems and algorithms. The name geometry reminds us of its earliest use: for the measurement of land and materials.

Today, computers are being used more and more to solve larger-scale geometric problems. Over the past two decades, a set of tools and techniques has been developed that takes advantage of the structure provided by geometry. This discipline is known as Computational Geometry.

This book is an introduction to some of the fundamental principles of computational geometry, concentrates on four major directions in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems.

• Jianer Chen is a Professor at Department of Computer Science, Texas A&M University.

• Amazon

• Computational and Algorithmic Mathematics
• Geometry and Topology
• Applied Mathematics

• Computational Geometry: Methods and Applications (Jianer Chen)
• The Mirror Site (1) - PDF

• Curves and Surfaces in Geometric Modeling: Theory and Algorithms

  This book offers both a theoretically unifying understanding of polynomial curves and surfaces and an effective approach to implementation. It is also an exellent introduction to geometry concepts used in computer graphics, vision, robotics, geometric modeling.

• Algorithms for Modular Elliptic Curves, 2nd Edition (J. E. Cremona)

  This book presents a thorough treatment of many algorithms concerning the arithmetic of elliptic curves, with remarks on computer implementation. An extensive set of tables is provided giving the results of the author's implementation of the algorithms.

• Algorithms in Real Algebraic Geometry (Saugata Basu, et al)

  The monograph gives a self-contained detailed exposition of the algorithmic real algebraic geometry. It will be useful both for beginners and for advanced readers, who work in real algebraic geometry or apply its methods in other fields.

• Computations in Algebraic Geometry with Macaulay 2 (D.Eisenbud)

  This book presents algorithmic tools for algebraic geometry and experimental applications of them using Macaulay 2. It also introduces a software system in which the tools have been implemented and with which the experiments can be carried out.

• Combinatorial and Computational Geometry (Jacob E. Goodman)

  It includes surveys and research articles exploring geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension.

• A Computational Introduction to Number Theory and Algebra

  This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes, and is accessible to a broad audience. It covers the basics of number theory, abstract algebra and discrete probability theory.

• Algorithms and Data Structures: Apps to Graphics and Geometry

  An introductory coverage of algorithms and data structures with application to graphics and geometry aims to show a sample of the intellectual demands required by a computer science curriculum, exercises, many with solutions, are included throughout the book.