There is a marching squares algorithm implemented in [Contour.jl](https://github.com/tlycken/Contour.jl) too; I have put some thoughts on API design in writing in [this issue](https://github.com/tlycken/Contour.jl/issues/29).
Meshing.jl might be a better place for these algorithm anyway (and the name "Contour.jl" is poorly chosen anyway - a plural form would have been better) so the question of moving the existing code into a different repo has already been raised independently). Maybe it's time to combine efforts? :) I also saw discussions somewhere recently about a "marching triangles" algorithm for calculating contour curves on non-gridded data, which should probably live comfortably in the same space too. // T On Sunday, February 21, 2016 at 2:05:44 AM UTC+1, Steve Kelly wrote: > > Do you have a sample dataset? The algorithms for triangulating a signed > distance field can be found in Meshing.jl. I implemented Marching Cubes > recently and started Marching Squares today, but have yet to tag a release > because I need to settle on an API. > > I currently am working on solid modeling via implicit functions. More > generally I work in digital fabrication (Fab Lab) and would love to have 3D > scanning in the Julia workflow. If you can share more about the dataset you > have, I'll see if we can make it work with the tools we have available now. > On Feb 19, 2016 2:36 AM, "Igor" <[email protected] <javascript:>> wrote: > >> Chris , I'm interested in this area too. Please post here if you come up >> with some solution you would like. >> >> Best regards, Igor > >
