Tweetovi
- Tweetovi, trenutna stranica.
- Tweetovi i odgovori
- Medijski sadržaj
Blokirali ste korisnika/cu @nmwsharp
Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @nmwsharp
-
Prikvačeni tweet
I'm proud to announce Polyscope, a 3D visualization library in C++. The lofty objective of
#Polyscope 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. http://polyscope.run pic.twitter.com/FwoTeNKd8LPrikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Just pushed a
#polyscope 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: http://polyscope.run pic.twitter.com/wcP3dIuyufHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Nick Sharp proslijedio/la je Tweet
Great stuff from
@dcoeurjo and@nmwsharp for rapidly prototyping geometric algorithmshttps://twitter.com/libdgtal/status/1214095579640475648 …Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Nick Sharp proslijedio/la je Tweet
Integration example project between
@libdgtal (geometry processing of digital/voxel data) and the excellent@nmwsharp ‘s polyscope viewer (http://polyscope.run ):https://github.com/dcoeurjo/polyscope-dgtal …Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Nick Sharp proslijedio/la je Tweet
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. https://applygrad.cs.cmu.edu/apply/index.php?domain=1 …pic.twitter.com/ppOIVRmIXF
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Nick Sharp proslijedio/la je Tweet
Cutting up a catenoid with
@henryseg and@Sabetta_ via@nmwsharp 's variation surface cuttingpic.twitter.com/1nYbqsChhk
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
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 nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
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. https://en.wikipedia.org/wiki/Cayley%E2%80%93Menger_determinant …
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
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!pic.twitter.com/JwlTCv6oRH
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Nick Sharp proslijedio/la je Tweet
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 nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Nick Sharp proslijedio/la je Tweet
It’s alive!!!! (cc
@keenanisalive@nmwsharp)pic.twitter.com/gt5empmnmi
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Work with
@yousufmsoliman and@keenanisalive. Paper: http://www.cs.cmu.edu/~kmcrane/Projects/VectorHeatMethod/paper.pdf … Code:https://github.com/nmwsharp/vector-heat-demo …Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
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.https://www.youtube.com/watch?v=MNbM78xIriM …
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Nick Sharp proslijedio/la je Tweet
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.,
#libigl has flipping, and I'll be excited to add this refinement in the near future)Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Nick Sharp proslijedio/la je Tweet
using the Vector Heat Method (
@nmwsharp@yousufmsoliman@keenanisalive) to generate some interesting mosaic patterns! :) Original painting by van Gough.#Houdinipic.twitter.com/HC9VDZbqPB
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Spent my plane ride adding curve networks to
#polyscope
Visualize networks of lines in 3D (or 2D) space, as well as scalar and vector data along those lines! Go check it out: http://polyscope.run/structures/curve_network/basics/ …pic.twitter.com/tN3OrSUw8EHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Nick Sharp proslijedio/la je Tweet
Fantastic
@siggraph talk by@nmwsharp on the Vector Heat method, finally a reliable log map! And sample code! https://github.com/nmwsharp/vector-heat-demo …@keenanisaliveHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Read the paper here! https://www.cs.cmu.edu/~kmcrane/Projects/NavigatingIntrinsicTriangulations/paper.pdf …
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
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
@yousufmsoliman and@keenanisalive.pic.twitter.com/VhzF46zcbyPrikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
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
@yousufmsoliman and@keenanisalive.pic.twitter.com/jXiP4zxqjtHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Check it out at http://polyscope.run ! There's a lot more in the works over the coming months.
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoniš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.