Computational Geometry/Mapping

FacebookTwitter
http://svn.osgeo.org/gdal/trunk/gdal/frmts/idrisi/rst.txt Image File (.rst) -- File Structure Use Image files are the data files most commonly used in IDRISI. They store the raster data layers used in analyses. File Contents Image files contain the attribute value of each pixel in the image. Creation Image files are created by most IDRISI modules. A variety of non-IDRISI format raster data may also be converted to Image files using the File/Import modules. Structure and Examples While the logical structure of an Image file is a grid, the actual structure, as it is stored, is a single long column of numbers.

unnamed pearl

RayTrace software, release 3.3

http://math.ucsd.edu/~sbuss/MathCG/RayTrace/index.html {*style:<b>Author: Sam Buss Univ. of California, San Diego </b>*} [ View this page in Romanian , translation by Alexandra Seremina, courtesy of azoft . Or in German , translation by Maksim Ivancov.] This software package accompanies my book (Cambridge University Press, 2003).

Ray Tracing News, Volume 3, Number 4

http://jedi.ks.uiuc.edu/~johns/raytracer/rtn/rtnv3n4.html#art22 Ray Tracing News "Light Makes Right" October 1, 1990 Volume 3, Number 4 Compiled by erich@acm.org . Opinions expressed are mine.

Raster Mapping Formats - Raster Maps - Raster Scanned Maps

ADRG Files Description: ADRG is a raster format typically used by military and other government organizations. To load ADRG files, simply load the TRANSH01.THF file from the ADRG file heirarchy or load the ADRG data directly from a .zip file. Global Mapper v6.02 and above can load files in this format. ARCS (British Admiralty) Marine Charts http://www.globalmapper.com/product/formats_raster.htm#Idrisi__Format
Information on this site may not be accurate or current and is not valid for flight planning or navigation. No warranty of fitness for any purpose is made or implied. Flight planning and navigation should only be done using official charts. Copyright © 1996-2013 Karl L. Swartz . http://www.gcmap.com/mapui?P=5E52N-9E53N-7E50N-5E52N%2C7E52.5N%2C8E51.5N%2C6E51N&MS=wls&DU=mi

Great Circle Mapper

http://www.gfdl.noaa.gov/~vb/gridstd/gridstdse2.html

Gridspec: A standard for the description of grids used in Earth System models

PRINTSCRIPT; print $script_style; include "/var/www/html/core/partc"; $linkpage = <<< PRINTLINK gfdl homepage > people > v. balaji's homepage > this page PRINTLINK; print $linkpage; // GFDL header include "/var/www/html/core/partd"; $titlepage = <<< TITLEPAGE Gridspec: A standard for the description of grids used in Earth System models TITLEPAGE; print $titlepage; // GFDL header include_once( '/var/lib/php/counter.inc' ); error_reporting(E_ERROR); require_once('../magpierss/rss_fetch.inc'); require_once('../magpierss/rss_utils.inc'); include "/var/www/html/core/parte"; $pagecontent = <<< ENDCONTENT 2.

Coordinate conversions made easy

Location services -- including GPS-based navigation systems and map sites such as Google Maps and Yahoo! Maps -- have become popular among consumers. Many organizations are already making use of location-aware services, and many more will do so as they realize the benefits and potential that these services hold. In 2006, Gartner noted that "location-aware applications will hit mainstream adoption in the next two to five years" and that already an "increasing number of organizations have deployed location-aware mobile business applications." http://www.ibm.com/developerworks/java/library/j-coordconvert/
http://climate.lanl.gov/Software/SCRIP/

Los Alamos Climate Ocean and Sea Ice Modeling: Software: SCRIP

Los Alamos Software Release LACC 98-45 SCRIP is a software package which computes addresses and weights for remapping and interpolating fields between grids in spherical coordinates. It was written originally for remapping fields to other grids in a coupled climate model, but is sufficiently general that it can be used in other applications as well. The package should work for any grid on the surface of a sphere. SCRIP currently supports four remapping options:
http://egsc.usgs.gov/isb/pubs/MapProjections/projections.html || The Globe || Mercator || Transverse Mercator || Oblique Mercator || Space Oblique Mercator || || Miller Cylindrical || Robinson || Sinusoidal Equal Area || Orthographic || Stereographic || || Gnomonic || Azimuthal Equidistant || Lambert Azimuthal Equal Area || Albers Equal Area Conic || || Lambert Conformal Conic || Equidistant Conic (Simple Conic) || Polyconic || || Bipolar Oblique Conic Conformal || Summary Table || General Notes || PDF Version

Map Projections Poster

Transverse Mercator

Projection Parameters PROJ.4 Organization +proj=tmerc +lat_0= Latitude of natural origin +lon_0= Longitude of natural origin +k= Scale factor at natural origin +x_0= False Easting +y_0= False Northing EPSG Notes The Transverse Mercator projection in its various forms is the most widely used projected coordinate system for world topographical and offshore mapping. http://www.remotesensing.org/geotiff/proj_list/transverse_mercator.html

Triangle: .node files

.node files First line: <# of vertices><dimension (must be 2)><# of attributes><# of boundary markers (0 or 1)> Remaining lines: <vertex #><x><y> [attributes] [boundary marker] Blank lines and comments prefixed by `#' may be placed anywhere. Vertices must be numbered consecutively, starting from one or zero. The attributes, which are typically floating-point values of physical quantities (such as mass or conductivity) associated with the nodes of a finite element mesh, are copied unchanged to the output mesh. If -q , -a , -u, or -s is selected, each new Steiner point added to the mesh will have quantities assigned to it by linear interpolation. If the fourth entry of the first line is `1', the last column of the remainder of the file is assumed to contain boundary markers. Boundary markers are used to identify boundary vertices and vertices resting on PSLG segments .

Weiler-Atherton Clipping Applet

Background The Weiler-Atherton clipping algorithm is a general purpose 2D clipping algorithm. While most clipping algorithms are optimized for a rectangular clipping region, the Wieler-Atherton algorithm can use simple polygons for both the subject of the clipping as well as the actual clipping region itself. The algorithm has two general phases. In the first phase, all of the edges of both polygons are examined to find intersections. These intersections are inserted into point lists along with all of the points from the respective polygons.

Quadrilateral Intersection Area

This is a hard one. Maybe I can just help to point in the right direction. First thing I would do is find the intersection shape{s}:

spherical polygon centroid

the surface centroid of a spherical triangle is found: a) by intersecting the three median great circles or, b) by projecting the centroid of the planar triangle formed from the three corner vertices onto the sphere surface. is there a simple formula for calculating the surface centroid of a spherical convex polygon? something along the lines of the planar formula of combining the centroids of triangles weighted by their areas? n.b. just to emphasize that i'm after the *surface* centroid as opposed to the cartesian centroid which would lie below the surface. <p style="text-align:right;color:#A8A8A8"></p>