Timeline for Visibility Graph of Polygon
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 24, 2023 at 0:53 | answer | added | Syed | timeline score: 1 | |
| May 27, 2016 at 12:52 | answer | added | Jason B. | timeline score: 4 | |
| May 26, 2016 at 22:55 | history | tweeted | twitter.com/StackMma/status/735967696395849729 | ||
| May 26, 2016 at 20:29 | vote | accept | Harsha Tirumala | ||
| May 26, 2016 at 20:13 | answer | added | Michael Seifert | timeline score: 8 | |
| May 26, 2016 at 20:10 | comment | added | Harsha Tirumala | @BlacKow i want to verify if the line segments between any two vertices i,j of the polygon lie inside the polygon boundary completely . While there is a function that checks for a specific point lying inside, its input must be constants (looks like). I thought of using the segment formula on the line segment to check ForAll points using that function but it fails. InPolyQ function on this page : [mathematica.stackexchange.com/questions/9405/… | |
| May 26, 2016 at 20:03 | comment | added | Harsha Tirumala | @Öskå for example if you take a convex polygon, any two vertices (which dont share a polygon edge) can "see" each other (because all the points on their line segment lie inside the polygon). So, the visibility graph will be a clique on the vertices of the input polygon. | |
| May 26, 2016 at 19:52 | comment | added | BlacKow | So regarding your second question.. You want to verify if segment intersects with polygon's edges and its vertex is inside, correct? You can start here and here | |
| May 26, 2016 at 19:35 | history | edited | Szabolcs | CC BY-SA 3.0 |
edited tags
|
| May 26, 2016 at 19:35 | comment | added | Öskå | Example? Even a small one as a sketch? | |
| May 26, 2016 at 19:26 | review | First posts | |||
| May 26, 2016 at 20:32 | |||||
| May 26, 2016 at 19:26 | history | asked | Harsha Tirumala | CC BY-SA 3.0 |