shp 0.0.1

data/ext/shp/shapelib/contrib/Shape_PointInPoly.cpp

@@ -0,0 +1,238 @@
+/******************************************************************************
+ * $Id: Shape_PointInPoly.cpp,v 1.1 2004-01-09 16:47:57 fwarmerdam Exp $
+ *
+ * Project:  Shapelib
+ * Purpose:  Commandline program to generate points-in-polygons from a 
+ *           shapefile as a shapefile.
+ * Author:   Marko Podgorsek, d-mon@siol.net
+ *
+ ******************************************************************************
+ * Copyright (c) 2004, Marko Podgorsek, d-mon@siol.net
+ *
+ * This software is available under the following "MIT Style" license,
+ * or at the option of the licensee under the LGPL (see LICENSE.LGPL).  This
+ * option is discussed in more detail in shapelib.html.
+ *
+ * --
+ * 
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included
+ * in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+ * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+ * DEALINGS IN THE SOFTWARE.
+ ******************************************************************************
+ *
+ * $Log: Shape_PointInPoly.cpp,v $
+ * Revision 1.1  2004-01-09 16:47:57  fwarmerdam
+ * New
+ *
+ */
+
+static char rcsid[] = 
+  "$Id: Shape_PointInPoly.cpp,v 1.1 2004-01-09 16:47:57 fwarmerdam Exp $";
+
+#include <string.h>
+#include <stdlib.h>
+#include <math.h>
+#include <shapefil.h>
+
+#define MAXINTERSECTIONPOINTS 255
+
+enum loopDir {
+    kExterior,   
+    kInterior,
+    kError
+};
+
+struct DPoint2d
+{
+    DPoint2d() 
+	{
+            x = y = 0.0;
+	};
+    DPoint2d(double x, double y)
+	{
+            this->x = x;
+            this->y = y;
+	};
+    double x,y;
+};
+
+struct IntersectPoint
+{
+    IntersectPoint(void) 
+	{
+            x = y = 0.0;
+            boundry_nmb = 0;
+            loopdirection = kError;
+	};
+    double x,y;
+    int boundry_nmb;
+    loopDir loopdirection;
+};
+
+loopDir LoopDirection(DPoint2d *vertices, int vertsize)
+{
+    int i;
+    double sum = 0.0;
+    for(i=0;i<vertsize-1;i++)
+    {
+        sum += (vertices[i].x*vertices[i+1].y)-(vertices[i].y*vertices[i+1].x);
+    }
+
+    if(sum>0)
+        return kInterior;
+    else
+        return kExterior;
+}
+
+DPoint2d CreatePointInPoly(SHPObject *psShape, int quality)
+{
+    int i, j, k, end, vert, pointpos;
+    double part, dx, xmin, xmax, ymin, ymax, y, x3, x4, y3, y4, len, maxlen = 0;
+    DPoint2d *vertices;
+    loopDir direction;
+    IntersectPoint mp1, mp2, point1, point2, points[MAXINTERSECTIONPOINTS];
+
+    xmin = psShape->dfXMin;
+    ymin = psShape->dfYMin;
+    xmax = psShape->dfXMax;
+    ymax = psShape->dfYMax;
+    part = (ymax-ymin)/(quality+1);
+    dx = xmax-xmin;
+    for(i=0;i<quality;i++)
+    {
+        y = ymin+part*(i+1);
+        pointpos = 0;
+        for(j=0;j<psShape->nParts;j++)
+        {
+            if(j==psShape->nParts-1)
+                end = psShape->nVertices;
+            else
+                end = psShape->panPartStart[j+1];
+            vertices = new DPoint2d [end-psShape->panPartStart[j]];
+            for(k=psShape->panPartStart[j],vert=0;k<end;k++)
+            {
+                vertices[vert].x = psShape->padfX[k];
+                vertices[vert++].y = psShape->padfY[k];
+            }
+            direction = LoopDirection(vertices, vert);
+            for(k=0;k<vert-1;k++)
+            {
+                y3 = vertices[k].y;
+                y4 = vertices[k+1].y;
+                if((y3 >= y && y4 < y) || (y3 <= y && y4 > y)) //I check >= only once, because if it's not checked now (y3) it will be in the next iteration (which is y4 now)
+                {
+                    point1.boundry_nmb = j;
+                    point1.loopdirection = direction;
+                    x3 = vertices[k].x;
+                    x4 = vertices[k+1].x;
+                    if(y3==y)
+                    {
+                        point1.y = y3;
+                        point1.x = x3;
+                        if(direction == kInterior) //add point 2 times if the direction is interior, so that the final count of points is even
+                        {
+                            points[pointpos++]=point1;
+                        }
+                    }
+                    else
+                    {
+                        point1.x = xmin+(((((x4-x3)*(y-y3))-((y4-y3)*(xmin-x3)))/((y4-y3)*dx))*dx); //striped down calculation of intersection of 2 lines
+                        point1.y = y;
+                    }
+                    points[pointpos++]=point1;
+                }
+            }
+            delete [] vertices;
+        }
+
+        for(j=1;j<pointpos;j++) //sort the found intersection points by x value
+        {
+            for(k=j;k>0;k--)
+            {
+                if(points[k].x < points[k-1].x)
+                {
+                    point1 = points[k];
+                    points[k] = points[k-1];
+                    points[k-1] = point1;
+                }
+                else
+                {
+                    break;
+                }
+            }
+        }
+
+        for(j=0;j<pointpos-1;j++)
+        {
+            point1 = points[j];
+            point2 = points[j+1];
+            if((point1.loopdirection == kExterior         &&  //some checkings for valid point
+                point2.loopdirection == kExterior         &&
+                point1.boundry_nmb == point2.boundry_nmb  &&
+                j%2==0)                                   ||
+               (point1.loopdirection == kExterior        &&
+                point2.loopdirection == kInterior)        ||
+               (point1.loopdirection == kInterior        &&
+                point2.loopdirection == kExterior))
+            {
+                len = sqrt(pow(point1.x-point2.x, 2)+pow(point1.y-point2.y, 2));
+                if(len >= maxlen)
+                {
+                    maxlen = len;
+                    mp1 = point1;
+                    mp2 = point2;
+                }
+            }
+        }
+    }
+
+    return DPoint2d((mp1.x+mp2.x)*0.5, (mp1.y+mp2.y)*0.5);
+}
+
+int main(int argc, char* argv[])
+{
+    if(argc != 3)
+    {
+        printf("Usage: %s shpfile_path quality\n", argv[0]);
+        return 1;
+    }
+
+    int i, nEntities, quality;
+    SHPHandle hSHP;
+    SHPObject	*psShape;
+    DPoint2d pt;
+    quality = atoi(argv[2]);
+    hSHP = SHPOpen(argv[1], "rb");
+    SHPGetInfo(hSHP, &nEntities, NULL, NULL, NULL);
+
+    printf("PointInPoly v1.0, by Marko Podgorsek\n----------------\n");
+    for( i = 0; i < nEntities; i++ )
+    {
+        psShape = SHPReadObject( hSHP, i );
+        if(psShape->nSHPType == SHPT_POLYGON)
+        {
+            pt = CreatePointInPoly(psShape, quality);
+            printf("%d: x=%f y=%f\n",i, pt.x,pt.y);
+        }
+        SHPDestroyObject( psShape );
+    }
+
+    SHPClose(hSHP);
+
+    return 0;
+}
+

data/ext/shp/shapelib/contrib/Shape_PointInPoly_README.txt

@@ -0,0 +1,59 @@
+===============================================================================
+Project:  Shape_PoinInPoly
+Purpose:  Sample and the function for calculatin a point in a polygon 
+	  (complex,compound - it doesn't matter). Can be used for labeling.
+Author:   Copyright (c) 2004, Marko Podgorsek, d-mon@siol.net
+===============================================================================
+Requires: shapelib 1.2 (http://shapelib.maptools.org/)
+Tested and created on platform: 
+   Windows 2000 Professional
+   Visual Studio .NET 7.0
+   P4 2.4 GHz
+   1GB RAM
+
+I just found out about the ShapeLib, GDAL and OGR and I must say that they're 
+all great projects.
+I belive I'll use some of those libraries in the future. Right now I'm using 
+only shapelib.
+The thing that led me to the http://wwww.maptools.org was the need of finding 
+the point in poly...but as I found out that even OGR didn't support it. So 
+there I was. I was forced to make my own function. Well, it was fun. I learned
+a lot.
+I wrote this function for the Autodesk Autocad 2004 MPolygon, because there was
+no function to do this in the Object Arx SDK (the Acad programming SDK). Well, 
+it will be in the 2005 release...but, still. There is a function in the 
+Autodesk Map 2004 version...in the menu.
+Not usefull when you need the coordinates, not the point on the screen...
+So when the Acad version was done I was thinking of doing it on the Shape files,
+too. A little bit of changing the structures and variable
+types (so they're not using Object Arx) and I was done.
+And here it is....Contribution from me to the ShapeLib world :)...and maybe even
+OGR (a little bit of changing there).
+
+Some statistics:
+For about 69000 polygons in Autocad picture (.dwg files)
+Autodesk Map 2004 was creating centroids (the menu command) about 45s (1 scan 
+line)
+My function, with 3 scan lines took about 5s. And I was drawing the dots on the
+picture...
+
+-------------------------------------------------------------------------------
+DPoint2d CreatePointInPoly(SHPObject *psShape, int quality)
+
+The second parameter quality tell the function just how many rays shall it use
+to get the point. 
+quality = 3 works very well, but anything below 5 is good.
+This doesn't mean that the execution will slow down, but it just finds a good
+point. That's all.
+
+The qality shows on the compound objects (multiple poligons with more than one
+exterior loop) - if not enough rays, then there may be no centroid.
+Or the U shaped thin polygon, only the bootom (below the y center line) is fat.
+Autodesk Map with one scan line will create the centroid on one of the thin
+parts, because it only uses the y center line. If you have more rays, one will
+surely pass the fat area and centroid will be created there.
+
+-------------------------------------------------------------------------------
+Anyone using this function:
+Just send me an e-mail, so I'll see if I did anything good for the public.
+And you can send me e-mail with questions also.

data/ext/shp/shapelib/contrib/csv2shp.c

@@ -0,0 +1,558 @@
+/*
+csv2shp - converts a character delimited file to a ESRI shapefile
+Copyright (C) 2005 Springs Rescue Mission
+
+
+LICENSE
+This program is free software; you can redistribute it and/or
+modify it under the terms of the GNU General Public License
+as published by the Free Software Foundation; either version 2
+of the License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software
+Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
+
+The GNU General Public License is also available from the web
+site <http://www.gnu.org>.
+
+
+GRATITUDE
+Like this program?  Donate at <http://springsrescuemission.org>.
+
+
+COMPILING INSTRUCTIONS
+This program was written and tested using Shapefile C Library version
+1.2.10 available at <http://shapelib.maptools.org>.
+
+To compile, copy csv2shp.c to the directory with Shapefile C Library.
+Then, compile Shapefile C library.  Then, run something like this:
+
+	gcc -pedantic -Wall -o csv2shp csv2shp.c -I. *o
+
+
+USAGE NOTES
+This program operates on single points only (not polygons or lines).
+
+The input file may be a .csv file (comma separated values) or tab-separated
+values, or it may be separated by any other character.  The first row must 
+contain column names.  There must be each a column named longitude and 
+latitude in the input file.
+
+The .csv parser does not understand text delimiters (e.g. quotation mark).
+It parses fields only by the given field delimiter (e.g. comma or tab).
+The program has not been tested with null values, and in this case, the
+behavior is undefined.  The program will not accept lines with a trailing 
+delimiter character.
+
+All columns (including longitude and latitude) in the input file are exported 
+to the .dbf file.
+
+The program attempts to find the best type (integer, decimal, string) and
+smallest size of the fields necessary for the .dbf file.
+
+
+SUPPORT
+Springs Rescue Mission does not offer any support for this program.
+
+
+CONTACT INFORMATION
+Springs Rescue Mission
+5 West Las Vegas St
+PO Box 2108
+Colorado Springs CO 80901
+Web: <http://springsrescuemission.org>
+Email: <http://springsrescuemission.org/email.php?recipient=webmaster>
+
+*/
+
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "shapefil.h"
+#include "regex.h"
+
+#define MAX_COLUMNS 30
+
+typedef struct column_t {
+	DBFFieldType eType;
+	int nWidth;
+	int nDecimals;
+} column;
+
+/* counts the number of occurances of the character in the string */
+int strnchr(const char *s, char c)
+{
+	int n = 0;
+	int x = 0;
+
+	for (; x < strlen(s); x++)
+	{
+		if (c == s[x])
+		{
+			n++;
+		}
+	}
+
+	return n;
+}
+
+/* Returns a field given by column n (0-based) in a character-
+   delimited string s */
+char * delimited_column(char *s, char delim, int n)
+{
+	static char szreturn[4096];
+	char szbuffer[4096]; /* a copy of s */
+	char * pchar;
+	int x;
+	char szdelimiter[2]; /* delim converted to string */
+
+	if (strnchr(s, delim) < n)
+	{
+		fprintf(stderr, "delimited_column: n is too large\n");
+		return NULL;
+	}
+
+	strcpy(szbuffer, s);
+	szdelimiter[0] = delim;
+	szdelimiter[1] = '\0';
+	x = 0;
+	pchar = strtok(szbuffer, szdelimiter);
+	while (x < n)
+	{	
+		pchar = strtok(NULL, szdelimiter);
+		x++;
+	}
+
+	if (NULL == pchar)
+	{
+		return NULL;
+	}
+
+	strcpy(szreturn, pchar);
+	return szreturn;
+}
+
+/* Determines the most specific column type.
+   The most specific types from most to least are integer, float, string.  */
+DBFFieldType str_to_fieldtype(const char *s)
+{
+	regex_t regex_i;
+	regex_t regex_d;
+
+	if (0 != regcomp(&regex_i, "^[0-9]+$", REG_NOSUB|REG_EXTENDED))
+	{
+		fprintf(stderr, "integer regex complication failed\n");
+		exit (EXIT_FAILURE);
+	}
+	
+	if (0 == regexec(&regex_i, s, 0, NULL, 0))
+	{
+		regfree(&regex_i);
+		return FTInteger;
+	}
+
+	regfree(&regex_i);
+
+	if (0 != regcomp(&regex_d, "^-?[0-9]+\\.[0-9]+$", REG_NOSUB|REG_EXTENDED))
+	{
+		fprintf(stderr, "integer regex complication failed\n");
+		exit (EXIT_FAILURE);
+	}
+
+	if (0 == regexec(&regex_d, s, 0, NULL, 0))
+	{
+		regfree(&regex_d);
+		return FTDouble;
+	}
+
+	regfree(&regex_d);
+
+	return FTString;
+}
+
+int float_width(const char *s)
+{
+	regex_t regex_d;
+	regmatch_t pmatch[2];
+	char szbuffer[4096];
+
+	if (0 != regcomp(&regex_d, "^(-?[0-9]+)\\.[0-9]+$", REG_EXTENDED))
+	{
+		fprintf(stderr, "integer regex complication failed\n");
+		exit (EXIT_FAILURE);
+	}
+
+	if (0 != regexec(&regex_d, s, 2, &pmatch[0], 0))
+	{
+		return -1;
+	}
+
+	strncpy(szbuffer, &s[pmatch[1].rm_so], pmatch[1].rm_eo - pmatch[1].rm_so);
+	szbuffer[pmatch[1].rm_eo - pmatch[1].rm_so] = '\0';
+	regfree(&regex_d);
+
+	return strlen(szbuffer);
+}
+
+/* returns the field width */
+int str_to_nwidth(const char *s, DBFFieldType eType)
+{
+	switch (eType)
+	{
+		case FTString:
+		case FTInteger:
+		case FTDouble:
+			return strlen(s);
+
+		default:
+			fprintf(stderr, "str_to_nwidth: unexpected type\n");
+			exit (EXIT_FAILURE);
+	}
+}
+
+/* returns the number of decimals in a real number given as a string s */
+int str_to_ndecimals(const char *s)
+{
+	regex_t regex_d;
+	regmatch_t pmatch[2];
+	char szbuffer[4096];
+
+	if (0 != regcomp(&regex_d, "^-?[0-9]+\\.([0-9]+)$", REG_EXTENDED))
+	{
+		fprintf(stderr, "integer regex complication failed\n");
+		exit (EXIT_FAILURE);
+	}
+
+	if (0 != regexec(&regex_d, s, 2, &pmatch[0], 0))
+	{
+		return -1;
+	}
+
+	strncpy(szbuffer, &s[pmatch[1].rm_so], pmatch[1].rm_eo - pmatch[1].rm_so);
+	szbuffer[pmatch[1].rm_eo - pmatch[1].rm_so] = '\0';
+
+	regfree(&regex_d);
+
+	return strlen(szbuffer);
+}
+
+/* returns true if f1 is more general than f2, otherwise false */
+int more_general_field_type(DBFFieldType t1, DBFFieldType t2)
+{
+	if (FTInteger == t2 && t1 != FTInteger)
+	{
+		return 1;
+	}
+
+	if (FTDouble == t2 && FTString == t1)
+	{
+		return 1;
+	}
+	
+	return 0;
+}
+
+void strip_crlf (char *line)
+{
+  /* remove trailing CR/LF */
+
+  if (strchr (line, 0x0D))
+    {
+      char *pszline;
+      pszline = strchr (line, 0x0D);
+      pszline[0] = '\0';
+    }
+
+  if (strchr (line, 0x0A))
+    {
+      char *pszline;
+      pszline = strchr (line, 0x0A);
+      pszline[0] = '\0';
+    }
+}
+
+int main( int argc, char ** argv )
+{
+	FILE *csv_f;
+	char sbuffer[4096];
+	char delimiter;
+	int n_columns; /* 1-based */
+	int n_line;
+	int n_longitude = -1; /* column with x, 0 based */
+	int n_latitude = -1; /* column with y, 0 based */
+	int x;
+	DBFHandle dbf_h;
+	SHPHandle shp_h;
+	column columns[MAX_COLUMNS + 1];
+
+	printf("csv2shp version 1, Copyright (C) 2005 Springs Rescue Mission\n");
+
+	if (4 != argc)
+	{
+		fprintf(stderr, "csv2shp comes with ABSOLUTELY NO WARRANTY; for details\n");
+		fprintf(stderr, "see csv2shp.c.  This is free software, and you are welcome\n");
+		fprintf(stderr, "to redistribute it under certain conditions; see csv2shp.c\n");
+		fprintf(stderr, "for details\n");
+		fprintf(stderr, "\n");
+		fprintf(stderr, "USAGE\n");
+		fprintf(stderr, "csv2shp csv_filename delimiter_character shp_filename\n");
+		fprintf(stderr, "   csv_filename\n");
+		fprintf(stderr, "     columns named longitude and latitude must exist\n");
+		fprintf(stderr, "   delimiter_character\n");
+		fprintf(stderr, "     one character only\n");
+		fprintf(stderr, "   shp_filename\n");
+		fprintf(stderr, "     base name, do not give the extension\n");
+		return EXIT_FAILURE;
+	}
+
+	if (strlen(argv[2]) > 1)
+	{
+		fprintf(stderr, "delimiter must be one character in length\n");
+		return EXIT_FAILURE;
+	}
+
+	delimiter = argv[2][0];
+
+	csv_f = fopen(argv[1], "r");
+
+	if (NULL == csv_f)
+	{
+		perror("could not open csv file");
+		exit (EXIT_FAILURE);
+	}
+
+	fgets(sbuffer, 4000, csv_f);
+
+	/* check first row */
+
+	strip_crlf(sbuffer);
+
+	if (delimiter == sbuffer[strlen(sbuffer)- 1])
+	{
+		fprintf(stderr, "lines must not end with the delimiter character\n");
+		return EXIT_FAILURE;
+
+	}
+
+	/* count columns and verify consistency*/
+
+	n_columns = strnchr(sbuffer, delimiter);
+
+	if (n_columns > MAX_COLUMNS)
+	{
+		fprintf(stderr, "too many columns, maximum is %i\n", MAX_COLUMNS);
+		return EXIT_FAILURE;
+	}
+
+	n_line = 1;
+
+	while (!feof(csv_f))
+	{
+		n_line++;
+		fgets(sbuffer, 4000, csv_f);
+		if (n_columns != strnchr(sbuffer, delimiter))
+		{
+			fprintf(stderr, "Number of columns on row %i does not match number of columns on row 1\n", n_columns);
+			return EXIT_FAILURE;
+		}
+	}
+
+	/* identify longitude and latitude columns */
+
+	fseek(csv_f, 0, SEEK_SET);
+	fgets(sbuffer, 4000, csv_f);
+	strip_crlf(sbuffer);
+
+	for (x = 0; x <= n_columns; x++)
+	{	
+		if (0 == strcasecmp("Longitude", delimited_column(sbuffer, delimiter, x)))
+		{
+			n_longitude = x;
+		}
+
+		if (0 == strcasecmp("Latitude", delimited_column(sbuffer, delimiter, x)))
+		{
+			n_latitude = x;
+		}
+	}
+
+#ifdef DEBUG
+	printf("debug lat/long = %i/%i\n", n_latitude, n_longitude);
+#endif
+
+	if (-1 == n_longitude || -1 == n_latitude)
+	{
+		fprintf(stderr, "The header row must define one each a column named longitude and latitude\n");
+		return EXIT_FAILURE;
+	}
+
+	/* determine best fit for each column */
+
+	printf ("Anaylzing column types...\n");
+
+#ifdef DEBUG
+	printf("debug: string type = %i\n", FTString);
+	printf("debug: int type = %i\n", FTInteger);
+	printf("debug: double type = %i\n", FTDouble);
+#endif
+	for (x = 0; x <= n_columns; x++)
+	{	
+#ifdef DEBUG
+		printf("debug: examining column %i\n", x);
+#endif
+		columns[x].eType = FTInteger;
+		columns[x].nWidth = 2;
+		columns[x].nDecimals = 0;
+	
+		fseek(csv_f, 0, SEEK_SET);
+		fgets(sbuffer, 4000, csv_f);
+
+		while (!feof(csv_f))
+		{
+			char szfield[4096];
+#ifdef DEBUG
+			printf ("column %i, type = %i, w = %i, d = %i\n", x, columns[x].eType, columns[x].nWidth, columns[x].nDecimals);
+#endif
+			if (NULL == fgets(sbuffer, 4000, csv_f))
+			{
+				if (!feof(csv_f))
+				{
+					fprintf(stderr, "error during fgets()\n");
+				}
+				continue;
+			}
+			strcpy(szfield, delimited_column(sbuffer, delimiter, x));
+			if (more_general_field_type(str_to_fieldtype(szfield), columns[x].eType))
+			{
+				columns[x].eType = str_to_fieldtype(szfield);
+				columns[x].nWidth = 2;
+				columns[x].nDecimals = 0;
+				fseek(csv_f, 0, SEEK_SET);
+				fgets(sbuffer, 4000, csv_f);
+				continue;
+			}
+			if (columns[x].nWidth < str_to_nwidth(szfield, columns[x].eType))
+			{
+				columns[x].nWidth = str_to_nwidth(szfield, columns[x].eType);
+			}
+			if (FTDouble == columns[x].eType && columns[x].nDecimals < str_to_ndecimals(szfield))
+			{
+				columns[x].nDecimals = str_to_ndecimals(szfield);
+			}
+
+		}
+	}
+
+
+	/* initilize output files */
+
+	printf ("Initializing output files...\n");
+
+	shp_h = SHPCreate(argv[3], SHPT_POINT);
+
+	dbf_h = DBFCreate(argv[3]);
+
+	if (NULL == dbf_h)
+	{
+		fprintf(stderr, "DBFCreate failed\n");
+		exit (EXIT_FAILURE);
+	}
+
+	fseek(csv_f, 0, SEEK_SET);
+	fgets(sbuffer, 4000, csv_f);
+	strip_crlf(sbuffer);
+
+	for (x = 0; x <= n_columns; x++)
+	{	
+#ifdef DEBUG
+		printf ("debug: final: column %i, type = %i, w = %i, d = %i, name=|%s|\n", x, columns[x].eType, columns[x].nWidth, columns[x].nDecimals, delimited_column(sbuffer, delimiter, x));
+#endif
+		if (-1 == DBFAddField(dbf_h, delimited_column(sbuffer, delimiter, x), columns[x].eType, columns[x].nWidth, columns[x].nDecimals))
+		{
+			fprintf(stderr, "DBFFieldAdd failed column %i\n", x + 1);
+			exit (EXIT_FAILURE);
+		}
+
+	}
+
+	/* write data */
+
+	printf ("Writing data...\n");
+
+	fseek(csv_f, 0, SEEK_SET);
+	fgets(sbuffer, 4000, csv_f); /* skip header */
+
+	n_columns = strnchr(sbuffer, delimiter);
+	n_line = 1;
+
+	while (!feof(csv_f))
+	{
+		SHPObject * shp;
+		double x_pt;
+		double y_pt;
+		int shp_i;
+
+		n_line++;
+		fgets(sbuffer, 4000, csv_f);
+		
+		/* write to shape file */
+		x_pt = atof(delimited_column(sbuffer, delimiter, n_longitude));
+		y_pt = atof(delimited_column(sbuffer, delimiter, n_latitude));
+
+#ifdef DEBUG
+		printf("debug: sbuffer=%s", sbuffer);
+		printf("debug: x,y = %f, %f\n", x_pt, y_pt);
+#endif
+
+		shp = SHPCreateSimpleObject(SHPT_POINT, 1, &x_pt, &y_pt, NULL);
+		shp_i = SHPWriteObject(shp_h, -1, shp);
+		SHPDestroyObject(shp);
+
+		/* write to dbf */
+
+		for (x = 0; x <= n_columns; x++)
+		{	
+			char szfield[4096];
+			int b;
+
+			strcpy(szfield, delimited_column(sbuffer, delimiter, x));
+
+			switch (columns[x].eType)
+			{
+				case FTInteger:
+					b = DBFWriteIntegerAttribute(dbf_h, shp_i, x, atoi(szfield));
+					break;
+				case FTDouble:
+					b = DBFWriteDoubleAttribute(dbf_h, shp_i, x, atof(szfield));
+					break;
+				case FTString:
+					b = DBFWriteStringAttribute(dbf_h, shp_i, x, szfield);
+					break;
+				default:
+					fprintf(stderr, "unexpected column type %i in column %i\n", columns[x].eType, x);
+			}
+			
+			if (!b)
+			{
+				fprintf(stderr, "DBFWrite*Attribute failed\n");
+				exit (EXIT_FAILURE);
+			}
+		}
+	}
+
+	/* finish up */
+
+	SHPClose(shp_h);
+	
+        DBFClose(dbf_h);
+
+	return EXIT_SUCCESS;
+}