Skip to content
Publish & Distribute
Publishing Solutions
Distribution Solutions
Library Services
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Journal Matcher
Blog
Contact
Search
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Pure Mathematics and Applications
Volume 30 (2022): Issue 1 (June 2022)
Open Access
On the exhaustive generation of discrete figures with connectivity constraints
Hugo Tremblay
Hugo Tremblay
Department of Computer Science and Mathematics, Université du Québecà
Chicoutimi, Canada
Search for this author on
Sciendo
|
Google Scholar
Tremblay, Hugo
and
Julien Vernay
Julien Vernay
Université de Lyon, UJM-Saint-Étienne, Department of Computer Science and Mathematics, Université du Québecà
Chicoutimi,
Search for this author on
Sciendo
|
Google Scholar
Vernay, Julien
Jun 18, 2022
Pure Mathematics and Applications
Volume 30 (2022): Issue 1 (June 2022)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Download Cover
Published Online:
Jun 18, 2022
Page range:
106 - 112
Received:
Mar 31, 2022
Accepted:
May 15, 2022
DOI:
https://doi.org/10.2478/puma-2022-0016
Keywords
algorithm
,
exhaustive generation
,
discrete figure
,
digital geometry
© 2022 Hugo Tremblay et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
