| Title:
|
Finite nondense point set analysis (English) |
| Author:
|
Zámožík, Jozef |
| Author:
|
Mišútová, Mária |
| Language:
|
English |
| Journal:
|
Applications of Mathematics |
| ISSN:
|
0862-7940 (print) |
| ISSN:
|
1572-9109 (online) |
| Volume:
|
38 |
| Issue:
|
3 |
| Year:
|
1993 |
| Pages:
|
161-168 |
| Summary lang:
|
English |
| . |
| Category:
|
math |
| . |
| Summary:
|
The paper deals with the decomposition and with the boundarz and hull construction of the so-called nondense point set. This problem and its applications have been frequently studied in computational geometry, raster graphics and, in particular, in the image processing (see e.g. [3], [6], [7], [8], [9], [10]). We solve a problem of the point set decomposition by means of certain relations in graph theory. (English) |
| Keyword:
|
nondense point set |
| Keyword:
|
boundary |
| Keyword:
|
hull |
| Keyword:
|
stabilized matrix |
| Keyword:
|
decomposition |
| MSC:
|
05C12 |
| MSC:
|
68R10 |
| MSC:
|
68U10 |
| idZBL:
|
Zbl 0777.68103 |
| idMR:
|
MR1218023 |
| DOI:
|
10.21136/AM.1993.104544 |
| . |
| Date available:
|
2008-05-20T18:45:24Z |
| Last updated:
|
2020-07-28 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/104544 |
| . |
| Reference:
|
[1] J. Zámožík V. Zaťková: Testing of Convex Polyhedron Visibility by means of graphs.Aplikace matematiky 25 (1980), 81-85. MR 0560324 |
| Reference:
|
[2] M. Mišút M. Mišútová: Reduced Boolean Matrices Multiplication Algorithms.submitted to Appl. of Math.. |
| Reference:
|
[3] V. Medek: On the Boundary of a Finite Set of Points in the Plane.CGIP 15 (1981), 93-99. |
| Reference:
|
[4] J. Bosák: Graphs and Their Applications.Bratislava, Alfa, 1980. (In Slovak.) |
| Reference:
|
[5] J. Zámožík: Reduced Boolean Matrix.Zborník ved. prác StF SVŠT, ES Bratislava, 1980, pp. 9-11. (In Slovak.) |
| Reference:
|
[6] S. G. Akl G. T. Toussaint: Efficient Convex Hull Algorithms for Pattern Recognition Applications.Proc. 4th Int. Joint. Conf. on Pattern Recognition, Kyoto 1978, pp. 1-5. MR 0563485 |
| Reference:
|
[7] R. Miller Q. F. Stout: Mesh Computer Algorithms for Computational Geometry.IEEE 38 (1989), no. 3, 321-340. MR 0983711 |
| Reference:
|
[8] H. Edelsbrunner D. G. Kirkpatrick R. Seidel: On the Shape of Set of Points in the Plane.Forschungszentrum Graz, 1981, pp. 1-27. |
| Reference:
|
[9] T. Pavlidis: The Use of a Syntactic Shape Analyser for Contour Matching.IEEE Trans. Pattern Analysis Machine Intelligence PAMI-I (1979), 307-310. 10.1109/TPAMI.1979.4766928 |
| Reference:
|
[10] G. T. Toussaint: Pattern Recognition and Geometrical Complexity.Proc. 5th Int. Conf. Patt. Rec., Miami Beach, 1980, pp. 1324-1347. MR 0521237 |
| Reference:
|
[11] V. P. Preparata M. I. Shamos: Computational Geometry.Springer-Verlag, Berlin, 1985. MR 0805539, 10.1007/978-1-4612-1098-6 |
| . |
