Problem Idea Equidecomposable Polygons
source link: https://www.codeabbey.com/index/forum_topic/dbc57ecf458d6a9be10be3a69ec08251
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Problem Idea Equidecomposable Polygons
Back to General discussions forum
Vadim, Hi - and thanks for another much curious topic :)
This reminds of classical cutting puzzles like those by Loyd and Dudeney. Though these fellows generally requested minimize number of parts.
I googled a bit to find out explanations (heard of theorem but never knew details).
Honestly, this sounds like a real "coffin" to program :))) Even cutting polygons already requires good deal of coding with memory objects (but this hints about possible intermediate problems).
I probably shall at least try to code this, though perhaps not immediately (much frightened!) - so if you feel in the great mood to provide generator/checker code for such task yourself - just tell :)
Honestly, this sounds like a real "coffin" to program
Without having started writing any code for it (but already knowing a solution that would work) it does seem to me like this would be cumbersome in terms of representing the sequence of actions and verifying a solution. Perhaps the solution verification can be simplified if we restrict vertices of polygons (including intermediate polygons) to integer coordinates.
Actually, maybe that would be too easy.
Actually no, that should be perfectly fine. If we use doubles for coordinates, then those are just rational values, and multiplying by an appropriate power of 2 would make them integers. We can use large integer coordinates.
so if you feel in the great mood to provide generator/checker code for such task yourself - just tell
Speaking of this, I actually have another problem which I wanted to suggest adding, which I already have a solution for but wanted to save it until I had generator/checker ready. How should the generator/checker be formed? As in, what format or style should it follow or what languages am I allowed to use?
Recommend
-
141
webGl2 - Path tracing a lot of polygons - fast. please wait .. loading .. Left click to rotate - Right Click to zoom .. ... loading ... WebGL2 - Path tracing.
-
112
Collisions Collisions is a JavaScript library for quickly and accurately detecting collisions between Polygons, Circles, and Points. It combines the efficiency of a
-
41
Privacy & Cookies: This site uses cookies. By continuing to use this website, you agree to their use. To find out more, including how to control cookies, see here: C...
-
22
FABIEN SANGLARD'S WEBSITE
-
23
FABIEN SANGLARD'S WEBSITE
-
22
#30DayMapChallenge: Day 3 – Polygons OR Lego® style brick raster in QGIS using Geometry Generator expressions
-
11
Today at E3: Politics, polygons and palm treesToday at E3: Politics, polygons and palm treesAfter a cancelled year, E3 returns for 2021 with a digital-only showcas...
-
5
OpenGL (ES) & mdash; Polygons temporarily disappear when new objects are added to ArrayList advertisements In an OpenGL ES 1.x Android app...
-
7
Number of polygons in a 3D object and the rendering workload? advertisements Is there any relation (preferably an equation)...
-
16
How to draw polygons on an HTML5 canvas? advertisements I need to know how to draw polygons on a canvas. Withou...
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK