Bibliography

Map Conflation - General
3.	[ Shuxin Yuan / Chuang Tao 1999 ] Development of Conflation Components
5.	Automated Attribution of Shapefile Data through Map Merging
6.	ACTIVE OBJECTS AND DYNAMIC TOPOLOGY FOR SPATIAL DATA RE-ENGINEERING AND RICH DATA MODELLING (2001)
7.	Maintaining Spatial Relativity of Utilities after a Cadastral Upgrade
8.	Utility Map Reconstruction
9.	Vector Conflation (1986)
10.	[ Kang ] The Impact of Census Block Conflation on Census 2000 Related Projects in Delaware County, Ohio
11.	TOPOLOGICAL TRANSFER: EVOLVING LINEAR GIS ACCURACY
12.	[ Saalfeld 1985 ] COMPARISON AND CONSOLIDATION OF DIGITAL DATABASES USING INTERACTIVE COMPUTER GRAPHICS
13.	[ GIS/Trans 1995 ] Comprehensive GIS Conflation focussed on conflation of linear networks
14.	Error-constrained change detection
15.	Mathematical support for combining geospatial data
16.	Transportation Model - GIS Data Integration
17.	Matching spatial data from different sources
18.	Matching of road segments using probabilistic relaxation: a hierarchical approach (1994)
110.	[ Goodchild 1998 ] Conflation: Combining GIS Sources
111.	SPATIAL DATA ACQUISITION AND INTEGRATION
112.	[ Saalfeld, A ] Conflation: Automated map compilation International Journal of Geographical Information Systems 2(3):217-228
113.	[ White, M.S. / Griffin, P. ] Piecewise linear rubber-sheet map transformation Amer. Cartographer 12 (1985), 123--131
Map Conflation - Edge Matching
90.	[ Xin Chang Zhang ] Geometric Feature-based Edge-Matching
120.	[ Takashi Sato, Yukio Sadahiro, Atsuyuki Okabe 2001 ] A Computational Procedure for Making Seamless Map Sheets Primarily focussed on edge-matching linear features
122.	[ Beard, M. K. and N. R. Chrisman 1988 ] Zipper: A Localized Approach to Edgematching American Cartographer, 15, 163-172.
Map Conflation - Linear Networks
1.	[ Doytsher ] A LINEAR CONFLATION APPROACH FOR THE INTEGRATION OF PHOTOGRAMMETRIC INFORMATION AND GIS DATA (2000)
2.	Alignment Process of Large-Scale Master Plans
4.	[ Kang ] Spatial Data Integration: A Case Study of Map Conflation with Census Bureau and Local Government Data (2001)
Shape Matching - General
19.	[ Guibas 1996 ] Discrete Geometric Shapes
20.	[ 2001 ] Shape Matching: Similarity Measures and Algorithms (2001)
21.	State of the Art in Shape Matching (1999)
22.	Location-Based Similarity Measures Of Regions (1998)
23.	Relational Histograms for Shape Indexing (1998)
24.	Cartographic Indexing into a Database of Remotely Sensed Images (1996)
25.	A robust and affine- invariant metric on boundary patterns (1999)
26.	Efficient Algorithms for Robust Feature Matching (1998)
Shape Matching Using Outline Alignment
27.	Alignment-based Recognition of Shape Outlines (2001)
28.	Efficient and Robust Retrieval by Shape Content through Curvature Scale Space (1996)
29.	Shape Similarity by Piecewise Linear Alignment (1999)
Shape Matching Based on Frechet Distance
30.	Matching polygonal curves with respect to the Fréchet distance
Shape Matching based on Hausdorf Distance
31.	Matching Shapes with a Reference Point (1994)
32.	Geometric Pattern Matching: A Performance Study (1999)
33.	Geometric Matching under Noise: Combinatorial Bounds and Algorithms (1999)
Shape Matching based on Angles
34.	Partial Matching of Planar Polylines Under Similarity Transformations (1997)
35.	Delaunay triangulation for image object indexing: a novel method for shape representation (1999)
Shape Matching based on Geometric Hashing
36.	Shape-based Image Retrieval Using Geometric Hashing (Guibas 1997)
Shape Matching Using Skeletons
37.	Shape matching using edit-distance: an implementation (2001)
38.	A tree-edit-distance algorithm for comparing simple, closed shapes (2000)
39.	Recognition of Shapes by Editing Shock Graphs
40.	Curves vs Skeletons in Object Recognition (2001)
41.	Matching and recognition of planar shapes using medial axis properties
42.	Approximate Tree Matching and Shape Similarity (1999)
43.	Multiscale Skeletonization: An Electrostatic Field-Based Approach
Shape Matching Using Fourier/Wavelet Descriptors
44.	A Modified Fourier Descriptor for Shape Matching in MARS (1998)
45.	Invariant Fourier-Wavelet Descriptor For Pattern Recognition (1999)
Shape Matching Using Affine Invariant Descriptors
46.	Object Recognition Using Colour, Shape and Affine Invariant Ratios (1996)
47.	A new distance measure for non-rigid image matching (1999)
48.	A Framework for Non-rigid Matching and Correspondence (1996)
49.	A New Algorithm for Non-Rigid Point Matching (2000)
Shape Matching Using Graph Matching
50.	A graph distance metric based on the maximal common subgraph (1998)
51.	Genetic-Based Search for Error-Correcting Graph Isomorphism (1997)
52.	Unifying Graph Matching Problems with a Practical Solution (1998)
53.	Fast Error-correcting Graph Isomorphism Based on Model Precompilation (1996)
54.	Multiple Graph Matching with Bayesian Inference
55.	A graduated assignment algorithm for graph matching (1996)
56.	On Shape Similarity (1994)
57.	A New Method of Estimating Shape Similarity
58.	A Slowest-Random Algorithm for a Partial Contour Similarity Problem
Shape Matching using Analoguous Structures
59.	Analogical Structure Matching on Cartographic Data
60.	Genetic Algorithms for Analogical Mapping (1997)
Shape Matching Using Shape Context Descriptor
61.	Shape Context: A new descriptor for shape matching and object recognition (2000)
Shape Matching Using Statistical Analysis
62.	Statistical Shape Analysis Using Fixed Topology Skeletons: Corpus Callosum Study (1999)
63.	Learning Shape Models from Exmples using Automatic Shape Clustering and Procrustes Analysis
Surface Matching
64.	Messy Genetic Algorithms for Subset Feature Selection (1997)
65.	A Practical, Globally Optimal Algorithm for Geometric Matching under Uncertainty (2001)
66.	Orientation Constraints in Point-Based Elastic Image Registration (1998)
67.	Subdivision Schemes for Thin Plate Splines (1997)
68.	Approximate Thin Plate Spline Mappings
Shape Matching - General
114.	[ Knorr / Ng / Shilvock 1997 ] Finding Boundary Shape Matching Relationships in Spatial Data
116.	[ Loncaric, Sven 1998 ] A Survey of Shape Analysis Techniques
117.	[ H. Edelsbrunner, D.G. Kirkpatrick, R. Seidel 1983 ] On the Shape of a Set of Points in the Plane IEEE Trans. Information Theory, Vol. IT-29, no. 4, pp. 551--559. The article which first presented the idea of alpha shapes
118.	[ Remco C. Veltkamp, Michiel Hagedoorn 1999 ] State-of-the-Art in Shape Matching
Shape Matching based on Hausdorf Distance
119.	[ Chew, Goodrich et al 1993 ] Geometric Pattern Matching under Euclidean Motion
Shape Matching Using Skeletons
121.	[ Pavel Dimitrov Carlos ] Robust and Efficient Skeletal Graphs
Approximate String Matching
69.	Faster algorithms for string matching problems (1998)
Approximate Tree Matching
70.	Tree pattern matching and subset matching in deterministic O(n log³n)-time (2000)
71.	Approximate Tree Matching and Shape Similarity (1999)
Topological Spatial Types
72.	OO Formal Specification for Spatial Representation
73.	Lossless Representation of Topological Spatial Data (1995)
74.	Topological Canonization Of Planar Spatial Data And Its Incremental Maintenance (1999)
75.	On Testing the Topological Equivalence of Spatial Databases
76.	Efficient on-line topological simplification of network-like data
Geometric Rounding
77.	[ Milenkovic 1997 ] Shortest-path Rounding
78.	[ Halperin, Packer 1997 ] Snap Rounding Revisited
79.	[ Goodrich, Guibas 1997 ] Snap Rounding
Dual Grid
80.	[ Guting 2000 ] Dual Grid (2000)
81.	Virtual Realms (1996)
82.	Implementation of the ROSE Algebra
83.	Realm-based Spatial Data Types (1995)
84.	Computational Geometry on the Grid
Spatial Indexing
115.	[ Kriegel 2000 ] Managing Intervals Efficiently in Object-Relational Databases
123.	[ Knut Verbarg, Hartmut Noltemeier 1995 ] Dynamic Environmental Modeling By The C-Tree Horst Bunke, Takeo Kanade, Hartmut Noltemeier, editors, Modelling and Planning for Sensor Based Intelligent Robot Systems, pages 3-22. World Scientific Publishing, 1995. The C-Tree is a paged, dynamically balanced, spatial index developed from the Monotone Bisector* Tree which is developed from the Celltree but with none of the Celltree's limitations. It can support nearest neighbour,fixed-radius near neighbour, ray-shooting, and range queries. It can also support points/objects in polygon, objects hitting polygon, and hidden-line and surface retrieval. The Celltree can only support range and point queries. The MB* Tree organizes spatial objects into a tree of spherical clusters with the cluster radius monotonically decreasing as tree depth increases. Cluster partition lines don't have to be orthogonal to x or y axes as in the quadtree. This prevents fragmentation.
124.	[ S. Leutenegger, J. Edgington, M. Lopez 1997 ] STR: A Simple and Efficient Algorithm for R-Tree Packing
126.	[ Volker Gaede, Oliver Günther 1997 ] Multidimensional Access Methods
127.	[ Gsli R. Hjaltason, Hanan Samet 1999 ] Speeding Up Construction of Quadtrees for Spatial Indexing
128.	[ S. Leutenegger, J. Edgington, M. Lopez 1997 ] STR: A Simple and Efficient Algorithm for R-Tree Packing
129.	[ Hee Kap Ahn, Nikos Mamoulis, Ho Min Wong 1997 ] A Survey on Multidimensional Access Methods
Conflation Software
96.	Spatial Adjustment Engine
97.	ESEA
98.	GIS/T Conflate
99.	MRF-Clean
100.	Total Fit (works with FME)
Other Software
101.	JAGO
102.	GML Reader
103.	GML4J
104.	GeoVISTA Studio: a geocomputational workbench
Other References
85.	OoLaLa: Transformations for Implementations of Matrix Operations at High Abstraction Levels (2001)
86.	Robust and Efcicient Construction of Planar Minkowski Sums (2000)
87.	Polygon Decomposition for Efficient Construction of Minkowski Sums (1999)
88.	Polymorphic Matrices in Paladin (1995)
89.	Filling Gaps in the Boundary of a Polyhedron (1993)
91.	Detecting Graph-based Spatial Outliers: Algorithms and Applications (2001)
92.	A Unified Approach to Spatial Outliers Detection
93.	Constructing Piecewise Linear Homeomorphisms (1997)
94.	Constructing Piecewise Linear Homeomorphisms of Simple Polygons (1995)
95.	Constructing Pairwise Disjoint Paths with Few Links (1997)