|
|||||
 |
|
|
|
|
|
|
|
Applying
iterated mapping to the no-three-in-a-line problem
Cole Brower and Vadim Ponomarenko
Vol. 15 (2022), No. 1, 69–74
|
Abstract |
|
Iterated mapping has seen a lot of success lately in many problems such as bit retrieval, diffraction signal reconstruction, and graph coloring. We add another application of iterated mapping, namely finding solutions to the no-three-in-a-line problem. Given an grid, we utilize iterated mapping to find points such that any straight line (of any slope) drawn will not intersect three of the selected points. |
PDF Access Denied
We have not been able to recognize your IP address
3.129.67.26
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our journal-recommendation form. Or, visit our subscription page for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for USD 30.00:
Keywords
combinatorial search, no-three-in-a-line, global
optimization
|
Mathematical Subject Classification
Primary: 05-04, 11Y16, 52B55
|
Milestones
Received: 15 September 2020
Revised: 14 July 2021
Accepted: 12 August 2021
Published: 14 March 2022
Communicated by Kenneth S. Berenhaut
|
Authors |
| Cole Brower | |
| Department of Mathematics and
Statistics San Diego State University San Diego, CA United States |
|
| Vadim Ponomarenko | |
| Department of Mathematics and
Statistics San Diego State University San Diego, CA United States |
|
