P-simple points and general-simple deletion rules

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Reductions transform binary pictures only by changing some black points to white ones. Parallel reductions can alter a set of black points simultaneously, while a sequential reduction traverses the black points of a picture, and changes the actually visited single point if the considered deletion rule is satisfied. Two reductions are called equivalent if they produce the same result for each input picture. General-simple deletion rules yield pairs of equivalent topology-preserving parallel and sequential reductions in arbitrary binary pictures. This paper bridges P-simple points and general-simple deletion rules: we show that some deletion rules that delete P-simple points are general-simple, and each point deleted by a general-simple deletion rule is P-simple.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages143-153
Number of pages11
Volume9647
ISBN (Print)9783319323596
DOIs
Publication statusPublished - 2016
Event19th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2016 - Nantes, France
Duration: Apr 18 2016Apr 20 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9647
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other19th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2016
CountryFrance
CityNantes
Period4/18/164/20/16

Fingerprint

Deletion
Binary
Topology
Transform
Arbitrary

Keywords

  • Equivalent reductions
  • General-simple deletion rules
  • P-simple points
  • Topology preservation

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Palágyi, K. (2016). P-simple points and general-simple deletion rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9647, pp. 143-153). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9647). Springer Verlag. https://doi.org/10.1007/978-3-319-32360-2_11

P-simple points and general-simple deletion rules. / Palágyi, K.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9647 Springer Verlag, 2016. p. 143-153 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9647).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Palágyi, K 2016, P-simple points and general-simple deletion rules. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 9647, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9647, Springer Verlag, pp. 143-153, 19th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2016, Nantes, France, 4/18/16. https://doi.org/10.1007/978-3-319-32360-2_11
Palágyi K. P-simple points and general-simple deletion rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9647. Springer Verlag. 2016. p. 143-153. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-32360-2_11
Palágyi, K. / P-simple points and general-simple deletion rules. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9647 Springer Verlag, 2016. pp. 143-153 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a67d4e1dce6b47f29cae200fb2e1cc44,
title = "P-simple points and general-simple deletion rules",
abstract = "Reductions transform binary pictures only by changing some black points to white ones. Parallel reductions can alter a set of black points simultaneously, while a sequential reduction traverses the black points of a picture, and changes the actually visited single point if the considered deletion rule is satisfied. Two reductions are called equivalent if they produce the same result for each input picture. General-simple deletion rules yield pairs of equivalent topology-preserving parallel and sequential reductions in arbitrary binary pictures. This paper bridges P-simple points and general-simple deletion rules: we show that some deletion rules that delete P-simple points are general-simple, and each point deleted by a general-simple deletion rule is P-simple.",
keywords = "Equivalent reductions, General-simple deletion rules, P-simple points, Topology preservation",
author = "K. Pal{\'a}gyi",
year = "2016",
doi = "10.1007/978-3-319-32360-2_11",
language = "English",
isbn = "9783319323596",
volume = "9647",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "143--153",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - P-simple points and general-simple deletion rules

AU - Palágyi, K.

PY - 2016

Y1 - 2016

N2 - Reductions transform binary pictures only by changing some black points to white ones. Parallel reductions can alter a set of black points simultaneously, while a sequential reduction traverses the black points of a picture, and changes the actually visited single point if the considered deletion rule is satisfied. Two reductions are called equivalent if they produce the same result for each input picture. General-simple deletion rules yield pairs of equivalent topology-preserving parallel and sequential reductions in arbitrary binary pictures. This paper bridges P-simple points and general-simple deletion rules: we show that some deletion rules that delete P-simple points are general-simple, and each point deleted by a general-simple deletion rule is P-simple.

AB - Reductions transform binary pictures only by changing some black points to white ones. Parallel reductions can alter a set of black points simultaneously, while a sequential reduction traverses the black points of a picture, and changes the actually visited single point if the considered deletion rule is satisfied. Two reductions are called equivalent if they produce the same result for each input picture. General-simple deletion rules yield pairs of equivalent topology-preserving parallel and sequential reductions in arbitrary binary pictures. This paper bridges P-simple points and general-simple deletion rules: we show that some deletion rules that delete P-simple points are general-simple, and each point deleted by a general-simple deletion rule is P-simple.

KW - Equivalent reductions

KW - General-simple deletion rules

KW - P-simple points

KW - Topology preservation

UR - http://www.scopus.com/inward/record.url?scp=84964063330&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84964063330&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-32360-2_11

DO - 10.1007/978-3-319-32360-2_11

M3 - Conference contribution

SN - 9783319323596

VL - 9647

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 143

EP - 153

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -