341 reputation
12
bio website insignificancegalore.net
location
age 40
visits member for 2 years, 5 months
seen Jan 27 at 22:15

Jan
22
comment How to check if a 2D point is in a polygon?
A partitioning of a set S is a collection of disjoint subsets of S whose union is S mathworld.wolfram.com/SetPartition.html. The practical problem with partitioning (part of) the plane into polygons is to specify what happens to points on the edges and vertices: it's a lot of tedious details which are usually unimportant from a mathematical point of view (since the combined edges have 0 area), but still needs to be done right for some numerical algorithms to work.
Jan
21
comment How to check if a 2D point is in a polygon?
@DanielLichtblau: Yes, you are right of course that for a large polygon you want to do something hierarchical along the lines of your answer to get decent scaling. One reason I keep coming back to this implementation is the partitioning guarantee which is critical in much of what I do.
Jan
20
answered How to check if a 2D point is in a polygon?
May
24
awarded  Yearling
May
24
awarded  Nice Answer
May
24
awarded  Teacher
Mar
23
answered How to change the default ColorData used in Mathematica's Plot?