Changelog

1.4

• Improvements:

  1. Adapt remove_flat_vertices to input all geometry types.

1.3

• New features:

  1. New function to calculate the surfacic distance between two polygons surfacic_distance.

  2. New polygon squaring algorithm square_polygon_orthogonal.

  3. New building simplification algorithm simplify_building_morphological.

  4. New polygon treatment algorithm remove_flat_vertices.

  5. New building typification algorithm typify_buildings_burghardt_cecconi.

  6. New line smoothing algorithm smooth_snake.

  7. New line simplification algorithm simplify_wang_muller.

  8. New meta-algorithm generalize_boundaries to apply line generalization algorithm to polygon while keeping topology.

• Improvements:

  1. Fixed square_polygon_naive to prevent vertices deletion.

• Changes:

  1. orientation renamed to polygon_orientation to avoid confusion with the Shapely function.

  2. simplify_building renamed to simplify_building_ruas as new building simplification are added.

  3. simplify_topographic renamed to smooth_topographic as it is more representative of its nature.

  4. Removed boundaries_douglas_peucker, boundaries_visvalingam_whyatt, boundaries_raposo and boundaries_li_openshaw as it is now replaced by generalize_boundaries.

1.2

• New features:

  1. New partitioning method partition_quadtree.

  2. New network collapsing algorithm collapse_junctions.

  3. New line displacement algorithm propagation_network.

  4. New line smoothing algorithm smooth_wma.

  5. New line simplification algorithm simplify_angular.

  6. New line simplification algorithm simplify_topographic.

  7. New area patches generalisation algorithm generalize_area_patches.

1.1

• New features:

  1. New building regularization algorithm regularize_building_fer.

  2. New building typification algorithm typify_buildings_matching.

  3. New line smoothing algorithm smooth_catmull_rom.

  4. New line smoothing algorithm smooth_chaikin.

  5. New line smoothing algorithm smooth_taubin.

  6. New line smoothing algorithm smooth_platre.

  7. New line simplification algorithm simplify_whirlpool.

  8. New line simplification algorithm simplify_lang.

  9. New line simplification algorithm simplify_reumann_witkam.

  10. New line displacement algorithm beams_displacement.

  11. New line displacement algorithm propagation_crow_flies.

  12. New buildings algorithm amalgamate_buildings to merge two buildings.

  13. New line simplification algorithms designed to work on polygon boundaries and keep their topology:

      • boundaries_douglas_peucker

      • boundaries_visvalingam_whyatt

      • boundaries_raposo

      • boundaries_li_openshaw

• Improvements:

  1. Renamed gaussian_smoothing to smooth_gaussian.

  2. Optimization of the coalescence_splitting algorithm along with all its related algorithms using numpy arrays.

  3. Handle MultiLineString input on line simplification algorithms.

  4. Optimize tesselation algorithm, now the spatial index is only calculated once.

  5. Enhanced visvalingam_whyatt using an external code made by Elliot Hallmark.

  6. Update strokes_rivers to facilitate their generalization.

  7. Optimized accordion algorithm.

  8. Optimized schematization algorithm.

  9. Optimized inflexion_points algorithm.

• Bug Fixes:

  1. Fixed the collapse_dual_carriageways algorithm to treat polygons connected by their short side.

  2. Fixed the LeastSquaresMethod, some matrices were wrongly built.

1.0.2

• New features:

  1. Added a new make_planar function that creates a planar network from a provided network and keeps a link between input and output.

  2. Added a new strokes_rivers function that generate strokes on river networks.

• Improvements:

  1. network_faces now returns a list of geometry instead of a GeometrySequence.

  2. Fixed some inconsistencies within the dilate_line function that caused random issues with the precision of the vertexes coordinates. Now, the function never relies on distances, this is much quicker. Furthermore, wrapped line extremities are now accounted for.

  3. The point reduction algorithms now returns the full set of provided points with a boolean attribute to know if it was selected. This, of course, is not the case in aggregation mode. Furthermore, point reduction algorithms have been divided into multiple algorithms in order to be more obvious, easy to use. Read more about that on their respective reference page:

     • kmeans_selection

     • kmeans_simplification

     • kmeans_aggregation

     • labelgrid_selection

     • labelgrid_simplification

     • labelgrid_aggregation

     • quadtree_selection

     • quadtree_simplification

     • quadtree_aggregation

• Bug fixes:

  1. Fixed an issue in li_openshaw. #14 (gowestmen)

  2. Fixed an issue in collapse_branching_crossroads when splitting a line by a point which causes problems of floating points in Shapely.

1.0.1

• New features:

  1. Added new kernel methods for the heatmap function: epanechnikov, gaussian, uniform and triangular. #12 (gowestmen)

• Improvements:

  1. Renamed detect_pastiness to coalescence_splitting to better reflect the usage and litterature.

• Bug fixes:

  1. Fixed an issue in the collapse_branching_crossroads function where linemerge() could input a LineString instead of a MultiLineString.

1.0.0

• New features:

  1. Exposed three new functions used inside the network enrichment functions:

     • is_roundabout

     • is_branching_crossroad

     • is_dual_carriageway

• Improvements:

  1. All undocumented/unwanted functions are now hidden.

  2. Removed all circular import inside the library.

  3. Renamed Constraint to LeastSquaresMethod to better reflect if usage and enhanced its documentation.

1.0rc2

• New features:

  1. Added li_openshaw to simplify lines. (jberli)

  2. Added square_polygon_naive to square polygons. (jberli)

  3. Added heatmap creation. #8 (gowestmen)

  4. New covering algorithms to create convex and concave hull:

     • hull_delaunay (gtouya)

     • hull_swinging_arm #4 (Vpech77)

  5. Added reduce_labelgrid function as a new point reduction method. #3 #6 (Vpech77) #9 (gowestmen)

  6. Added tessellate to create a tesselation of a given shape. This method has been taken from #3 #6 (Vpech77) and wrapped inside a new function.

  7. Added partition_grid to partition objects using the new tessellations.

  8. Added strokes_roads (ACourtial) function to detect strokes inside a road network. This allows an easy strokes calculation by reducing the number of steps.

• Improvements:

  1. Renamed point reduction functions:

     • reduce_points_kmeans to reduce_kmeans.

     • reduce_points_quadtree to reduce_quadtree.

  2. Every point reduction method, namely reduce_kmeans, reduce_quadtree and reduce_labelgrid now takes GeoDataFrame as input and have the same modes available (selection, simplification and aggregation).

  3. gaussian_smoothing can now treat polygons.

  4. AGENT rectangle transformation now depends on the minimum rotated rectangle that shares at least one edge with the original rectangle. This allows the resulting rectangle to be more aligned with the original building.

• Bug fixes:

  1. Fixed the morphological_amalgamation issues function caused by:

     • The __edge_removal function. The function was reworked.

     • The straight_line_intersection method of the Segment class crashed because of the use of the deprecated numpy array method itemset.

     • The Vector2D.from_segment method which was fixed.

  2. Fixed bugs in the network enrichment functions:

     • detect_roundabouts

     • detect_branching_crossroads

     • detect_dead_ends

     • detect_dual_carriageways

     • rural_traffic

     They now return an empty GeoDataFrame if no entity was detected.

  3. Fixed a bug in PointSetQuadTree where negative coordinates could cause problems.

1.0rc1

The first official beta pre-release of CartAGen.