Timeline for Concise disambiguation of Voronoi boundaries
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 27, 2015 at 10:05 | comment | added | Benoît Kloeckner | These method has the inconvenient of breaking the symmetry of the numbering though; you can decide to break ties by choosing the $i$ such that $x_i$ has least first coordinate, then the least second coordinates. This might be what you meant by lexicographic ordering, but it should be no trouble to define $i(x)$ as above with the current tie breaker. | |
| Mar 27, 2015 at 10:03 | comment | added | Benoît Kloeckner | I don't see the problem with the ordering idea. Either define $V_i$ by induction, adding the assumption that $x\notin V_j$ for all $j<i$ in the definition of $V_i$ ; or define $i(x)$ as the $i$ in $\{1,\dots,n\}$ such that $|| x-x_i ||\le || x-x_j ||$ for all $j$, and let $V_i=\{x : i(x)=i\}$. | |
| Mar 27, 2015 at 7:48 | history | asked | Tom Solberg | CC BY-SA 3.0 |