Timeline for Would a "find enclosing room" algorithm question be on-topic here?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 28, 2019 at 13:31 | vote | accept | Mawg | ||
| Jan 24, 2019 at 21:52 | vote | accept | Mawg | ||
| Jan 28, 2019 at 13:31 | |||||
| Jan 24, 2019 at 21:52 | comment | added | Mawg | Ok, that's what I will do. I will also Goolge around for some efficient algorithms. Thnaks | |
| Jan 24, 2019 at 19:43 | comment | added | D.W. Mod | @Mawg, it sounds like you already have the outline of an algorithm in mind, so I'm not sure what more there would be to say. Why don't you try to work out the details of your algorithm, then if there is some step that you don't know how to make efficient, perhaps you could ask about that specific step? | |
| Jan 24, 2019 at 15:29 | comment | added | Mawg |
Thanks for the feedback (+1). "does not appear to have a non-trivial algorithmic component". Given that each room has a label - which I failed to state - and algorithm might be something like for each room_label, find the smallest enclosing closed polygon. Then "for each such polygon, if one line coincides with a line of another polygon, nudge it over by one pixel" (shrink the room on that side; accuracy is not vital). I am definitely only trying to find an (efficient) algorithm. The programming and knowledge of SVG I can handle by myself. Can I make an on-topic question of this?
|
|
| Jan 24, 2019 at 14:47 | history | answered | Discrete lizardMod | CC BY-SA 4.0 |