Is it possible to create minimum bounding triangles for groups of points using FME desktop?
Not natively.
A linear-time algorithm is described in https://link.springer.com/article/10.1007/s40314-014-0198-8 and the corresponding c++ implementation is available at https://github.com/ovidiuparvu/minimal-area-triangle
OpenCV also has an implementation of the minimumEnclosingTriangle based on O'Rourke's algorithm.
https://docs.opencv.org/master/d3/dc0/group__imgproc__shape.html#ga1513e72f6bbdfc370563664f71e0542f
Not natively.
A linear-time algorithm is described in https://link.springer.com/article/10.1007/s40314-014-0198-8 and the corresponding c++ implementation is available at https://github.com/ovidiuparvu/minimal-area-triangle
OpenCV also has an implementation of the minimumEnclosingTriangle based on O'Rourke's algorithm.
https://docs.opencv.org/master/d3/dc0/group__imgproc__shape.html#ga1513e72f6bbdfc370563664f71e0542f
Can I easily integrate these implementation into a Transform for use directly in FME?
Can I easily integrate these implementation into a Transform for use directly in FME?
If you know a bit of python and install OpenCV it should be relatively straightforward to extract the geometry of the features and convert them to the point array needed for the MEC algorithm using the pythonCaller.
https://knowledge.safe.com/articles/841/install-python-modules-into-fme.html
Out of curiosity, what is the application of this? Seems like an interesting thing we could eventually support natively.
It could be helpful in aligning wireless field measurement back to their point of origin when propagated by a directional antenna.
Reply
Enter your username or e-mail address. We'll send you an e-mail with instructions to reset your password.