A connectionist model for convexhull of a planar set

 DATTA A.
 Computer and Statistical Service Centre, Electronics and Communication Sciences Unit, Indian Statistical Institute

 PAL S.
 Computer and Statistical Service Centre, Electronics and Communication Sciences Unit, Indian Statistical Institute

 PAL N. R.
 Computer and Statistical Service Centre, Electronics and Communication Sciences Unit, Indian Statistical Institute
Search this Article
Author(s)

 DATTA A.
 Computer and Statistical Service Centre, Electronics and Communication Sciences Unit, Indian Statistical Institute

 PAL S.
 Computer and Statistical Service Centre, Electronics and Communication Sciences Unit, Indian Statistical Institute

 PAL N. R.
 Computer and Statistical Service Centre, Electronics and Communication Sciences Unit, Indian Statistical Institute
Journal

 Neural Networks

Neural Networks 13(3), 377384, 20000401
References: 32

1
 ART2: selforganization of stable category recognition codes for analog input pattern

CARPENTER G. A.
Proceedings of the IEEE International Conference on Neural Networks II, 727736, 1987
Cited by (1)

2
 <no title>

DEVIJVER P. A.
Pattern Recognition: A Statistical Approach, 1982
Cited by (9)

3
 <no title>

DUDA R.O.
Pattern classification and scene analysis, 1973
Cited by (150)

4
 <no title>

EARNSHAW R. A.
Theoretical foundations of computer graphics and CAD NATO ASI, F40, 1988
Cited by (1)

5
 <no title>

FRITZKE B.
Let it growselforganizing feature maps with problem dependent cell structure, Artificial neural networks 1, 403408, 1991
Cited by (1)

6
 <no title>

KOHONEN T.
Selforganization and Associative Memory, 1989
Cited by (77)

7
 An introduction to computing with neural nets

LIPPMANN R. P.
IEEE ASSP Magazine, 1987
Cited by (1)

8
 <no title>

MEHROTRA K.
Elements of Artificial Neural Networks, 1997
Cited by (2)

9
 <no title>

PREPARATA F. P.
Computational Geometry : An Introduction, 1985
Cited by (38)

10
 <no title>

RUMELHART D. E.
Parallel Distributed Processing 1, Chapter 8, 1986
Cited by (80)

11
 <no title>

SCHWARTZ J. T.
Advances in robotics I: algorithmic and geometric aspects of robotics., 1987
Cited by (1)

12
 <no title>

SERRANOGOTARREDONA T.
Adaptive resonance theory microchipscircuit design techniques., 1998
Cited by (1)

13
 <no title>

TOUSSAINT G. T.
Computational geometry, 1985
Cited by (1)

14
 Applications of parametric searching in geometric optimization

AGARWAL P. K.
Journal of Algorithms 17, 292318, 1994
DOI Cited by (1)

15
 A Fast Convex Hull Algorithm

AKL S. G.
Information Processing Letters 7(5), 219222, 1978
Cited by (2)

16
 A novel routing scheme on the star and pancake interconnection networks and its applications

AKL S. G.
Parallel Computing 19(1), 95101, 1993
Cited by (12)

17
 Approximation Algorithms for Convex Hulls

BENTLY J. L.
Communications of the ACM 25(1), 6468, 1982
Cited by (3)

18
 Fast linear expected time algorithm for computing maxima and convex hulls

BENTLEY J. L.
Algorithmica 9, 168183, 1993
Cited by (1)

19
 Fast geometric approximation techniques and geometric embedding problems

BERN M. W.
Theoretical Computer Science 106, 265281, 1992
DOI Cited by (1)

20
 Geometric clustering

CAPOYLEAS V.
J. Algorithms 12, 341356, 1991
DOI Cited by (3)

21
 An Algorithm for Convex Polytopes

CHAND D. R.
Journal of the ACM 17(1), 7886, 1970
DOI Cited by (4)

22
 Selfcreating and organizing neural networks

CHOI D. I.
IEEE Trans. on Neural Networks 5(4), 561575, 1994
Cited by (16)

23
 A new convex hull algorithm for planar sets

EDDY W. F.
Association of Computational Machinery, Transactions of Mathematical Software 3, 398403, 1977
Cited by (1)

24
 On the shape of a set of points in the plane

EDELSBRUNNER H.
IEEE Transactions of Information Theory 29, 551559, 1983
Cited by (1)

25
 An efficient algorithm for determining the convex hull of a finite planar set

GRAHAM R. L.
Info. Pro. Lett. 1, 132133, 1972
DOI Cited by (5)

26
 Constructing strongly convex approximate hulls with inaccurate primitives

GUIBAS L.
Algorithmica 9, 534560, 1993
Cited by (5)

27
 Gross motion planning  A survey

HWANG Y. K.
ACM Computing Surveys 24(3), 219292, 1992
Cited by (20)

28
 On the identification of the convex hull of a finite set of points in the plane

JARVIS R. A.
Information Processing Letters 2, 1821, 1973
DOI Cited by (1)

29
 Neural networks for convex hull computation

LEUNG Y.
IEEE Transactions on Neural Networks 8, 601611, 1997
Cited by (1)

30
 Convex hulls of finite sets of points in two and three dimensions

PREPARATA F. P.
Communication of ACM 2(20), 8793, 1977
Cited by (5)

31
 Modeling and Classification of Shape using a Kohonen Associative Memory with Selective Multiresolution

SABOURIN M.
Neural Networks 6(2), 275283, 1993
Cited by (3)

32
 A Convex Hull Algorithm for Neural Networks

WENNMYR E.
IEEE Trans. on Circuits and Systems 36(11), 6468, 1989
Cited by (2)
Cited by: 1

1
 Interpretation of a LargeScale Real Data by Static Inverse Optimization [in Japanese]

ZHANG Hong , ISHIKAWA Masumi
IEICE technical report. Neurocomputing 101(238), 8794, 20010720
References (14)