Nick Sharp

@nmwsharp

Running, food, hockey, and applied geometry. PhD student in CS @ CMU.

Vrijeme pridruživanja: svibanj 2018.

Tweetovi

Blokirali ste korisnika/cu @nmwsharp

Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @nmwsharp

  1. Prikvačeni tweet
    18. srp 2019.

    I'm proud to announce Polyscope, a 3D visualization library in C++. The lofty objective of is to offer a useful visual interface to your data with a single line of code. Polyscope provides a viewer that "just works", anywhere in any codebase.

    Prikaži ovu nit
    Poništi
  2. 29. sij

    Just pushed a update with lots of small features and bugfixes😀 Change the "up" direction, preserve settings when re-registering quantities, save and restore the camera with ctrl-c/ctrl-v, and more! Check it out:

    Poništi
  3. proslijedio/la je Tweet
    6. sij

    Great stuff from and for rapidly prototyping geometric algorithms

    Poništi
  4. proslijedio/la je Tweet
    22. pro 2019.

    Integration example project between (geometry processing of digital/voxel data) and the excellent ‘s polyscope viewer ():

    Poništi
  5. proslijedio/la je Tweet
    29. stu 2019.

    Want to change the way the world thinks about geometric computing? The Geometry Collective at Carnegie Mellon University is looking for PhD students for 2020/2021. Topics include mesh processing, discrete differential geometry, and computational design.

    Prikaži ovu nit
    Poništi
  6. proslijedio/la je Tweet

    Cutting up a catenoid with and via 's variation surface cutting

    Poništi
  7. 13. lis 2019.

    Although, I don't know exactly how to use the determinant to check validity in higher dimensions or other geometries. Perhaps you still test all sub-simplicies?

    Prikaži ovu nit
    Poništi
  8. 13. lis 2019.

    Bonus: This determinant gives the squared area of a valid simplex up to a constant, and is well-defined in any dimension. Can also be generalized to spherical/hyperbolic domains.

    Prikaži ovu nit
    Poništi
  9. 13. lis 2019.

    Question: Given pairwise edge lengths between four vertices, how do you test if they can be assembled into a tetrahedron? Answer: First check the triangle inequality for all triplets. Then form the Cayley–Menger determinant---if it's positive, a tetrahedron exists!

    Prikaži ovu nit
    Poništi
  10. proslijedio/la je Tweet
    10. lis 2019.

    Say you have an unwieldy metric space. Instead of working with it directly, it is useful to approximate it with a simple(r) metric. I'll write about _tree_ approximations, which are prominent in TCS, and recently found their way into ML and applied algorithms. Please RT! 😸(1/10)

    Prikaži ovu nit
    Poništi
  11. proslijedio/la je Tweet
    Poništi
  12. 19. ruj 2019.
    Prikaži ovu nit
    Poništi
  13. 19. ruj 2019.

    My SIGGRAPH talk on The Vector Heat Method is now online! We show how to efficiently compute parallel transport w/ short-time heat flow. This new tool opens up lots of applications, like velocity extension, local parameterizations, and means on surfaces.

    Prikaži ovu nit
    Poništi
  14. proslijedio/la je Tweet
    16. kol 2019.

    A major takeaway from this paper: any good geometry processing library should at least implement intrinsic Delaunay flipping if not the proposed refinement method. (e.g., has flipping, and I'll be excited to add this refinement in the near future)

    Prikaži ovu nit
    Poništi
  15. proslijedio/la je Tweet
    15. kol 2019.

    using the Vector Heat Method ( ) to generate some interesting mosaic patterns! :) Original painting by van Gough.

    Poništi
  16. 13. kol 2019.

    Spent my plane ride adding curve networks to 😃 Visualize networks of lines in 3D (or 2D) space, as well as scalar and vector data along those lines! Go check it out:

    Poništi
  17. proslijedio/la je Tweet
    31. srp 2019.

    Fantastic talk by on the Vector Heat method, finally a reliable log map! And sample code!

    Poništi
  18. 26. srp 2019.
    Prikaži ovu nit
    Poništi
  19. 26. srp 2019.

    Had fun with this one :) Check out the fast forward for our SIGGRAPH 2019 paper "Navigating Intrinsic Triangulations". Run existing algorithms on bad meshes-- set them free! Talk is Tues July 30 at 12:10 in Room 152. With and .

    Prikaži ovu nit
    Poništi
  20. 24. srp 2019.

    Check out the fast-forward preview for our SIGGRAPH 2019 paper "The Vector Heat Method"! We found a way to parallel transport vector fields with heat flow, and it opens up awesome applications. Talk is Wed July 31 at 11:30 in Room 153. With and .

    Poništi
  21. 18. srp 2019.

    Check it out at ! There's a lot more in the works over the coming months.

    Prikaži ovu nit
    Poništi

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.

    Možda bi vam se svidjelo i ovo:

    ·