Note that there are some explanatory texts on larger screens.

plurals
  1. USmcdowella
    primarykey
    data
    text
    plurals
    1. COI think the idea with the dummy point at zero distance from everything else is that the TSP answer will use two links of length zero, one to that dummy point and one from that dummy point. Therefore the cost of the TSP in the modified problem is exactly the cost of your Hamiltonian path, and minimising this produces the cost of the minimum Hamiltonian path, which you can recover by deleting the dummy node and the links to and from it.
      singulars
    2. COSince you are keeping track of triangles, I would associate each line with the higher of the two triangles it joins. That means that each V-shaped triangle owns two lines, and each A-shaped trangle owns one line. If you don't mind that there are some holes in the numbering sequence, you could just number each line by shifting its triangle number left by one and then adding 0 or 1 as the low order bit if it is owned by a V-shaped triangle.
      singulars
    3. COI have never done this in practice - just tried to keep up with the literature when it caught my attention. However, a quick websearch turned up a document at http://nlp.stanford.edu/IR-book/html/htmledition/near-duplicates-and-shingling-1.html which looks not too unreadable. As always, remember that you can cut up documents that you don't want to eat for bait - that is, a document that is otherwise useless to you may still provide useful keywords for more web-searching.
      singulars
 

Querying!

 
Guidance

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload