Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 4 years ago.
Improve this question
How would I implement Delaunay triangulation in three dimensions and aside from that, would this be efficient for plotting graphs in spherical coordinates? (If not, do you know of a more efficient method? Thanks.)
Also, are there any disadvantages for 3D surface mesh generation with Delaunay triangulation(s)?
Thank-you in advance.
You could try Bowyer-Watson algorithm but with tetrahedrons or you could try to lift the points to a paraboloid:https://math.stackexchange.com/questions/200536/3d-delaunay-triangulation-by-4d-paraboloids.
You could use the libdts2 for a spherical delaunay triangulation.
See https://stackoverflow.com/a/45240506/4994003
Related
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 3 years ago.
Improve this question
This question does not have code examples, I'm looking for an approach on how to do this.
Imagine a neural network trying to learn a game, it has 4 possible outputs (moves it can do).
In case the other player wins or gains an advantage after a (bad) move from the neural network you might want do backpropagation to teach it NOT to make this move. So you'd want to input the data [?, 0, ?, ?] to the cost function.
... but because any other move might be OK or might not be I don't have values to input for the other moves.
[1, 0, 1, 1] is not what I want.
How could you do the backpropagation on just 1 output? Does DeepLearning4J cater for this situation?
Thanks for any help!
R.
What you are looking for is called reinforcement learning. DL4J offers a solution for that with RL4J, but it isn't as well documented as it should be and supports only a few algorithms.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 2 years ago.
Improve this question
For my PhD thesis I need the altitudes of a driven route from the surface of the road.
Is this possible with the HERE REST API?
Thanks in advance,
Andreas
Not exactly sure if the Platform Data Extension API might be useful for the use case. It has many layers and attributes, and the layer ROAD_GEOM_FCn has an attribute Z Level which is similar to what you are looking for
Documentation
https://developer.here.com/platform-extensions/documentation/platform-data/topics/overview.html
http://tcs.ext.here.com/pde/layer?region=WEU&release=2015Q4&url_root=pde.cit.api.here.com&layer=ROAD_GEOM_FC1
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 7 years ago.
Improve this question
I have a photograph which contains a color calibration palette.
For each color-patch-square I want to obtain the pixel coordinate of the top-left square. Unfortunately, there is a perspective distortion in the photographs, so the grid is not perfect.
I have already tried Harris corner detector, and hough transformation to get the grid lines and then compute their intersections, however both results we're very unrobust and error prone.
Any ideas?
Have you tried googling for "Macbeth chart detector"? For example, one of the top results is this dsp exchange answer, which has good links to solutions.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 4 years ago.
Improve this question
Does anyone know of an online resource where I can find stochastic matrices for an nth order Markov chain describing the probability of a note being played based on the previous n notes (for different musical genres, if possible)? I am looking for something similar to the second-order matrix found on this page: http://algorithmiccomposer.com/2010/04/openmusic-markov-chains-and-omlea.html
If not, or otherwise, what would be the best way to construct such a matrix for each genre? The article states that this can be done by hand or by analysing existing pieces of music. How could large amounts of music for each genre be processed to generate these matrices?
I have been doing research on this topic. The matrix you are looking for is highly dependant upon what kind of music you want to generate.
One of the people I work with wrote this paper that is the method used for this. It is based on using viewpoint to look at the music and then basically creating a transition matrix for all these viewpoints: http://www.ehu.es/cs-ikerbasque/conklin/papers/jnmr95.pdf
You can contact me if you need more specific info or collaboration.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 7 years ago.
Improve this question
I am trying to find source code to create violin plots in Matlab. Functionality does not exist in the statistics toolbox nor does a simple Google result in anything useful.
Have a look at DISTRIBUTIONPLOT. I apologize for the name: I called the function like that because I didn't know that they were otherwise known as violin plots at the time.