Computing the shape of a planar points set

Pattern Recognition

Volumn 33, Issue 9, 2000, Pages 1423-1436

  Melkemi, Mahmoud ^a   Djebali, Mourad ^a  

^a UNIVERSITÉ LYON 1   (France)

Author keywords

Computational geometry; Pattern recognition; Shape hull; Voronoi diagram

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; GRAPH THEORY; HEURISTIC METHODS; SET THEORY;

DELAUNAY TRIANGULATION; MATHEMATICAL FORMALISM; PLANAR POINTS SET; SHAPE HULL; VORONOI DIAGRAM;

PATTERN RECOGNITION;

EID: 0033686376     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(99)00124-7     Document Type: Article

References (18)

1. R.A. Jarvis, Computing the shape hull of points in the plane, in: Proceedings of the IEEE Computing Society Conference on Pattern Recognition and Image Processing, New York, 1977, pp. 231-241.
2. Ahuja N., Tuceryan M. Extraction of early perceptual structure in dot patterns. integrating region boundary and component gestalt Comput. Vision Graphics Image Process. 48:1989;304-356.
3. Urquhart R. Graph theoretical clustering based on limited neighborhood sets. Pattern Recognition. 15(3):1992;173-187.
4. Zahn C.T. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans. Comput. C-20:1971;68-86.
5. Cheriton D., Tarjan R.E. Finding minimum spanning trees. SIAM J. Comput. 5(4):1976;724-742.
6. Matula D.W., Sokal R.R. Properties of Gabriel graphs relevant to geographic variation research and the clustering of points in the plane. Geograph. Anal. 12(3):1980;205-222.
7. Toussaint G.T. The relative neighborhood graph of a finite planar set. Pattern Recognition. 12:1980;261-268.
8. Jaromczyk J.Q., Toussaint G.T. Relative neighborhood graphs and their relatives. Proc. IEEE. 80(9):1992;1502-1517.
9. Kirkpatrick D.G., Radke J.D. A framework for computational morphology. Computational Geometry. 1985;234-244 Elsevier, North-Holland, New York.
10. Edelsbrunner H., Kirkpatrick D.G., Seidel R. On the shape of a set of points in the plane. IEEE Trans. Inform. Theory. 29:1983;551-559.
11. Melkemi M. A-shape of a finite point set. Proc. ACM Comput. Geom., Nice. 1997;367-369.
12. Melkemi M., Melkemi L. An algorithm for detecting dot patterns. Earnshaw R.A., Vince J.A. Computer Graphics. 1995;161-169 Academic Press, Leeds, U.K.
13. J.D. Boissonnat, M. Yvinec, Géométrie algorithmique, Edisci. Int., 1995.
14. Aurenhammer F. Power diagrams: properties, algorithms and applications. SIAM J. Comput. 16:1987;78-96.
15. Imai H., Iri M., Murota K. Voronoi diagrams in the Laguerre geometry and its applications. SIAM J. Comput. 14:1985;93-105.
16. Boissonnat J.D. Geometric Structures for three-dimensional shape representation. ACM Trans. Comput. Graphics. 4:1984;266-286.
17. Edelsbrunner H., Müke E.P. Three-Dimensional Alpha Shapes. ACM Trans. Comput. Graphics. 13(1):1994;43-70.
18. Attali D. r-regular shape reconstruction from unorganized points. ACM Comput. Geom., Nice. 1997;248-253.