Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Goals for 1.0 #63

Closed
7 tasks
DanielVandH opened this issue Jun 16, 2023 · 1 comment · Fixed by #103
Closed
7 tasks

Goals for 1.0 #63

DanielVandH opened this issue Jun 16, 2023 · 1 comment · Fixed by #103

Comments

@DanielVandH
Copy link
Member

DanielVandH commented Jun 16, 2023

I should get this package to 1.0 when I eventually find some more time. Some goals before doing so:

  • Better default methods for interface methods (Add better default methods for interface methods #62)
  • Provide supporting for clipping Voronoi tessellations on more general geometries (Support for clipped/centroidal Voronoi tessellations on non-convex geometries and multiply-connected/disjoint triangulations #48)
  • I want to eventually support curved segments. I don't think this will be in 1.0, but I should at least double check that the interface I currently use could be easily extended to support a more general definition of a boundary (e.g. I provide a function defining a boundary which I can then sub-sample to get boundary notes until I have "enough", as is required for some curved boundary methods).
  • Spatial sorting is a big need (Spatial sorting for fast insertion #34). I just haven't found a good reference for it.
  • Better support should be provided for cleaning up a user's input if needed, or at least making it possible. There is currently check_args that has to be used e.g. for disjoint domains - I wonder if that can be modified somehow (it's currently like that because I don't know of an efficient way for testing if a domain is in disjoint components). This could be something separate to triangulate, since it is nice to assume that everything is working (if a user provides duplicate points, should I remove them? error? continue? etc. This is hard to think about since it may make the user use e.g. each_point which will include the duplicate points but won't match the vertices in the triangulation). A related issue is Detection of intersecting segments in user input #42. This can probably be done before or after 1.0, but I should think about it first.
  • Of course, it would be nice to resolve Example applications #49 and Cleanup terminology in docs #44, but those can be done anytime. Not a priority right now, though.
  • Simplify the documentation. Currently there's too much of a mix between example, tutorial, and background explanation. Docs are being revamped currently in the new-docs branch https://github.com/DanielVandH/DelaunayTriangulation.jl/tree/new-docs.
@DanielVandH DanielVandH pinned this issue Jun 16, 2023
@DanielVandH
Copy link
Member Author

I wonder if, once curved boundaries are supported, I should remove Gmsh support. I guess it doesn't hurt to keep it, but my implementation (1) only exists because I didn't have CDT/refinement support at the time and (2) is quite limited compare to Gmsh support in other Julia packages.

This was referenced Aug 14, 2023
@DanielVandH DanielVandH linked a pull request Apr 14, 2024 that will close this issue
@DanielVandH DanielVandH unpinned this issue May 11, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging a pull request may close this issue.

1 participant