Recently, I devised a new convex hull algorithm. Is there any forum where I can submit my work?

$\begingroup$ I'm just curious: when you say "forum", are you asking about which computational geometry journals or conferences to submit to? Are you looking to reach an academic or industrial audience? $\endgroup$ – Gilead Mar 24 '11 at 2:32

$\begingroup$ Actually both. I am looking for any platform where my algorithm could be submitted as a paper for consideration as a new advancement or discovery. It could be a mathematical congress, a committee or journal. I don't know where to begin. $\endgroup$ – Alok Gandhi Mar 24 '11 at 3:08
Computational geometry has several journals (Discrete and Computational Geometry, Computational Geometry: Theory and Applications, International Journal of Computational Geometry and Applications, and Journal of Computational Geometry) and conferences (ACM Symposium on Computational Geometry, European Workshop on Computational Geometry, Fall Workshop on Computational Geometry, Canadian Conference on Computational Geometry), and its own section (cs.CG) of the arxiv.org preprint server. There is an even larger number of journals and conferences for algorithms research more generally, many of which are welcoming to computational geometry, and there are other related conferences such as the Symposium on Geometry Processing in the computer graphics sphere of influence.
As with the rest of theoretical computer science, researchers in this area tend to pay much more attention to conferences than to journals, so if you want them to notice your work then sending it to a conference instead of a journal would be a better choice. (If the details of the paper do not fit into the conference page limits, it's usually possible to make an expanded journal version of the same material after the conference, but it's usually not possible to get a paper into a conference if it is already in a journal.) Among the conferences I mentioned above, the Symposium on Computational Geometry is quite difficult to get papers into, the others much less so. The next submission deadline is the one for CCCG, in May (the conference is in August); see http://2011.cccg.ca/ for details. And if you do intend to submit to one of these conferences, be sure to read through examples of papers from previous years to get some idea of what their papers are expected to look like. (Using LaTeX instead of some other word processor is also highly recommended.)
Getting your paper onto arxiv.org requires only that it be ontopic, and doesn't preempt any other kind of publication, but unless you're wellknown in the field, your work is much more likely to be taken seriously if you hold off on putting up a preprint until you get it accepted to a conference first. And even if you are wellknown, waiting until you have some peer review before making a preprint is usually a good idea.
All that said, convex hull algorithms are a rather heavily workedover field, and in many cases the known algorithms match or are very close to matching the worstcase lower bounds for the problem. So for your work to have an impact, you need to demonstrate why it is better than its competitors either through experimental comparisons with stateoftheart implementations on realistic data or through rigorously proven bounds on its time complexity that are a clear improvement on the time bounds of the known algorithms; just being a new algorithm isn't going to be enough.

$\begingroup$ @David : Thanks for the comprehensive information. It does give me enough idea about what I was looking for. And of course I have to still do rigorous benchmarking and profiling to prove the worth of my work, but thanks for the heads up. $\endgroup$ – Alok Gandhi Mar 24 '11 at 19:26
You could post it, or a link to it, to the Usenet newsgroup sci.math. This will get you some confidencebuilding peer approval, if your work is good (although it is not a substitute for publication in a journal or in conference proceedings), but the real advantage is that if your work is no good you won't have to wait months for a rejection; your work will be torn to shreds with little delay.

1$\begingroup$ I note that an exposition of the algorithm can be found at alokgandhi.net/2011/04/17/convexhullmathscanbefun $\endgroup$ – Gerry Myerson Apr 9 '18 at 23:26