Questions tagged [boost-geometry]

Boost.Geometry is a template C++ library, included in Boost. It contains geometry classes (such as point, linestring, polygon) and functions (such as distance, intersection, union). Boost.Geometry is Concept based and users can use their own models of e.g. point.

Boost.Geometry (aka Generic Geometry Library, GGL), part of collection of the Boost C++ Libraries, defines concepts, primitives and algorithms for solving geometry problems.

Boost.Geometry contains a dimension-agnostic, coordinate-system-agnostic and scalable kernel, based on concepts, meta-functions and tag dispatching. On top of that kernel, algorithms are built: area, length, perimeter, centroid, convex hull, intersection (clipping), within (point in polygon), distance, envelope (bounding box), simplify, transform, and much more. The library supports high precision arithmetic numbers, such as ttmath.

Boost.Geometry contains instantiable geometry classes, but library users can also use their own. Using registration macros or traits classes their geometries can be adapted to fulfill Boost.Geometry concepts.

Boost.Geometry might be used in all domains where geometry plays a role: mapping and GIS, game development, computer graphics and widgets, robotics, astronomy and more. The core is designed to be as generic as possible and support those domains. Currently, the development has been mostly GIS-oriented.

More information on the Documentation.

Download from Boost download page.

Source code is also available at GitHub.

Contact developers at the Boost.Geometry mailing list or Boost-users mailing list.

383 questions
0
votes
1 answer

boost geometry point setter and getter

I'm working with the boost geometry library and i have read in the documentation that i should prefer using boost::geometry::set<0>(point1, 1.0); instead of point1.set<0>(1.0); Same with the get method: bg::get<0>(point1) instead of…
Felix
  • 2,531
  • 14
  • 25
0
votes
1 answer

Intersection_inserter was not declared in this scope

I am trying to calculate the overlap area between two ellipses. I am approximating the ellipses with polygons now and I have found an example that apparently used an old version of Boost.Geometry, as per this answer. From the second answer to this…
Dima1982
  • 189
  • 3
  • 18
0
votes
1 answer

Boost geometry: point on track

I have two points A and B on a sphere (or a WGS84 ellipsoid, if using the geographic extension). These two points define a great circle. I wish to find the coordinates of a point M on that great circle, lying at a certain distance from A (going from…
Deimos
  • 1,835
  • 1
  • 16
  • 15
0
votes
1 answer

Boost geometry intersection_inserter does not work

I am using boost geometry library C++. The code works well in the old version of Eclipse (which is installed from pythonxy). Now I install latest version of eclipse and Mingw (x86_64-w64-mingw32). the errors appear at the function…
Jun
  • 419
  • 1
  • 5
  • 14
-1
votes
1 answer

Why is boost multipolygon is rotated upside down?

I have the obtained the WKT string of a boost multipolygon which is constructed by union of boost polygons in a vector called vectorPolygons std::vector vectorPolygons; After adding data in vectorPolygons below code…
Test
  • 564
  • 3
  • 12
-1
votes
1 answer

C++ boost bo data to float array

How transfer data between structures like geometry::point and geometry::box to simple float array? Only way that i have found is get method. For each transfer i am need to use this? #include #include…
SomeCoder
  • 21
  • 4
-1
votes
1 answer

Union of circles in c++

I can't figure out how to merge circles in C++. I accomplished to union two polygons using Boost Geometry, however, the problem is that I don't know how to transform polygons to circles (if that is possible at all in Boost Geometry). No visual…
Andy
  • 81
  • 2
  • 6
-2
votes
2 answers

count the frequency of groups in vector using rtree ( or any other algorithm )

given following set of points in a vector {( 100, 150 ), ( 101, 152 ), ( 102, 151 ), ( 105, 155 ), ( 50, 50 ), ( 51, 55 ), ( 55, 55 ), ( 150, 250 ), ( 190, 260 ) } I need to identify neighboring points and their count. Let us say the acceptable…
Prem
  • 355
  • 2
  • 17
1 2 3
25
26