Spatial Gems: Volume 2

Cover
Halftitle
Title Page
Copyright Page
Contents
Preface
	Introduction
	Acknowledgments
Chapter 1 Graph Sampling for Map Comparison
	1.1 Introduction
	1.2 Graph Sampling Methods
	1.3 Discussion/Conclusion
	References
Chapter 2 Fast 3D Euclidean Connected Components
	2.1 Introduction
	2.2 A Better Data Structure for the Euclidean Case
	2.3 Connected Component Algorithm
	2.4 Implementation
	2.5 Examples
	2.6 Comparison to Matlab
	2.7 Summary and Future
	References
Chapter 3 Multiscale Aggregation Over Sliding Windows
	3.1 Introduction
	3.2 Concepts
	3.3 Evaluation
	3.4 Summary
	Acknowledgments
	References
Chapter 4 Gaussian Process for Trajectories
	4.1 Introduction
	4.2 Gaussian Process
	4.3 Gaussian Process Elements
	4.4 Gaussian Process Example
	4.5 Discussion
	References
Chapter 5 Mean Chord Length of a Square
	5.1 Introduction
	5.2 Derivation of Mean Chord Length
	5.3 Summary
	Reference
Chapter 6 Object Delineation in Satellite Images
	6.1 Introduction
	6.2 Extracting Objects
	6.3 Experimental Result
	References
Chapter 7 Implementing Simulation of Simplicity for Geometric Degeneracies
	7.1 Introduction
	7.2 Infinitesimals
	7.3 Simulation of Simplicity
	7.4 Examples of SoS in Use
	7.5 Summary and Acknowledgments
	References
Chapter 8 Probabilistic Counting in Uncertain Spatial Databases Using Generating Functions
	8.1 Introduction
	8.2 Generating Functions for Probabilistic Counting
	8.3 Complexity Analysis
	8.4 Implementation
	8.5 Variants, Extensions, and Improvements
	References
Chapter 9 Statistics for All Walks on a Lattice Graph
	9.1 Introduction
	9.2 Computing All Walks
	9.3 Statistics
	9.4 Summary
	References
Chapter 10 Online Heatmap Generation with Both High and Low Weights
	10.1 Introduction
	10.2 Algorithms
	10.3 Hilomap
	10.4 Discussion
	Acknowledgments
	Appendix: Hilomap Code Access
	References
Authors’ Biographies
Index