GIS fundamental (Record no. 42032)

MARC details
000 -LEADER
fixed length control field 03781 a2200181 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781439886953
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 621.3678
Item number WIS
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Wise, Stephen
245 ## - TITLE STATEMENT
Title GIS fundamental
250 ## - EDITION STATEMENT
Edition statement Ed.2
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Name of publisher, distributor, etc CRC Press
Place of publication, distribution, etc Boca Raton
Date of publication, distribution, etc 2014
300 ## - PHYSICAL DESCRIPTION
Extent xv,322p.
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note CONTENTS<br/>Preface ix<br/>Acknowledgements xiii<br/>Author xv<br/>1. Introduction 1<br/>How Computers Solve Problems 2<br/>How Computers Represent the World: Data Modelling 5<br/>The Structure of a Computer 10<br/>Pseudocode and Computer Programming 15<br/>Further Reading 21<br/>2.Databases 23<br/>What Are Databases and Why Are They Important? 23<br/>Relational Database 29<br/>Storing Spatial Data in a Relational Database 32<br/>Solutions to the Problems of Storing Spatial Data in RDBMS 35<br/>Further Reading 37<br/>3. Vector Data Structures 39<br/>Simple Storage of Vector Data 39<br/>Topological Storage of Vector Data 49<br/>So What Is Topology? 54<br/>And How Does It Help? The Example of DIME 57<br/>More on Topological Data Structures 60<br/>And a Return to Simple Data Structures 64<br/>Further Reading 67<br/>4. Vector Algorithms for Lines 69<br/>Simple Line Intersection Algorithm 69<br/>Why the Simple Line Intersection Algorithm WouldNot Work: A Better Algorithm 74<br/>Dealing with Wiggly Lines 78<br/>Calculations on Lines: How Long Is a Piece of String? 81<br/>Line Intersection: How It Is Really Done 84<br/>Further Reading 935<br/>5.Vector Algorithms for Areas 95<br/>Calculations on Areas: Single Polygons 95<br/>Calculations on Areas: Multiple Polygons 98<br/>Point in Polygon: Simple Algorithm 101<br/>and Back to Topology for a Better Algorithm 105<br/>Further Reading 108<br/>6.The Efficiency of Algorithms 109<br/>How Is Algorithm Efficiency Measured? 109<br/>Efficiency of the Line Intersection Algorithm 112<br/>More on Algorithm Efficiency 114<br/>Further Reading 116<br/>7.Raster Data Structures 119<br/>Raster Data in Databases 120<br/>Raster Data Structures: The Array 123<br/>Saving Space: Run Length Encoding and Quadtrees 127<br/>Data Structures for Images 132<br/>Further Reading 139<br/>8.Raster Algorithms 141<br/>Raster Algorithms: Attribute Query for RunLength Encoded Data 141 <br/>Raster Algorithms: Attribute Query for Quadtrees 144<br/>Raster Algorithms: Area Calculation 153<br/>Further Reading 159<br/>9.Data Structures for Surfaces 161<br/>Data Models for Surfaces 162<br/>Algorithms for Creating Grid Surface Models 166<br/>Algorithms for Creating a Triangulated Irregular Network 174<br/>Grid Creation Revisited 180<br/>Further Reading 183<br/>10.Algorithms for Surfaces 185<br/>Elevation, Slope and Aspect 185<br/>Hydrological Analysis Using a TIN 192<br/>Determining Flow Direction Using a Gridded DEM 195<br/>Using the Flow Directions for Hydrological Analysis 199<br/>Further Reading 205<br/>11.Data Structures and Algorithms for Networks 207<br/>Networks in Vector and Raster 207<br/>Shortest Path Algorithm 209<br/>Data Structures for Network Data 216<br/>Faster Algorithms for Finding the Shortest Route 225<br/>Further Reading ,234<br/>12.Strategies for Efficient Data Access 235<br/>Tree Data Structures 238<br/>Indexing and Storing 2D Data Using Both Coordinates 244<br/>Space-Filling Curves for Spatial Data 250<br/>Spatial Filling Curves and Data Clustering 252<br/>Space-Filling Curves for Indexing Spatial Data 255<br/>Caching 265<br/>Further Reading 269<br/>13.Heuristics for Spatial Data 271<br/>Travelling Salesman Problem 272<br/>Location Allocation 277<br/>Metaheuristics 283<br/>Computability and Decidability 288<br/>Further Reading 293<br/>Conclusion 295<br/>Glossary 297<br/>References 305<br/>Index 313<br/>
600 ## - SUBJECT ADDED ENTRY--PERSONAL NAME
9 (RLIN) 42138
890 ## - Country
Country USA
891 ## - Topic
Topic FT
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Withdrawn status Home library Current library Date acquired Source of acquisition Cost, normal purchase price Total Checkouts Total Renewals Full call number Barcode Date last seen Date last borrowed Cost, replacement price Price effective from Koha item type
    Dewey Decimal Classification     Faculty of Technology   CEPT Library CEPT Library 07/10/2015 49 2816.00 10 4 621.3678 WIS 014574 15/10/2024 03/09/2024 2816.00 09/09/2015 Book
Excel To HTML using codebeautify.org Sheet Name :- Location Chart
Location Chart Basement 1 (B1) Class No. 600 - 649, 660 - 699
(B1) :Mezzanine 1 Class No. 700 - 728
(B1) :Mezzanine 2 Class No. 728.1 - 799, 650 - 659, Reference Books, Faculty work
Basement 2 (B2) Class No. 000 - 599, 800-999
Basement 3 (B3) (Please Inquire at the Counter for resources) Theses, Students' works, Bound Journals, Drawings, Atlas, Oversize Books, Rare Books, IS codes, Non-book Materials