@kirma Is it common for people in bars to have laptops, to begin with? :)

This is making me insane; I upgraded to Mma 10.3 today, and it broke a small piece of my code, so I googled the error, it's about adding Method->"Queued" to a button

so I did, but now clicking the button just does nothing

This is what I'm trying to run:

earlier today (with 10.0) that worked great. Now I need to add Method->"Queued" and it pops the dialog window up. But when I click on either of the buttons, nothing happens. What's causing this?

I have a bunch of polygons that fit neatly together like this:

The white thin lines (you may have to click on the image to see them) indicate the boundaries of the polygons. Is there a way to get the points that make up the boundary of the union of all polygons?

@Pickett This is a bit convoluted. But, I think it might be straightforward:

    bdr = BoundaryDiscretizeRegion@
      RegionUnion@{Polygon[{{0, 0}, {1, 0}, {0, 1}}],
        Polygon[{{1, 0}, {1, 1}, {0, 1}}]}

    MeshPrimitives[bdr, 2]

which gives

{Polygon[{{0., 1.}, {0., 0.}, {1., 0.}, {1., 1.}}]}

@rcollyer Thank you, I like that approach but unfortunately it seems like my polygons are too complicated for it to work.

Here is a notebook with polygons that can be used as a test case: Import["http://goo.gl/NaH6rM"]["http://i.stack.imgur.com/GEnXA.png"]

@Pickett I thought that might be a difficulty. I'll play with it and see what I can make it do.

@Pickett I've never used it before. It's clever, and a bit insane. :)

@Pickett Try this:

With[{g =
    Graph@Flatten@
      Map[UndirectedEdge @@@ Partition[#, 2, 1, 1] &,
       polygons /. Polygon -> List, {2}]},
  Polygon[#[[All, 1]]] & /@
   FindCycle[
    VertexDelete[g,
     v_ /; VertexDegree[g, v] > 2 &&
       Min[VertexDegree[g, #] & /@ AdjacencyList[g, v]] >
        2], \[Infinity], All]] // Graphics

It removes shared border edges by using graphs, and reconstructs polygons.

Although there is nagging of graph functionality having bugs, it's really lots of help on this kind of things.

Of course if there are visual edges which are geometrically the same but constructed differently (basically, different amount of vertices on the same line), this doesn't work out of the box.

Hmm... it doesn't handle holes either. Groan...

@Leonid I started a comment on your answer to the "general strategies to write big code in Mathematica", but it became too big. But I think that my suggestion is of interest to many people, and eventually on topic for a meta topic. Well here it is:

Besides the fact that I would definitely be willing to participate on a a la kickstarter project for an actualisation of your current book, and its extension (second volume) into the topics you have informally added through this site, during the last couple of years, I wonder if you would be interested on giving a course (or two) on some of these topics on the next WTC2016.

I generally take one or two pre-conference courses. This year, some emphasis is (rightfully) given to introduction to the language, but I bet that a course (or two) presented by you would have a full-house. Also, since theses are paid, it would definitely cover for your presence at the conference...

(and would somehow take you into the barebones organization of the book :-)

@kirma Works well on the test case but it runs forever on some other very similar sets of polygons.

That could be FindCycle at work. There's a chance it could be simplified.

@P.Fonseca I agree with this. I've been to the last two WTC and I find detailed attention on how to organise large projects for reuse is not given any attention. Last year I asked for a pre-conference Workbench course (an all day one) whose purpose would be to create a deployable Player Pro CDF from scratch that used encrypted packages (authored in the course) and accessed external data (could use ExampleData or Imort as a proxy for a databasee).

I didn't get a response.

"On March 19, 1916 Albert Einstein submitted his “Foundation of the General Theory of Relativity” for publication in the journal Annelen Der Physik."

(Really noticed it on local tabloid, "today in history" ...)

Annalen Der Physik of course....

Hi everyone, quick question: Let's say I have a set of GeoPositions, a and b. I would like to find a bearing to go from a to b. I know that GeoDestination can take a location and a bearing to provide an "endpoint", but I'd like to go the other way around.

@kirma And of course "Der" is an article an needs to be written in lowercase :)

@halirutan Heh, true. :)

Only two typos in a three-word name... :I

Nevermind, got it figured out

@R.M. Ah, that' my question exactly. Thank you.

@Edmund I would definitely have taken the course you suggested them!!