Timeline for Delaunay triangulation for 3D - a list of connections
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 10, 2019 at 22:09 | comment | added | Henrik Schumacher | You're welcome. | |
| Jan 10, 2019 at 22:01 | comment | added | Kamil17 | It works! Thank you very much for your help! | |
| Jan 10, 2019 at 22:00 | vote | accept | Kamil17 | ||
| Jan 10, 2019 at 21:08 | comment | added | Henrik Schumacher | Ah sorry, my fault. Please see my edit. | |
| Jan 10, 2019 at 21:07 | history | edited | Henrik Schumacher | CC BY-SA 4.0 |
edited body
|
| Jan 10, 2019 at 20:24 | comment | added | Kamil17 |
Thank you for your reply. Connections, for me, means vertex-vertex adjacency lists. I have tried use these commands but I got a list which has greater numbers than the total number of vertex, for instance {261, 331, 431, 438} I have only 100 points (but you have created 2-dimensional vector, I need the 3-dimensional one), so probably it is not a good solution.
|
|
| Jan 10, 2019 at 17:49 | history | answered | Henrik Schumacher | CC BY-SA 4.0 |