Computational Geometry and Its Application to GIS

Computational geometry is defined broadly as the design and analysis of algorithms for solving problems involving geometric objects. Use of the term 'computational geometry' and its meaning differs in different application contexts. Most researchers in computer science interpret the subjec...

Full description

Saved in:
Bibliographic Details
Published in:Computing in Geographic Information Systems pp. 147 - 182
Main Author: Panigrahi, Narayan
Format: Book Chapter
Language:English
Published: United Kingdom CRC Press 2014
Taylor & Francis Group
Subjects:
ISBN:9781482223149, 1482223147
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Computational geometry is defined broadly as the design and analysis of algorithms for solving problems involving geometric objects. Use of the term 'computational geometry' and its meaning differs in different application contexts. Most researchers in computer science interpret the subject as design and optimization of algorithms involving geometric problems. The term 'algorithm design' carries the connotation of discrete algorithms as opposed to the algorithms used in numerical analysis. The numerical analysis problems are used for solving computational problems in continuous domains. Computational geometry is useful in solving problems of discrete combinatorial geometry rather than continuous geometry. This chapter describes the computational geometric algorithms in the context of their applications in GIS and how these algorithms are used to process spatial data which are the primary inputs of GIS.
ISBN:9781482223149
1482223147
DOI:10.1201/b17147-14