34d96f3ef2
between inner and outter rings (Polygon/NultiPolygon) -- ref #2151 https://github.com/mapbox/unpacker/issues/324 ```txt A polygon consists of one or more rings. A ring is a connected sequence of four or more points that form a closed, non-self-intersecting loop. A polygon may contain multiple outer rings. The order of vertices or orientation for a ring indicates which side of the ring is the interior of the polygon. The neighborhood to the right of an observer walking along the ring in vertex order is the neighborhood inside the polygon. Vertices of rings defining holes in polygons are in a counterclockwise direction. Vertices for a single, ringed polygon are, therefore, always in clockwise order. The rings of a polygon are referred to as its parts. ```
211 lines
6 KiB
C++
211 lines
6 KiB
C++
/*****************************************************************************
|
|
*
|
|
* This file is part of Mapnik (c++ mapping toolkit)
|
|
*
|
|
* Copyright (C) 2014 Artem Pavlenko
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
*
|
|
* This library 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
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with this library; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*
|
|
*****************************************************************************/
|
|
|
|
#include "shape_io.hpp"
|
|
|
|
// mapnik
|
|
#include <mapnik/debug.hpp>
|
|
#include <mapnik/make_unique.hpp>
|
|
#include <mapnik/datasource.hpp>
|
|
#include <mapnik/geom_util.hpp>
|
|
// boost
|
|
|
|
using mapnik::datasource_exception;
|
|
using mapnik::geometry_type;
|
|
using mapnik::hit_test_first;
|
|
const std::string shape_io::SHP = ".shp";
|
|
const std::string shape_io::DBF = ".dbf";
|
|
const std::string shape_io::INDEX = ".index";
|
|
|
|
shape_io::shape_io(std::string const& shape_name, bool open_index)
|
|
: type_(shape_null),
|
|
shp_(shape_name + SHP),
|
|
dbf_(shape_name + DBF),
|
|
reclength_(0),
|
|
id_(0)
|
|
{
|
|
bool ok = (shp_.is_open() && dbf_.is_open());
|
|
if (! ok)
|
|
{
|
|
throw datasource_exception("Shape Plugin: cannot read shape file '" + shape_name + "'");
|
|
}
|
|
|
|
if (open_index)
|
|
{
|
|
try
|
|
{
|
|
index_ = std::make_unique<shape_file>(shape_name + INDEX);
|
|
}
|
|
catch (...)
|
|
{
|
|
MAPNIK_LOG_WARN(shape) << "shape_io: Could not open index=" << shape_name << INDEX;
|
|
}
|
|
}
|
|
}
|
|
|
|
shape_io::~shape_io() {}
|
|
|
|
void shape_io::move_to(std::streampos pos)
|
|
{
|
|
shp_.seek(pos);
|
|
id_ = shp_.read_xdr_integer();
|
|
reclength_ = shp_.read_xdr_integer();
|
|
}
|
|
|
|
shape_file& shape_io::shp()
|
|
{
|
|
return shp_;
|
|
}
|
|
|
|
dbf_file& shape_io::dbf()
|
|
{
|
|
return dbf_;
|
|
}
|
|
|
|
void shape_io::read_bbox(shape_file::record_type & record, mapnik::box2d<double> & bbox)
|
|
{
|
|
double lox = record.read_double();
|
|
double loy = record.read_double();
|
|
double hix = record.read_double();
|
|
double hiy = record.read_double();
|
|
bbox.init(lox, loy, hix, hiy);
|
|
}
|
|
|
|
void shape_io::read_polyline( shape_file::record_type & record, mapnik::geometry_container & geom)
|
|
{
|
|
int num_parts = record.read_ndr_integer();
|
|
int num_points = record.read_ndr_integer();
|
|
if (num_parts == 1)
|
|
{
|
|
std::unique_ptr<geometry_type> line(new geometry_type(mapnik::geometry_type::types::LineString));
|
|
record.skip(4);
|
|
double x = record.read_double();
|
|
double y = record.read_double();
|
|
line->move_to(x, y);
|
|
for (int i = 1; i < num_points; ++i)
|
|
{
|
|
x = record.read_double();
|
|
y = record.read_double();
|
|
line->line_to(x, y);
|
|
}
|
|
geom.push_back(line.release());
|
|
}
|
|
else
|
|
{
|
|
std::vector<int> parts(num_parts);
|
|
for (int i = 0; i < num_parts; ++i)
|
|
{
|
|
parts[i] = record.read_ndr_integer();
|
|
}
|
|
|
|
int start, end;
|
|
for (int k = 0; k < num_parts; ++k)
|
|
{
|
|
std::unique_ptr<geometry_type> line(new geometry_type(mapnik::geometry_type::types::LineString));
|
|
start = parts[k];
|
|
if (k == num_parts - 1)
|
|
{
|
|
end = num_points;
|
|
}
|
|
else
|
|
{
|
|
end = parts[k + 1];
|
|
}
|
|
|
|
double x = record.read_double();
|
|
double y = record.read_double();
|
|
line->move_to(x, y);
|
|
|
|
for (int j = start + 1; j < end; ++j)
|
|
{
|
|
x = record.read_double();
|
|
y = record.read_double();
|
|
line->line_to(x, y);
|
|
}
|
|
geom.push_back(line.release());
|
|
}
|
|
}
|
|
}
|
|
|
|
template <typename T>
|
|
bool is_clockwise(T const& points, int start, int end)
|
|
{
|
|
int num_points = end - start;
|
|
double area = 0.0;
|
|
for (int i = 0; i < num_points; ++i)
|
|
{
|
|
auto const& p0 = points[start + i];
|
|
auto const& p1 = points[start + (i + 1) % num_points];
|
|
area += std::get<0>(p0) * std::get<1>(p1) - std::get<1>(p0) * std::get<0>(p1);
|
|
}
|
|
return ( area < 0.0) ? true : false;
|
|
}
|
|
|
|
void shape_io::read_polygon(shape_file::record_type & record, mapnik::geometry_container & geom)
|
|
{
|
|
int num_parts = record.read_ndr_integer();
|
|
int num_points = record.read_ndr_integer();
|
|
std::vector<int> parts(num_parts);
|
|
|
|
using points_cont = std::vector<std::tuple<double,double> >;
|
|
points_cont points;
|
|
points.reserve(num_points);
|
|
|
|
for (int i = 0; i < num_parts; ++i)
|
|
{
|
|
parts[i] = record.read_ndr_integer();
|
|
}
|
|
|
|
for (int k = 0; k < num_points; ++k)
|
|
{
|
|
double x = record.read_double();
|
|
double y = record.read_double();
|
|
points.emplace_back(x,y);
|
|
}
|
|
|
|
std::unique_ptr<geometry_type> poly(new geometry_type(mapnik::geometry_type::types::Polygon));
|
|
for (int k = 0; k < num_parts; ++k)
|
|
{
|
|
int start = parts[k];
|
|
int end;
|
|
if (k == num_parts - 1) end = num_points;
|
|
else end = parts[k + 1];
|
|
auto const& pt = points[start];
|
|
double x = std::get<0>(pt);
|
|
double y = std::get<1>(pt);
|
|
if ( k > 0 && is_clockwise(points, start, end))
|
|
{
|
|
geom.push_back(poly.release());
|
|
poly.reset(new geometry_type(mapnik::geometry_type::types::Polygon));
|
|
}
|
|
poly->move_to(x, y);
|
|
for (int j = start + 1; j < end; ++j)
|
|
{
|
|
auto const& pt = points[j];
|
|
x = std::get<0>(pt);
|
|
y = std::get<1>(pt);
|
|
poly->line_to(x, y);
|
|
}
|
|
poly->close_path();
|
|
}
|
|
geom.push_back(poly.release());
|
|
}
|