Neurocomputing model for computation of an approximate convex hull of a set of points and spheres

IEEE Transactions on Neural Networks

Volumn 18, Issue 2, 2007, Pages 600-605

  Pal, Srimanta ^a   Bhattacharya, Sabyasachi ^b  

^a INDIAN STATISTICAL INSTITUTE   (India)

^b TATA CONSULTANCY SERVICES   (India)

Author keywords

Convex hull; Energy function; Neural networks

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; POTENTIAL ENERGY FUNCTIONS; SPHERES;

CONVEX HULL; NEUROCOMPUTING MODEL;

NEURAL NETWORKS;

ALGORITHM; ARTIFICIAL INTELLIGENCE; ARTIFICIAL NEURAL NETWORK; AUTOMATED PATTERN RECOGNITION; COMPUTER ASSISTED DIAGNOSIS; COMPUTER SIMULATION; INFORMATION RETRIEVAL; LETTER; METHODOLOGY; THEORETICAL MODEL; THREE DIMENSIONAL IMAGING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; IMAGE INTERPRETATION, COMPUTER-ASSISTED; IMAGING, THREE-DIMENSIONAL; INFORMATION STORAGE AND RETRIEVAL; MODELS, THEORETICAL; NEURAL NETWORKS (COMPUTER); PATTERN RECOGNITION, AUTOMATED;

EID: 34047116981     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNN.2007.891201     Document Type: Article

References (24)

1. S. G. Akl and K. A. Lyons, Parallel Computational Geometry. Englewood Cliffs, NJ: Prentice-Hall, 1993.
2. J. L. Bentley, G. M. Faust, and F. P. Preparata, "Approximation algorithm for convex hulls," Commun. ACM, pp. 64-68, 1982.
3. M. Berg, M. Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry Algorithms and Applications. New York: Springer-Verlag, 1997.
4. V. Bokka, H. Gurla, S. Olariu, and J. L. Schwing, "Constant-time convexity problems on reconfigurable meshes," J. Parallel Distrib. Comput., vol. 27, pp. 86-99, 1995.
5. A. Datta and S. K. Parui, "A dynamic neural net to compute convex-hull," Neurocomput., vol. 10, pp. 375-384, 1996.
6. A. Datta, S. Pal, and N. R. Pal, "A connectionist model for convex-hull of a planar set," Neural Netw., vol. 13, no. 3, pp. 377-384, 2000.
7. O. Devillers and M. Golin, "Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas," Inf. Process. Lett., vol. 56, pp. 157-164, 1995.
8. H. Edelsbrunner, Algorithms in Combinatorial Geometry. New York: Springer-Verlag, 1987.
9. R. L. Graham, "An efficient algorithm for determining the convex hull of a finite planar set," Inf. Process. Lett., vol. 1, pp. 132-133, 1972.
10. J. Jang, M. Nigam, V. K. Prasanna, and S. Sahni, "Constant time algorithms for computational geometry on the reconfigurable mesh," IEEE Trans. Parallel Distrib. Syst., vol. 8, no. 1, pp. 1-12, Jan. 1997.
11. T. Kohonen, Self-Organization and Associative Memory. New York: Springer-Verlag, 1989.
12. Y. Leung, J. S. Zhang, and Z. B. Xu, "Neural networks for convex hull computation," IEEE Trans. Neural Netw., vol. 8, no. 3, pp. 601-611, May 1997.
13. R. P. Lippmann, "An introduction to computing with neural nets," IEEE ASSP Mag., vol. 4, no. 2, pp. 4-22, Apr. 1987.
14. S. Olariu, J. L. Schwing, and J. Zhang, "Time-optimal convex hull algorithms on enhanced meshes," BIT, vol. 33, pp. 396-410, 1993.
15. S. Pal, A. Datta, and N. R. Pal, "A multi-layer self-organizing model for convex-hull computation," IEEE Trans. Neural Netw., vol. 12, no. 6, pp. 1341-1347, Nov. 2001.
16. S. Pal, N. R. Pal, and A. Datta, "A multi-layer dynamic neural network for convex-hull computation," Neural, Parallel Sci. Comput., vol. 12, pp. 505-524, 2004.
17. S. Pal and S. Bhattacharyya, "Neuro-convex-hull computation from a set of circles," Neural, Parallel Sci. Comput., vol. 13, pp. 455-468, 2005.
18. S. Pal, S. Bhattacharyya, and N. R. Pal, "A novel connectionist framework for computation of an approximate convex-hull of a set of planar points, circles and ellipses," Int. J. Neural Syst., vol. 16, pp. 15-28, 2006.
19. F. P. Preparata and S. J. Hong, "Convex hulls of finite sets of points in two and three dimensions," Commun. ACM., vol. 20, pp. 87-93, 1977.
20. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction. New York: Springer-Verlag, 1985.
21. D. Rappaport, "A convex-hull algorithm for discs, and applications," Comput. Geom. Theory Appl., vol. 1, pp. 171-181, 1992.
22. D. E. Rumelhart and J. L. McClelland, Eds., Parallel Distributed Processing. Cambridge, MA: MIT Press, 1986, vol. 1.
23. G. T. Toussaint, Ed., Computational Geometry. Amsterdam, The Netherlands: North-Holland, 1985.
24. E. Wennmyr, "A convex hull algorithm for neural networks," IEEE Trans. Circuits Syst., vol. 36, no. 11, pp. 1478-1484, nov. 1989.