Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKálmán Palágyi
- > Home > Persons > Kálmán Palágyi
Publications
- 2023
[c55]Gábor Karai
, Péter Kardos, Kálmán Palágyi:
Topology-Preserving Reductions on (18, 12) Pictures of the Face-Centered Cubic Grid. ICPRAM 2023: 254-261- 2022
- [c53]Gábor Karai, Péter Kardos, Kálmán Palágyi:
Subfield-based Parallel Kernel-thinning Algorithms on the BCC Grid. ICPRAM 2022: 288-295 - [c52]Kálmán Palágyi, Gábor Karai, Péter Kardos:
Sufficient Conditions for Topology-Preserving Parallel Reductions on the BCC Grid. IWCIA 2022: 71-83 - 2018
- [c46]Péter Kardos, Kálmán Palágyi:
Maximal P-simple Sets on (8, 4) Pictures. CompIMAGE 2018: 23-32 - 2017
- [j18]Péter Kardos, Kálmán Palágyi:
On topology preservation of mixed operators in triangular, square, and hexagonal grids. Discret. Appl. Math. 216: 441-448 (2017) - [c44]Kálmán Palágyi, Péter Kardos:
A Single-Step 2D Thinning Scheme with Deletion of P-Simple Points. CIARP 2017: 475-482 - 2016
- [c42]Péter Kardos, Kálmán Palágyi:
Unified Characterization of P-Simple Points in Triangular, Square, and Hexagonal Grids. CompIMAGE 2016: 79-88 - 2015
- [j17]Péter Kardos, Kálmán Palágyi:
Topology preservation on the triangular grid. Ann. Math. Artif. Intell. 75(1-2): 53-68 (2015) - [c40]Kálmán Palágyi, Gábor Németh, Péter Kardos:
Topology-preserving equivalent parallel and sequential 4-subiteration 2D thinning algorithms. ISPA 2015: 304-309 - [c39]Kálmán Palágyi, Gábor Németh, Péter Kardos:
Equivalent Sequential and Parallel Subiteration-Based Surface-Thinning Algorithms. IWCIA 2015: 31-45 - 2014
- [c37]Gábor Németh, Péter Kardos, Kálmán Palágyi:
2D Thinning Algorithms with Revised Endpixel Preservation. ICIAR (1) 2014: 65-72 - [c34]Péter Kardos, Kálmán Palágyi:
Sufficient Conditions for General 2D Operators to Preserve Topology. IWCIA 2014: 101-112 - 2013
- [j14]Péter Kardos, Kálmán Palágyi:
Topology-preserving hexagonal thinning. Int. J. Comput. Math. 90(8): 1607-1617 (2013) - [c32]Péter Kardos, Kálmán Palágyi:
Parallel thinning on the triangular grid. CogInfoCom 2013: 277-282 - [c31]Péter Kardos, Kálmán Palágyi:
On topology preservation in triangular, square, and hexagonal grids. ISPA 2013: 789-794 - 2012
- [c28]Péter Kardos, Kálmán Palágyi:
On order-independent sequential thinning. CogInfoCom 2012: 149-154 - [c27]Péter Kardos, Kálmán Palágyi:
Hexagonal parallel thinning algorithms based on sufficient conditions for topology preservation. CompIMAGE 2012: 63-68 - [c26]Péter Kardos, Kálmán Palágyi:
On Topology Preservation for Triangular Thinning Algorithms. IWCIA 2012: 128-142 - 2011
- [j13]Gábor Németh, Péter Kardos, Kálmán Palágyi:
2D Parallel Thinning and Shrinking Based on Sufficient Conditions for Topology Preservation. Acta Cybern. 20(1): 125-144 (2011) - [j12]Gábor Németh, Péter Kardos, Kálmán Palágyi:
Thinning combined with iteration-by-iteration smoothing for 3D binary images. Graph. Model. 73(6): 335-345 (2011) - [c23]Gábor Németh, Péter Kardos, Kálmán Palágyi:
A Family of Topology-Preserving 3D Parallel 6-Subiteration Thinning Algorithms. IWCIA 2011: 17-30 - [c22]Péter Kardos, Kálmán Palágyi:
On Topology Preservation for Hexagonal Parallel Thinning Algorithms. IWCIA 2011: 31-42 - 2010
- [c21]Gábor Németh, Péter Kardos, Kálmán Palágyi:
Topology Preserving Parallel Smoothing for 3D Binary Images. CompIMAGE 2010: 287-298 - [c20]Gábor Németh, Péter Kardos, Kálmán Palágyi:
Topology Preserving 3D Thinning Algorithms Using Four and Eight Subfields. ICIAR (1) 2010: 316-325 - 2009
- [c18]Péter Kardos, Gábor Németh, Kálmán Palágyi:
An Order-Independent Sequential Thinning Algorithm. IWCIA 2009: 162-175
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-17 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
