[a / b / c / d / e / f / g / gif / h / hr / k / m / o / p / r / s / t / u / v / vg / vm / vmg / vr / vrpg / vst / w / wg] [i / ic] [r9k / s4s / vip / qa] [cm / hm / lgbt / y] [3 / aco / adv / an / bant / biz / cgl / ck / co / diy / fa / fit / gd / hc / his / int / jp / lit / mlp / mu / n / news / out / po / pol / pw / qst / sci / soc / sp / tg / toy / trv / tv / vp / vt / wsg / wsr / x / xs] [Settings] [Search] [Mobile] [Home]
Board
Settings Mobile Home
/sci/ - Science & Math


Thread archived.
You cannot reply anymore.


[Advertise on 4chan]


File: Untitled.png (64 KB, 1234x617)
64 KB
64 KB PNG
to the negro it may concern,
you have a series of simple polygons (Fig A). You want to find lines which evenly fit between the shapes (Fig B, roughly). how on earth do you go about perfectly doing this if all you have is a pencil, protractor, and ruler?
>>
>>16534653
>evenly fit
Define this.
>>
>>16534661
any given point on the line should be equally distant from the closest points on the two shapes closest to that point on the line
Or so i think
>>
>>16534653
>evenly fit
you need to be more precise about what you mean.
i am going to guess you mean "i want to draw the set of points that lie half way along the set of line segments whose endpoints connect any point on one polygon to the closest point of a different polygon."

this is a voronoi diagram where the objects being considered are polygons instead of points.
a quick google search turns up similar questions
https://gis.stackexchange.com/questions/238936/calculating-voronoi-diagrams-for-polygons

putting that aside, i'd come up with an algorithm that considered pairs of line segments on different polys. there are 2 cases: parallel segments and not. in the case where the segments are not parallel, you can extend the segments to the point where they intersect and then draw the line that bisects the angle that is formed using straightedge and compass. for the case of parallel lines, you have to use a slightly different method to draw the line half way between the two parallel lines, but this isn't hard with straight edge and compass either. you can do this for all line segment pairs and keep only the ones that are the shortest. a person would be able to eliminate most pairs by eye, but it wouldn't be hard to do this on a computer.
>>
thank you kind stranger
this problem is in itself a complication of another problem where i came up with the procedure for creating voronoi diagrams... i was planning on using that procedure on each of the polygon's vertices but that turned into a shit show really fast
good to know this method has a name
>>
>>16534653
>>
File: poop.png (218 KB, 1079x1393)
218 KB
218 KB PNG
>>16534829
you get different results if you choose different ways to connect the vertices. for example, P and P' are not the same point.
so in other words this picture is fake and gay
>>
>>16534837
What kind of faggot would connect DM while crossing the shorter CK?
>>
>>16534653
ok, wtf are the people on the picture? can someone enhance that?
>>
File: poop.png (66 KB, 1234x617)
66 KB
66 KB PNG
>>16536307
fuuuuuc
>>
File: 1000010573.jpg (301 KB, 1180x571)
301 KB
301 KB JPG
yo, does anyone know who or where are this people from?

I used this on the picture on this thread, try for urselves if un doubt:

https://29a.ch/photo-forensics/#forensic-magnifier
>>
kinda of a long shot, but it looks to me as a gameshow where the audiance is in the back of the two participants. does it look like any show in particular?
>>
>>16534973
How do you know your CK is shorter?
>>
>>16536347
they look like WNBA players at a game? their shirts have dread team on them
>>
>>16536336
that's chopped no cap



[Advertise on 4chan]

Delete Post: [File Only] Style:
[Disable Mobile View / Use Desktop Site]

[Enable Mobile View / Use Mobile Site]

All trademarks and copyrights on this page are owned by their respective parties. Images uploaded are the responsibility of the Poster. Comments are owned by the Poster.