Implementing algorithms on polygons
I have some algorithms on polygons I would like to implement. When implemented I will release my implementations as Squeak or Pharo packages under an MIT licence. What does Pharo have to offer in terms of a GUI for this? It would also be helpful if the package already had an implementation of an algorithm for triangulating polygons. An implementation of an algorithms for constructing Voronoi diagrams of a point set would also be useful. Any advice appreciated. Note: earlier I made a similar post on one of the Squeak mailing lists. Are there anyone who might be interested in my algorithms? I won't go into details here but I am likely to implement my own triangulation algorithm among others and it would be nice if this implementation in particular was used by someone or some package. Ralph Boland
Hi Ralph, I guess you should ask your question on pharo-users instead of pharo-dev. Did you have a look to Voronoi diagrams implemented by Natalia ? http://natalia.tymch.uk/RTVoronyjDiagram/ Sent from my iPhone
On 16 juin 2016, at 19:55, Ralph Boland <rpboland@gmail.com> wrote:
I have some algorithms on polygons I would like to implement. When implemented I will release my implementations as Squeak or Pharo packages under an MIT licence.
What does Pharo have to offer in terms of a GUI for this?
It would also be helpful if the package already had an implementation of an algorithm for triangulating polygons.
An implementation of an algorithms for constructing Voronoi diagrams of a point set would also be useful.
Any advice appreciated.
Note: earlier I made a similar post on one of the Squeak mailing lists.
Are there anyone who might be interested in my algorithms? I won't go into details here but I am likely to implement my own triangulation algorithm among others and it would be nice if this implementation in particular was used by someone or some package.
Ralph Boland
On Thu, Jun 16, 2016 at 08:14:35PM +0100, serge.stinckwich@gmail.com wrote:
Hi Ralph,
I guess you should ask your question on pharo-users instead of pharo-dev.
Did you have a look to Voronoi diagrams implemented by Natalia ? http://natalia.tymch.uk/RTVoronyjDiagram/
The Voronoj diagram also uses Geometry package for doing some computations. Geometry was republished here https://github.com/peteruhnak/geometry and is currently automatically loaded by Roassal (I use it for some computations there). So if you install Roassal you should already see it (or follow the instructions above). I see that there's a Polygon class, but it's quite simple (so most work of the voronoj is in the voronoj repo I guess). It would be great to have a general-purpose library for doing computational geometry. Peter
Sent from my iPhone
On 16 juin 2016, at 19:55, Ralph Boland <rpboland@gmail.com> wrote:
I have some algorithms on polygons I would like to implement. When implemented I will release my implementations as Squeak or Pharo packages under an MIT licence.
What does Pharo have to offer in terms of a GUI for this?
It would also be helpful if the package already had an implementation of an algorithm for triangulating polygons.
An implementation of an algorithms for constructing Voronoi diagrams of a point set would also be useful.
Any advice appreciated.
Note: earlier I made a similar post on one of the Squeak mailing lists.
Are there anyone who might be interested in my algorithms? I won't go into details here but I am likely to implement my own triangulation algorithm among others and it would be nice if this implementation in particular was used by someone or some package.
Ralph Boland
Le jeudi 16 juin 2016, Ralph Boland <rpboland@gmail.com> a écrit :
I have some algorithms on polygons I would like to implement. When implemented I will release my implementations as Squeak or Pharo packages under an MIT licence.
What does Pharo have to offer in terms of a GUI for this?
Depends what you envision as GUI. I'd point you to Athens (2D vector graphics), Bloc (Pharo's next GUI framework), Roassal (visualization DSL)⦠It would also be helpful if the package already had an implementation
of an algorithm for triangulating polygons.
An implementation of an algorithms for constructing Voronoi diagrams of a point set would also be useful.
Check http://natalia.tymch.uk/RTVoronyjDiagram/
Any advice appreciated.
Note: earlier I made a similar post on one of the Squeak mailing lists.
Are there anyone who might be interested in my algorithms? I won't go into details here but I am likely to implement my own triangulation algorithm among others and it would be nice if this implementation in particular was used by someone or some package.
Computational geometry is something I would explore for fun, but I don't have a professional use-case for it :) -- Damien Pollet type less, do more [ | ] http://people.untyped.org/damien.pollet
participants (4)
-
Damien Pollet -
Peter Uhnak -
Ralph Boland -
serge.stinckwich＠gmail.com