qq_34581491的博客

drop table if exists public."position";CREATE TABLE public."position" ( id serial NOT NULL, "name" varchar(255) NOT NULL DEFAULT 'unnamed'::character varying, geom geometry NOT NULL, CONSTRAINT position_pk PRIMARY KEY (id));insert into public."pos

点线段的距离函数#include #include struct POINT{ double x; double y;};typedef POINT VECTOR;struct SEGMENT{ POINT * pStart; POINT * pEnd;};class Segment{public: POINT * pStart; POINT * pEn

1. 硬币法，存在问题：按顺时针排序，如果Pn, Pm, pP0共线如何处理？（比如{0, 10}, {5, 0}, {10, 0}三点凸包如何处理，{5, 0}是不是凸包上的点）#include #include #include struct POINT{ double x; double y;};typedef POINT VECTOR;class{public

中位中心栅格遍历法#include #include namespace geo{ struct POINT { double x; double y; }; //栅格法寻找中位中心 POINT GetMedianCentre(const POINT * pts, int n, double d/*设置栅格化格网宽度*/) { double min_x = p

三角网生长法（课本上的方法按原意实现）//控制台演示#include #include #include #include #include #define PI 3.14159struct POINT{ double x; double y;};typedef POINT VECTOR;struct SEGMENT{ POINT * p_begin; P

参考：http://malagis.com/win7-vs2010-gdal.html1. 下载GDAL。官网地址：http://trac.osgeo.org/gdal/wiki/DownloadSource2. 执行VCVARS32.BAT。以管理员身份执行cmd，找到并运行编译器下的VCVARS32.BAT。3. 编译GDAL。在cmd中转到下载文件的目录（比如截至目前最新

#include typedef struct Point {float x, y;} Vector;struct Line {Point p1, p2;};bool iscross(const Line & l1, const Line & l2, Point * pOut = nullptr){ Vector v1 = {l1.p2.x - l1.p1.x, l1.p2.y -

vs2015 c++11 standard or later1. geometry.h#ifndef GEOMERTY_H_#define GEOMETRY_H_#include union Point{ struct { float x, y; }; float compo[2];};typedef std::deque PointList;#e