|
interpolating mapping searching |
|
In order to be used data must first be found. This section discusses geographic search strategies and provides links to software that can facilitate more accurate search results throughout the lifecycle of the data.
JAZ:
A Java geographic area selection module that provides the capability to define latitude/longitude bounding boxes, row/column bounding boxes, or spherical
quadrilaterals on a variety of projections by either drawing on a map or entering values into text fields. JAZ can be incorporated into a full Java search and order applet or used separately as part of an html forms based interface.
Spheres:
A Java package for doing spherical trigonometry without all the messy (and cpu intensive) trigonometry. The spheres package includes classes for points, spherical polygons, latitude/longitude bounding boxes, orbits, and scenes. Spheres documentation includes a variety of algorithm descriptions for performing areal comparisons on the sphere.
Backtrack: The Backtrack Orbit Search Algorithm is a unique spatial search method for orbital data. Backtrack has a degree of accuracy
that rivals predict methods while being faster, less costly to implement,
and less costly to maintain than any other method
Search Methods by Spatial
Type: Different kinds of data require different strategies for optimal spatial search. This
paper goes through the five most common spatial types (point, grid, tile, scene,
and swath) discusses the problems associated with each, and makes some
recommendations about the best search method for each.
Interfaces
: A survey of spatial search interfaces on the
Web