Timeline for maximal convex patching in Computer graphics
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 29, 2016 at 13:09 | vote | accept | Sushovan Mandal | ||
| Apr 4, 2016 at 12:40 | comment | added | trichoplax is on Codidact now | I understand that your answer is just an example to get things started. I was just giving some feedback in the hope that it will trigger an idea for improvement from someone. | |
| Apr 3, 2016 at 11:30 | comment | added | trichoplax is on Codidact now | A possible problem with this approach is that for some surfaces there will exist a path between two adjacent triangles that is made up only of convex steps, even though the two adjacent triangles touch along a concave edge. In sufficiently smooth examples this may not be a problem as the inaccuracy will only tend to be one triangle wide, but it is possible to construct examples with arbitrarily large concavities that are accessible by purely convex paths. For example, imagine the shape made by pushing a pin into a balloon so that the surface dips inwards (assuming it doesn't burst). | |
| Apr 1, 2016 at 9:31 | history | edited | Sushovan Mandal | CC BY-SA 3.0 |
correct answer logic
|
| Mar 30, 2016 at 6:49 | vote | accept | Sushovan Mandal | ||
| Apr 4, 2016 at 13:42 | |||||
| Mar 30, 2016 at 6:49 | history | edited | Sushovan Mandal | CC BY-SA 3.0 |
include further points in the answer
|
| Mar 20, 2016 at 20:30 | comment | added | Dragonseel | Yea. I just wanted to emphazise that in order to find the biggest convex patch, you have to keep sampling until you tested everything, since after the first one there might be a even bigger one disconnected that you haven't found jet. | |
| Mar 20, 2016 at 16:41 | comment | added | Sushovan Mandal | @dragonseel well for practical purposes I think single triangle patches should be ruled out, as for us to determine convexity, it has to span across several triangles. well we do get all patches, but when a convex patch continues further, it's size keeps on increasing by including the neighbouring triangles that satisfy convexity, until the patch reaches the maximum size it can attain. | |
| Mar 20, 2016 at 13:13 | comment | added | Dragonseel | If a patch ends, and not all triangles have been visited/tested, you have to start anew with another random triangle that is not part of a patch yet. So you find all convex patches and not just the one you happen to begin with. Then chose the biggest one. (Note: Patches can be just a single triangle) | |
| Mar 20, 2016 at 4:02 | history | edited | Sushovan Mandal | CC BY-SA 3.0 |
remove unnecessary stub
|
| Mar 20, 2016 at 3:54 | history | answered | Sushovan Mandal | CC BY-SA 3.0 |