self-hosted/postgis
self-hosted/postgis
1
0
Fork 0
mirror of https://git.osgeo.org/gitea/postgis/postgis synced 2024-10-24 17:12:35 +00:00
Code Issues Packages Projects Releases Wiki Activity
postgis/liblwgeom/cunit/cu_measures.c
Sandro Santilli 89bb89d9d1 Give PARSER_CHECK macros an LW_ prefix [RT-SIGTA] 
git-svn-id: http://svn.osgeo.org/postgis/trunk@7725 b70326c6-7e19-0410-871a-916f4a2858ee
2011-08-11 07:51:45 +00:00

312 lines
8.6 KiB
C
Raw Blame History

/**********************************************************************
* $Id$
*
* PostGIS - Spatial Types for PostgreSQL
* http://postgis.refractions.net
* Copyright 2009 Paul Ramsey <pramsey@cleverelephant.ca>
*
* This is free software; you can redistribute and/or modify it under
* the terms of the GNU General Public Licence. See the COPYING file.
*
**********************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "CUnit/Basic.h"
#include "liblwgeom_internal.h"
#include "cu_tester.h"
#include "measures.h"
#include "lwtree.h"
static void do_test_mindistance2d_tolerance(char *in1, char *in2, double expected_res)
{
LWGEOM *lw1;
LWGEOM *lw2;
double distance;
lw1 = lwgeom_from_wkt(in1, LW_PARSER_CHECK_NONE);
lw2 = lwgeom_from_wkt(in2, LW_PARSER_CHECK_NONE);
distance = lwgeom_mindistance2d_tolerance(lw1, lw2, 0.0);
CU_ASSERT_EQUAL(distance, expected_res);
lwgeom_free(lw1);
lwgeom_free(lw2);
}
static void test_mindistance2d_tolerance(void)
{
/*
** Simple case.
*/
do_test_mindistance2d_tolerance("POINT(0 0)", "MULTIPOINT(0 1.5,0 2,0 2.5)", 1.5);
/*
** Point vs Geometry Collection.
*/
do_test_mindistance2d_tolerance("POINT(0 0)", "GEOMETRYCOLLECTION(POINT(3 4))", 5.0);
/*
** Point vs Geometry Collection Collection.
*/
do_test_mindistance2d_tolerance("POINT(0 0)", "GEOMETRYCOLLECTION(GEOMETRYCOLLECTION(POINT(3 4)))", 5.0);
/*
** Point vs Geometry Collection Collection Collection.
*/
do_test_mindistance2d_tolerance("POINT(0 0)", "GEOMETRYCOLLECTION(GEOMETRYCOLLECTION(GEOMETRYCOLLECTION(POINT(3 4))))", 5.0);
/*
** Point vs Geometry Collection Collection Collection Multipoint.
*/
do_test_mindistance2d_tolerance("POINT(0 0)", "GEOMETRYCOLLECTION(GEOMETRYCOLLECTION(GEOMETRYCOLLECTION(MULTIPOINT(3 4))))", 5.0);
/*
** Geometry Collection vs Geometry Collection
*/
do_test_mindistance2d_tolerance("GEOMETRYCOLLECTION(POINT(0 0))", "GEOMETRYCOLLECTION(POINT(3 4))", 5.0);
/*
** Geometry Collection Collection vs Geometry Collection Collection
*/
do_test_mindistance2d_tolerance("GEOMETRYCOLLECTION(GEOMETRYCOLLECTION(POINT(0 0)))", "GEOMETRYCOLLECTION(GEOMETRYCOLLECTION(POINT(3 4)))", 5.0);
/*
** Geometry Collection Collection Multipoint vs Geometry Collection Collection Multipoint
*/
do_test_mindistance2d_tolerance("GEOMETRYCOLLECTION(GEOMETRYCOLLECTION(MULTIPOINT(0 0)))", "GEOMETRYCOLLECTION(GEOMETRYCOLLECTION(MULTIPOINT(3 4)))", 5.0);
}
static void test_rect_tree_contains_point(void)
{
LWPOLY *poly;
POINT2D p;
RECT_NODE* tree;
int result;
int boundary = 0;
/* square */
poly = (LWPOLY*)lwgeom_from_wkt("POLYGON((0 0, 0 1, 1 1, 1 0, 0 0))", LW_PARSER_CHECK_NONE);
tree = rect_tree_new(poly->rings[0]);
/* inside square */
boundary = 0;
p.x = 0.5;
p.y = 0.5;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_NOT_EQUAL(result, 0);
/* outside square */
boundary = 0;
p.x = 1.5;
p.y = 0.5;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_EQUAL(result, 0);
rect_tree_free(tree);
lwpoly_free(poly);
/* ziggy zaggy horizontal saw tooth polygon */
poly = (LWPOLY*)lwgeom_from_wkt("POLYGON((0 0, 1 3, 2 0, 3 3, 4 0, 4 5, 0 5, 0 0))", LW_PARSER_CHECK_NONE);
tree = rect_tree_new(poly->rings[0]);
/* not in, left side */
boundary = 0;
p.x = -0.5;
p.y = 0.5;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_EQUAL(result, 0);
/* not in, right side */
boundary = 0;
p.x = 3.0;
p.y = 1.0;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_EQUAL(result, 0);
/* inside */
boundary = 0;
p.x = 2.0;
p.y = 1.0;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_NOT_EQUAL(result, 0);
/* on left border */
boundary = 0;
p.x = 0.0;
p.y = 1.0;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_EQUAL(boundary, 1);
/* on right border */
boundary = 0;
p.x = 4.0;
p.y = 0.0;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_EQUAL(boundary, 1);
/* on tooth concave */
boundary = 0;
p.x = 3.0;
p.y = 3.0;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_EQUAL(boundary, 1);
/* on tooth convex */
boundary = 0;
p.x = 2.0;
p.y = 0.0;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_EQUAL(boundary, 1);
rect_tree_free(tree);
lwpoly_free(poly);
/* ziggy zaggy vertical saw tooth polygon */
poly = (LWPOLY*)lwgeom_from_wkt("POLYGON((0 0, 3 1, 0 2, 3 3, 0 4, 3 5, 0 6, 5 6, 5 0, 0 0))", LW_PARSER_CHECK_NONE);
tree = rect_tree_new(poly->rings[0]);
/* not in, left side */
boundary = 0;
p.x = -0.5;
p.y = 3.5;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_EQUAL(result, 0);
/* not in, right side */
boundary = 0;
p.x = 6.0;
p.y = 2.2;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_EQUAL(result, 0);
/* inside */
boundary = 0;
p.x = 3.0;
p.y = 2.0;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_NOT_EQUAL(result, 0);
/* on bottom border */
boundary = 0;
p.x = 1.0;
p.y = 0.0;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_EQUAL(boundary, 1);
/* on top border */
boundary = 0;
p.x = 3.0;
p.y = 6.0;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_EQUAL(boundary, 1);
/* on tooth concave */
boundary = 0;
p.x = 3.0;
p.y = 1.0;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_EQUAL(boundary, 1);
/* on tooth convex */
boundary = 0;
p.x = 0.0;
p.y = 2.0;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_EQUAL(boundary, 1);
/* on tooth convex */
boundary = 0;
p.x = 0.0;
p.y = 6.0;
result = rect_tree_contains_point(tree, &p, &boundary);
CU_ASSERT_EQUAL(boundary, 1);
rect_tree_free(tree);
lwpoly_free(poly);
}
static void test_rect_tree_intersects_tree(void)
{
LWPOLY *poly1, *poly2;
RECT_NODE *tree1, *tree2;
int result;
/* total overlap, A == B */
poly1 = (LWPOLY*)lwgeom_from_wkt("POLYGON((0 0, 3 1, 0 2, 3 3, 0 4, 3 5, 0 6, 5 6, 5 0, 0 0))", LW_PARSER_CHECK_NONE);
poly2 = (LWPOLY*)lwgeom_from_wkt("POLYGON((0 0, 3 1, 0 2, 3 3, 0 4, 3 5, 0 6, 5 6, 5 0, 0 0))", LW_PARSER_CHECK_NONE);
tree1 = rect_tree_new(poly1->rings[0]);
tree2 = rect_tree_new(poly2->rings[0]);
result = rect_tree_intersects_tree(tree1, tree2);
CU_ASSERT_EQUAL(result, LW_TRUE);
lwpoly_free(poly1);
lwpoly_free(poly2);
rect_tree_free(tree1);
rect_tree_free(tree2);
/* hiding between the tines of the comb */
poly1 = (LWPOLY*)lwgeom_from_wkt("POLYGON((0 0, 3 1, 0 2, 3 3, 0 4, 3 5, 0 6, 5 6, 5 0, 0 0))", LW_PARSER_CHECK_NONE);
poly2 = (LWPOLY*)lwgeom_from_wkt("POLYGON((0.3 0.7, 0.3 0.8, 0.4 0.8, 0.4 0.7, 0.3 0.7))", LW_PARSER_CHECK_NONE);
tree1 = rect_tree_new(poly1->rings[0]);
tree2 = rect_tree_new(poly2->rings[0]);
result = rect_tree_intersects_tree(tree1, tree2);
CU_ASSERT_EQUAL(result, LW_FALSE);
lwpoly_free(poly1);
lwpoly_free(poly2);
rect_tree_free(tree1);
rect_tree_free(tree2);
/* between the tines, but with a corner overlapping */
poly1 = (LWPOLY*)lwgeom_from_wkt("POLYGON((0 0, 3 1, 0 2, 3 3, 0 4, 3 5, 0 6, 5 6, 5 0, 0 0))", LW_PARSER_CHECK_NONE);
poly2 = (LWPOLY*)lwgeom_from_wkt("POLYGON((0.3 0.7, 0.3 0.8, 0.4 0.8, 1.3 0.3, 0.3 0.7))", LW_PARSER_CHECK_NONE);
tree1 = rect_tree_new(poly1->rings[0]);
tree2 = rect_tree_new(poly2->rings[0]);
result = rect_tree_intersects_tree(tree1, tree2);
CU_ASSERT_EQUAL(result, LW_TRUE);
lwpoly_free(poly1);
lwpoly_free(poly2);
rect_tree_free(tree1);
rect_tree_free(tree2);
/* Just touching the top left corner of the comb */
poly1 = (LWPOLY*)lwgeom_from_wkt("POLYGON((0 0, 3 1, 0 2, 3 3, 0 4, 3 5, 0 6, 5 6, 5 0, 0 0))", LW_PARSER_CHECK_NONE);
poly2 = (LWPOLY*)lwgeom_from_wkt("POLYGON((-1 5, 0 5, 0 7, -1 7, -1 5))", LW_PARSER_CHECK_NONE);
tree1 = rect_tree_new(poly1->rings[0]);
tree2 = rect_tree_new(poly2->rings[0]);
result = rect_tree_intersects_tree(tree1, tree2);
CU_ASSERT_EQUAL(result, LW_TRUE);
lwpoly_free(poly1);
lwpoly_free(poly2);
rect_tree_free(tree1);
rect_tree_free(tree2);
}
static void
test_lwgeom_segmentize2d(void)
{
LWGEOM *linein = lwgeom_from_wkt("LINESTRING(0 0,10 0)", LW_PARSER_CHECK_NONE);
LWGEOM *lineout = lwgeom_segmentize2d(linein, 5);
char *strout = lwgeom_to_ewkt(lineout);
CU_ASSERT_STRING_EQUAL(strout, "LINESTRING(0 0,5 0,10 0)");
lwfree(strout);
lwgeom_free(linein);
lwgeom_free(lineout);
}
/*
** Used by test harness to register the tests in this file.
*/
CU_TestInfo measures_tests[] =
{
PG_TEST(test_mindistance2d_tolerance),
PG_TEST(test_rect_tree_contains_point),
PG_TEST(test_rect_tree_intersects_tree),
PG_TEST(test_lwgeom_segmentize2d),
CU_TEST_INFO_NULL
};
CU_SuiteInfo measures_suite = {"PostGIS Measures Suite", NULL, NULL, measures_tests};
Reference in a new issue View git blame Copy permalink