A novel connectionist framework for computation of an approximate convex-hull of a set of planar points, circles and ellipses

International Journal of Neural Systems

Volumn 16, Issue 1, 2006, Pages 15-28

  Pal, Srimanta ^a   Bhattacharya, Sabyasachi ^b   Pal, Nikhil R ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

^b TATA CONSULTANCY SERVICES   (India)

Author keywords

Convergence; Convex hull; Energy function; Neural networks; Planar closed curves

Indexed keywords

ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; BIOLOGICAL MODEL; COMPARATIVE STUDY; HUMAN; NERVE CELL; NERVE CELL NETWORK; PHYSIOLOGY;

ALGORITHMS; HUMANS; MODELS, NEUROLOGICAL; NERVE NET; NEURAL NETWORKS (COMPUTER); NEURONS;

EID: 33646837371     PISSN: 01290657     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129065706000512     Document Type: Article

References (45)

1. P. K. Agarwal, Applications of parametric searching in geometric optimization, J. Algorithms 17 (1994) 292-318.
2. S. G. Akl and G. T. Toussaint, A fast convex hull algorithm, Inform. Processing Lett. 7 (1978) 219-222.
3. S. G. Akl and K. A. Lyons, Parallel Computational Geometry (Englewood Cliffs, Prentice-Hall, NJ, 1993).
4. T. M. Apostol, Mathematical Analysis, 2nd edn. (Addison-Wesley, 1979).
5. D. Avis and G. T. Tossaint, Simple on-line algorithms for convex polygons, in Computational Geometry, ed. G. T. Tossaint (Elsevier Science Publishers B. V. North Holland) (1985), pp. 23-42.
6. J. L. Bentley, G. M. Faust and F. P. Preparata, Approximation algorithm for convex hulls, Comm. ACM. (1982) 64-68.
7. J. L. Bentley, K. L. Clarkson and D. B. Levine, Fast linear expected time algorithm for computing maxima and convex hulls, Algorithmica 9 (1993) 168-183.
8. M. Berg, M. Kreveld, M. Overmans and O. Schwarzkopf, Computational Geometry Algorithms and Applications (Springer-Verlag, 1997).
9. M. W. Bern, H. L. Karloff and B. Schieber, Fast geometric approximation techniques and geometric embedding problems, Theoretical Comput. Sci. 106 (1992) 265-281.
10. V. Capoyleas, G. Rote and G. Woeginger, Geometric clustering, J. Algorithms 12 (1991) 341-356.
11. 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 (1987) 727-736.
12. D. R. Chank and S. S. Kapur, An algorithm for convex polytopes, J. ACM 17 (1970) 78-86.
13. C. L. Chen, Computing the convex hull of a simple polygon, Pattern Recognition 22(5) (1989) 561-565.
14. A. Datta and S. K. Parui, A dynamic neural net to compute convex-hull, Neurocomputing 10 (1996) 375-384.
15. A. Datta, S. Pal and N. R. Pal, A connectionist model for convex-hull of a planar set, Neural Networks 13(3) (2000) 377-384.
16. O. Devillers and M. Golin, Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas, Information Processing Letters 56 (1995) 157-164.
17. P. A. Devijver and J. Kittler, Pattern Recognition: A Statistical Approach (Prentice-Hall, NJ, 1982).
18. R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis (Wiley, New York, 1973).
19. R. A. Earnshaw, Theoretical foundations of computer graphics and CAD, NATO ASI. F40 (Springer-Verlag, Berlin 1988).
20. W. F. Eddy, A new convex hull algorithm for planar sets, A CM Trans. Math. Software 3 (1977) 398-403.
21. H. Edelsbrunner, D. G. Kirkpatrick and R. Seidel, On the shape of a set of points in the plane, IEEE Trans. Infor. Theory 29 (1983) 551-559.
22. H. Edelsbrunner, Algorithms in Combinatorial Geometry (Springer-Verlag, 1987).
23. M. T. Goodrich, Constructing the Convex Hull of a Partially Sorted Set of Points, Computational Geometry: Theo. & Appl. 2 (1993) 267-278.
24. R. L. Graham, An efficient algorithm for determining the convex hull of a finite planar set, Inform. Processing Lett. 1 (1972) 132-133.
25. L. Guibas, D. Salesin and J. Stolfi, Constructing Strongly convex approximate hulls with inaccurate primitives, Algorithmica 9 (1993) 534-560.
26. Y. K. Hwang and N. Ahuja, Cross motion planning-A survey, ACM Comput. Survey 24 (1993) 219-291.
27. R. A. Jarvis, On the identification of the convex hull of a finite set of points in the plane, Inform. Processing Lett. 2 (1973) 18-21.
28. T. Kohonen, Self-Organization and Associative Memory (Springer-Verlag, 1989).
29. Y. Leung, J. S. Zhang and Z. B. Xu, Neural networks for convex hull computation, IEEE Trans. Neural Networks 8 (1997) 601-611.
30. R. P. Lippmann, An introduction to computing with neural nets, IEEE ASSP Magazine (1987) 4-22.
31. D. McCallum and D. Avis, A linear time algorithm for finding the convex hull of a simple polygon, Information Processing Leters 8 (1979) 201-205.
32. A. A. Melkman, On-line construction of the convex hull of a simple polygon, Information Processing Leters 25 (1987) 11-12.
33. S. Pal, A. Datta and N. R. Pal, A Multi-layer self-organizing model for convex-hull computation, IEEE Tr. Neural Networks 12(6) (2001) 1341-1347.
34. F. P. Preparata and S. J. Hong, Convex hulls of finite sets of points in two and three dimensions, Comm. ACM 20 (1977) 87-93.
35. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction (Springer-Verlag, New York, 1985).
36. D. Rappaport, A convex-hull algorithm for discs, and applications, Comput. Geom. Theory Appl. 1 (1992) 171-181.
37. D. E. Rumelhart and J. L. McClelland (eds.), Parallel Distributed Processing, Vol. 1 (MIT Press, Cambridge, 1986).
38. J. T. Schwartz and C. K. Yap, (eds.), Advances in in Robotics I: Algorithmic and Geometric Aspects of Robotics (Hillsdale, NJ: Lawrence Erlbaum, 1987).
39. T. Scrrano Gotarredona, B. Linares Barranco and A. G. Andreou, Adaptive Resonance Theory Microchips-Circuit Design Techniques (Kluwer Academic Publishers, USA, 1998).
40. S. Y. Shin and T. C. Woo, Finding the convex hull of a simple polygon in linear time, Pattern Recoginition 19(6) (1986) 453-458.
41. J. Sklansky, Finding the convex hull of a simple polygon, Pattern Recoginition Letters 1 (1982) 79-83.
42. G. T. Toussaint, A counter-example to a convex-hull algorithm for polygons, Pattern Recognition 23 (1990) 183-184.
43. G. T. Toussaint (ed.), Computational Geometry (North-Holland, New York, 1985).
44. G. T. Toussaint and H. E. Gindy, A counterexample to an algorithm for computing monotone hulls of simple polygons, Pattern Recognition Letters 1 (1983) 219-222.
45. E. Wennmyr, A convex hull algorithm for neural networks, IEEE Trans. Circuits Syst. 36 (1989) 1478-1484.