v1.6.1

DelaunayTriangulation v1.6.1

Diff since v1.6.0

Merged pull requests:

• Fix refimages (#204) (@DanielVandH)
• 1.11 (#205) (@DanielVandH)
• Fix issue with clipped Voronoi tessellation for a single right-angled triangle (#207) (@DanielVandH)

Closed issues:

• Make liang_barsky public (#202)

v1.6.0

DelaunayTriangulation v1.6.0

Diff since v1.5.1

• Define reverse for AbstractParametricCurves, making it easier to reverse the orientation of a curve. See #195.
• Fixed an issue with LineSegment not returning the exact endpoints at t=1, which can be problematic when joining boundary nodes. This has been fixed. See #195.
• Introduced is_linear to fix issues with boundary enrichment of domains with LineSegments. In particular, LineSegments are no longer enriched. See #195.
• orientation_markers now uses uniquetol instead of unique for the final set of markers (it already did it for the intermediate markers). See #195.
• For large Tuples, functions like eval_fnc_at_het_tuple_two_elements are problematic and allocate more than their non-type-stable counterparts. To get around this, for Tuples of length N > 32, the non-type-stable version is used. See #195.
• Fixed issue with use_barriers when a ghost edge is selected at random during point location. See #196.
• Introduced the (currently internal) function get_positive_curve_indices for finding curves with positive orientation in a Triangulation. See #196.
• is_exterior_curve, is_interior_curve, num_exterior_curves, and is_disjoint are now defined based on get_positive_curve_indices rather than get_exterior_curve_indices. See #196.
• PrecompileTools.jl is now used. See #200.
• Introduced the (currently internal) function get_positive_curve_indices for finding curves with positive orientation in a Triangulation. #196.
• PointLocationHistory was not marked as public. This has been fixed. See #198.
• Fixed an issue with missing docstrings and duplicate docstrings in the documentation. See #198.
• copy and deepcopy are now correctly implemented for PolygonTrees and PolygonHierarchys. See #199
• Implemented copy and deepcopy for Triangulation and VoronoiTessellation. See #201.
• Fixed a bug with Triangulations polygon_hierarchy not being correctly aliased with the polygon_hierarchy from the BoundaryEnricher, and similarly for the boundary_edge_map. See #201.
• Implemented == for VoronoiTessellation. See #201.

Merged pull requests:

• Implement reverse for AbstractParametricCurve and other changes (#195) (@DanielVandH)
• Fix issue with exterior ghost vertices (#196) (@DanielVandH)
• Add Makie tests (#197) (@DanielVandH)
• Fix issue with missing and duplicate docstrings (#198) (@DanielVandH)
• Fix copy and deepcopy for PolygonTrees and PolygonHierarchys (#199) (@DanielVandH)
• Use precompiletools.jl (#200) (@DanielVandH)
• Implement copy/deepcopy for Triangulation/VoronoiTessellation (#201) (@DanielVandH)

Closed issues:

• Delete_point doesn't work on the boundary (#104)
• Added points which are on the boundary are added to the constrained segments (#105)
• Add Makie.jl's reftests of tricontourf/voronoiplot/triplot into tests (#120)
• Re-enable deepcopy on PolygonTrees (#129)
• Use tools like PrecompileTools, JET, and SnoopCompile to improve package quality (#134)
• Implement copy for Triangulation (#142)
• [Documentation]: Not all public functions are listed on the overview (#173)
• [BUG]: find_triangle not finding visible point (#188)
• LineSegment should return the endpoints at t=0/t=1 (#194)

v1.5.1

DelaunayTriangulation v1.5.1

Diff since v1.5.0

Merged pull requests:

• Zenodo -> JOSS (#193) (@DanielVandH)

v1.5.0

DelaunayTriangulation v1.5.0

Diff since v1.4.2

Merged pull requests:

• Added ability to create a Triangulation with only points and triangles as input (#192) (@matgrand)

Closed issues:

• [JOSS]: Editing comments (#190)

v1.4.2

DelaunayTriangulation v1.4.2

Diff since v1.4.1

v1.4.1

DelaunayTriangulation v1.4.1

Diff since v1.4.0

Merged pull requests:

• Software comparison (#191) (@DanielVandH)

Closed issues:

• [JOSS] Review comments (#189)

v1.4.0

DelaunayTriangulation v1.4.0

• Updated to AdaptivePredicates.jl v1.2, now allowing caches to be passed to the predicates involving incircle and orient3. These are only useful when using the AdaptiveKernel() kernel. Outside of triangulating, these caches are not passed by default, but can be provided. The functions get_incircle_cache and get_orient3_cache can be used for this purpose on a triangulation (without a triangulation, refer to AdaptivePredicate.jl's incircleadapt_cache and orient3adapt_cache). See #185.

Diff since v1.3.1

Merged pull requests:

• Upgrade to AdaptivePredicates 1.2 (#185) (@DanielVandH)

v1.3.1

DelaunayTriangulation v1.3.1

Diff since v1.3.0

Merged pull requests:

• Improve the README (#182) (@DanielVandH)
• Fix degenerate weighted triangulation (#184) (@DanielVandH)

Closed issues:

• Performance audit (#111)
• [JOSS] Review comments (#181)
• [BUG]: Degenerate weighted triangulation (#183)

v1.3.0

This release finally introduces weighted triangulations and power diagrams, and also allows for users to provide a generic convex polygon to for clipping a Voronoi tessellation instead of only the convex hull.

• Weighted triangulations have now been implemented, as have power diagrams. The weights are also no longer restricted to Float64 type. See #180.
• intersection_of_edge_and_bisector_ray now accepts a project keyword argument. See #180.
• get_weight(w, i) now returns, when i is not an integer, either i[3] if it represents a point in space or 0. See #180.
• Define project_onto_line(p, q, r) for projecting a point r onto the line defined by p and q. See #180.
• Fixed a bug with clipping Voronoi tessellations in cases where there are no intersections of any Voronoi polygon with the convex hull. See #180.
• voronoi now accepts an optional clip_polygon keyword argument, defaulting to nothing (corresponding to the convex hull), allowing for a convex clip polygon to be used instead of the convex hull. The clip_polygon should be a Tuple of the form (points, boundary_nodes) where the boundary_nodes give vertices of points adhering to the usual convention. Note that this could be used as an alternative to looping over get_polygon_coordinates for clipping to a rectangle. See #180.
• centroidal_smooth now accepts clip_points and clip_vertices as keyword arguments, defaulting to nothing (corresponding to the convex hull), to accommodate the new clip_polygon keyword argument in voronoi. See #180.
• has_multiple_curves, has_multiple_sections, and num_boundary_edges now have methods for Tuples of integers. A bug was also fixed with number_type of a Tuple of Tuples of coordinates returning the Tuple type instead of the coordinate type. See #180.

What's Changed

• Implement weighted Delaunay triangulations and power diagrams by @DanielVandH in #180

Full Changelog: v1.2.0...v1.3.0

v1.2.0

DelaunayTriangulation v1.2.0

Diff since v1.1.4

Merged pull requests:

• Better default set_point! for matrices, and check for dimension of the user's points (#178) (@DanielVandH)

Closed issues:

• [BUG]: centroidal_smooth fails when applied to the triangulation of a sphere, Möbius strip, or Swiss roll. (#177)