Skip to main content

Digital and Discrete Geometry

Theory and Algorithms

  • Book
  • © 2014

Overview

  • Explains profound theorems such as Minkowski’s Theorem and solid applications such as persistent analysis
  • Provides natural links to profound topics including differential discrete geometry
  • Includes case studies and more
  • Includes supplementary material: sn.pub/extras

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (15 chapters)

  1. Basic Geometry

  2. Digital Curves, Surfaces, and Manifolds

  3. Discretely Represented Objects: Geometry and Topology

  4. Geometric Computation and Processing

  5. Advanced Topics

Keywords

About this book

This book provides comprehensive coverage of the modern methods for geometric problems in the computing sciences. It also covers concurrent topics in data sciences including geometric processing, manifold learning, Google search, cloud data, and R-tree for wireless networks and BigData.


The author investigates digital geometry and its related constructive methods in discrete geometry, offering detailed methods and algorithms. The book is divided into five sections: basic geometry; digital curves, surfaces and manifolds; discretely represented objects; geometric computation and processing; and advanced topics. Chapters especially focus on the applications of these methods to other types of geometry, algebraic topology, image processing, computer vision and computer graphics.


Digital and Discrete Geometry: Theory and Algorithms  targets  researchers and professionals working in digital image processing analysis, medical imaging (suchas CT and MRI) and informatics, computer graphics, computer vision, biometrics, and informati
on theory.  Advanced-level students in electrical engineering, mathematics, and computer science will also find this book useful as a secondary text book or reference.

Praise for this book:



This book does present a large collection of important concepts, of mathematical, geometrical, or algorithmical nature, that are frequently used in computer graphics and image processing. These concepts range from graphs through manifolds to homology. Of particular value are the sections dealing with discrete versions of classic continuous notions. The reader finds compact definitions and concise explanations that often appeal to intuition, avoiding finer, but then necessarily more complicated, arguments… As a first introduction, or as a reference for professionals working in computer graphics or image processing, this book should be of considerable value." -Prof. Dr. Rolf Klein, University of Bonn.

Reviews

“This book does present a large collection of important concepts, of mathematical, geometrical, or algorithmical nature, that are frequently used in computer graphics and image processing. … As a first introduction, or as a reference for professionals working in computer graphics or image processing, this book should be of considerable value.” (Rolf Klein, zbMATH 1319.68002, 2015)

"This is an informative text covering a surprisingly wide range of topics. The author has succeeded in finding the appropriate (though highly variable) mix of mathematical theory, practical problems, computational approaches, and algorithms. The writing and production quality are generally good …... The book is suitable for an upper-level undergraduate course and a follow-on graduate course. Researchers and practitioners will find it a reasonably adequate introduction (more details would have been useful in several places, especially for readers not enrolledin a college course). Given the considerable mathematical content in this book, it is more readable than might be expected, especially for readers familiar with principles and problems from related domains, especially computer graphics, image processing, and the theory of algorithms. Since the author explains basic concepts (though often rather briefly) before moving on to more advanced ideas, even readers new to much of the background material should be able to make fair headway.” (R. M. Malyankar, ACM Computing Reviews #CR143755)

Authors and Affiliations

  • University of the District of Columbia, Washington, USA

    Li M. Chen

About the author











    

Bibliographic Information

Publish with us