Neuro-convex-hull computation from a set of circles

Neural, Parallel and Scientific Computations

Volumn 13, Issue 3-4, 2005, Pages 455-468

  Pal, Srimanta ^a   Bhattacharya, Sabyasachi ^b  

^a INDIAN STATISTICAL INSTITUTE   (India)

^b INSTITUTE OF ENGINEERING AND MANAGEMENT   (India)

Author keywords

Convex hull; Multi layer network; Neural networks

Indexed keywords

EID: 31344458698     PISSN: 10615369     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (33)

1. P. K. Agarwal, "Applications of parametric searching in geometric optimization" J. Algorithms, vol. 17, pp. 292-318, 1994.
2. S. G. Akl and G.T. Toussaint, "A fast convex hull algorithm", Inform. Processing Lett., vol. 7, pp. 219-222, 1978.
3. S.C. Akl and K.A. Lyons, Parallel Computational Geometry, Englewood Cliffs, NJ: Prentice-Hall, 1993.
4. L.J. Bently, G.M. Faust and F.P. Preparata, "Approximation algorithm for convex hulls", Comm. ACM., pp. 64-68, 1982.
5. J.L. Bentley, K. L. Clarkson, and D.B. Levine, "Fast linear expected time algorithm for computing maxima and convex hulls", Algorithmica, vol. 9, pp. 168-183 1993.
6. M. W. Bern, H.L. Karloff, and B. Schieber, "Fast geometric approximation techniques and geometric embedding problems", Theoretical Comput. Sci., vol. 106, pp. 265-281, 1992.
7. M. Berg, M. Kreveld, M. Overmars and O. Schwarzkopf, Computational geometry algorithms and applications. Springer-Verlag, 1997.
8. V. Capoyleas, G. Rote and G. Woeginger, "Geometric clustering", J. Algorithms, vol. 12, pp. 341-356, 1991.
9. G. A. Carpenter and S. Grossberg, "ART2: Self-organization of stable category recognition codes for analog input pattern", In Proc. IEEE Int. Conf. Neural Networks, San Diego, CA, II, pp. 727-736, 1987.
10. D.R. Chank and S.S. Kapur, "An algorithm for convex polytopes", J. ACM, Vol. 17, pp. 78-86, 1970.
11. A. Datta and S.K. Parui, "A dynamic neural net to compute convex-hull", Neurocomputing, vol. 10, pp.375-384, 1996.
12. A. Datta, S. Pal and N.R. Pal, "A connectionist model for convex-hull of a Planar set". Neural Networks, vol. 13, pp.377-384, 2000.
13. P.A. Devijver and J. Kittler, Pattern Recognition: A Statistical-Approach. NJ: Prentice-Hall, Hall, 1982.
14. O. Devillers and M. Golin, "Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas." Information Processing Letters, Vol, 56, pp.157-164, 1995.
15. R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis. New York: Wiley, 1973.
16. R.A. Earnshaw, "Theoretical foundations of computer graphics and CAD", NATO ASI., vol. F40, Berlin: Springer-Verlag, 1988.
17. W.F. Eddy, "A new convex hull algorithm for planar sets", ACM Trans. Math. Software, vol. 3, pp. 398-403, 1977.
18. H. Edelsbrunner, D.C. Kirkpatrick, and R. Seidel, "On the shape of a set of points in the plane", IEEE Rans. Infor. Theory, vol. 29, pp. 551-559, 1983.
19. R.L. Graham, "An efficient algorithm for determining the convex hull of a finite planar set", Inform. Processing Lett., vol. 1, pp. 132-133, 1972.
20. L. Guibas, D. Salesin, and J. Stolfi, "Constructing Strongly convex approximate hulls with inaccurate primitives", Algorithmica, vol. 9, pp. 534-560, 1993.
21. Y.K. Hwang and N. Ahuia, "Times motion planning-A survey", A CM Comput. Survey, vol. 24, pp. 219-291, 1993.
22. R.A. Jarvis, "On the identification of the convex hull of a finite set of points in the plane", Inform. Processing Lett., vol. 2, pp. 18-21, 1973.
23. Y. Leung, J. S. Zhang and Z. B. Xu, "Neural networks for convex hull computation", IEEE Trans. Neural Networks, vol. 8, pp. 601-611, 1997.
24. R.P. Lippmann, "An introduction to computing with neural nets", IEEE ASSP Magazine, pp.4-22, 1987.
25. S. Pal, A. Datta and N. R. Pal, "A multi-layer self-organizing model for convex-hull computation", IEEE Trans. Neural Network, vol. 12, pp. 1341-1347, 2001.2." A Multilayer
26. S. Pal, N. R. Pal and A. Datta, "Dynamic Neural Network for Convex-Hull Computation" Neural, Parallel & Scientific Computations, vol. 12, pp. 505-524, 2004.
27. F.P. Preparata and S.J. Hong, "Convex hulls of finite sets of points in two and three dimensions," Comm. ACM., vol. 20, pp. 87-93, 1977.
28. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction. New York: Springer-Verlag, 1985.
29. D. Rappaport, A convex-hull algorithm for discs, and applications, Comput. Geom. Theory Appl., 1 (1992) 171-181.
30. D.E. Rumelhart and J.L. McClelland, (Eds.), Parallel Distributed Processing. Cambridge: MIT Press, vol. 1, 1986.
31. J.T. Schwartz and C.K. Yap, (Eds.), Advances in in Robotics I: Algorithmic and Geometric Aspects of Robotics. Hillsdale, NJ: Lawrence Erlbaum, 1987.
32. G.T. Toussaint, (Ed.), Computational Geometry. New York: North-Holland, 1985.
33. E. Wennmyr, "A convex hull algorithm for neural networks," IEEE Trans. Circuits Syst., vol. 36, pp. 1478-1484, 1989.