385 reputation
315
bio website parasiticmeme.com
location Vancouver, WA
age 44
visits member for 3 years, 9 months
seen May 6 at 23:10

I'm a software developer working for a very small company, which sells simulators to cast metal foundries. In my line of work, I maintain code in Fortran, C/C++, C#, Visual Basic (6 and later), with plenty of WinForms and WPF thrown in.


Apr
10
awarded  Notable Question
Feb
25
awarded  Good Question
Feb
3
comment Selecting a point inside a non-convex polygon
That's an approach, but, my polygons are not on a screen; they're computed from a cut-point of a 3-d triangle mesh, out of which the segments are taken and ordered.
Feb
3
comment Selecting a point inside a non-convex polygon
Not quite; my PSLGs are far more complex than triangles, though I could see how an incentre computation could form a part of the full algorithm.
Feb
3
comment Selecting a point inside a non-convex polygon
@PeterTaylor, I feel like I have to be sensitive to computational complexity; some of my PSLGs will have thousands of line segments. Otherwise I'd just proceed with my initial thinking.
Feb
3
comment Selecting a point inside a non-convex polygon
@mjfgates, the Non-Convex polys in this case will always have an inside. I can write the algorithm to catch that edge case and fail gracefully, doing nothing.
Feb
3
comment Selecting a point inside a non-convex polygon
@JayElston, the point on an edge is considered "outside"; otherwise the algorithm would be very easy: return the first point on the first edge. But thank you; it's not a case I'd considered and upon reflection also not a case I need to consider.
Feb
3
comment Selecting a point inside a non-convex polygon
That doesn't at all sound like it would be efficient...
Feb
3
revised Selecting a point inside a non-convex polygon
added 99 characters in body
Feb
3
comment Selecting a point inside a non-convex polygon
I would prefer to favor points which are not close to edges.
Feb
3
asked Selecting a point inside a non-convex polygon
Sep
28
comment Generate complex (non-convex) polyhedron UV mapping
The simulation results are uniform (non-sparse) 3D arrays containing single precision values. There is a neighboring array of short integers which approximates the 3D mesh; a "1" value in that array corresponds to a part of the enclosed region of the polyhedron. I'm mapping to non-convex 3D surfaces more complex than can be mapped with a simple unrolling texture mapper or a spherical ray casting approach. Think of an American gallon milk jug or similar shapes that can be produced in plastic or metal molds.
Sep
23
revised Generate complex (non-convex) polyhedron UV mapping
added some refining detail.
Sep
22
awarded  Cleanup
Sep
22
revised Generate complex (non-convex) polyhedron UV mapping
I disagree; this is not a question in the form of "which book should I read next?". The topic itself still swims around in academia-land; the only source would be a book or article.
Sep
22
revised Generate complex (non-convex) polyhedron UV mapping
rolled back to a previous revision
Sep
22
awarded  Informed
Sep
21
asked Generate complex (non-convex) polyhedron UV mapping
Jun
9
answered Is constantly looking for code examples a sign of a bad developer?
Dec
9
awarded  Yearling