Geometry Collective (@geomcollective) 's Twitter Profile
Geometry Collective

@geomcollective

We are a group of researchers @CarnegieMellon @SCSatCMU studying the interaction between geometry and computer science. (Threads & Insta: geometry.collective)

ID: 943108781491326977

linkhttp://geometry.cs.cmu.edu calendar_today19-12-2017 13:20:30

289 Tweet

3,3K Followers

12 Following

Nicole Feng (@nicolefeng_) 's Twitter Profile Photo

Code for Surface Winding Numbers is out! Input a triangle mesh & a curve on the mesh -> get the winding number function & decomposition of the curve into bounding + nonbounding components. Works with surfaces and curves of general topology. C++ code: github.com/nzfeng/SWN

Nicole Feng (@nicolefeng_) 's Twitter Profile Photo

Interested in animation? We've created artist tools that directly manipulate *contact areas between objects*, allowing intuitive modeling of contact-rich interactions & automatic pose optimization. Contact Arjun Lakshmipathy (andrew.cmu.edu/user/aslakshm/) for code!

Interested in animation? We've created artist tools that directly manipulate *contact areas between objects*, allowing intuitive modeling of contact-rich interactions & automatic pose optimization. 

Contact Arjun Lakshmipathy (andrew.cmu.edu/user/aslakshm/) for code!
Keenan Crane (@keenanisalive) 's Twitter Profile Photo

Super proud and excited for my student Zoë Marschner, who is one of only 18 recipients of the Fannie and John Hertz Foundation PhD fellowship! 🥳🎉🪅 Zoë has already done some top-notch work in geometry processing, which you can check out here: zoemarschner.com

Super proud and excited for my student Zoë Marschner, who is one of only 18 recipients of the <a href="/HertzFoundation/">Fannie and John Hertz Foundation</a> PhD fellowship! 🥳🎉🪅

Zoë has already done some top-notch work in geometry processing, which you can check out here: zoemarschner.com
Yining Karl Li (@yiningkarlli) 's Twitter Profile Photo

One of my all-time favorite paper titles is "You Can Find Geodesic Paths in Triangle Meshes by Just Flipping Edges" by Nick Sharp and Keenan Crane. The entire core method of the paper is described fully by just the title! We need more papers like this. nmwsharp.com/research/flip-…

Bruno Levy (@brunolevy01) 's Twitter Profile Photo

#geogram/Graphite and Nick Sharp's Polyscope play well together with Python ! Two Symposium on Geometry Processing award-winning softwares at your fingertips ! (cc Nicolò Campolongo : you need to import polyscope *before* gompy)

#geogram/Graphite and  <a href="/nmwsharp/">Nick Sharp</a>'s  Polyscope play well together with Python !
Two <a href="/GeometryProcess/">Symposium on Geometry Processing</a> award-winning softwares at your fingertips !
(cc <a href="/Nico_Campolongo/">Nicolò Campolongo</a> : you need to import polyscope *before* gompy)
Keenan Crane (@keenanisalive) 's Twitter Profile Photo

Very proud of my group Geometry Collective, for their consistent focus on quality in research. We have 5 papers at #SIGGRAPH2024, including two Best Paper Awards and one Honorable Mention. Only 5 and 12 such awards (respectively) are given out total, from a pool of ~840 submissions

Very proud of my group <a href="/GeomCollective/">Geometry Collective</a>, for their consistent focus on quality in research.

We have 5 papers at #SIGGRAPH2024, including two Best Paper Awards and one Honorable Mention.

Only 5 and 12 such awards (respectively) are given out total, from a pool of ~840 submissions
Keenan Crane (@keenanisalive) 's Twitter Profile Photo

Also proud of my student Mark Gillespie, who won *yet another* Best Paper (Honorable Mention) for very cool work on solid 3D knitting: markjgillespie.com/Research/solid… Altogether, this means Carnegie Mellon University Computer Graphics is taking home about 25% of all #SIGGRAPH2024 paper awards…!

Also proud of my student <a href="/MarkGillespie64/">Mark Gillespie</a>, who won *yet another* Best Paper (Honorable Mention) for very cool work on solid 3D knitting: markjgillespie.com/Research/solid…

Altogether, this means <a href="/CarnegieMellon/">Carnegie Mellon University</a> Computer Graphics is taking home about 25% of all #SIGGRAPH2024 paper awards…!
Geometry Collective (@geomcollective) 's Twitter Profile Photo

Heads up that if you’re at #SGP2024 this week, we’ve created a channel on the Geometry Processing Worldwide Discord for folks to chat and coordinate! Even if you’re not at SGP, there’s a lot of great geometry processing talk happening here: discord.gg/Y8NwgQfwM4

Heads up that if you’re at #SGP2024 this week, we’ve created a channel on the Geometry Processing Worldwide Discord for folks to chat and coordinate!

Even if you’re not at SGP, there’s a lot of great geometry processing talk happening here:

discord.gg/Y8NwgQfwM4
Rohan Sawhney (@rohansawhney1) 's Twitter Profile Photo

The talk, slides, and code for our SGP graduate school course on MCGP can be found here: rohan-sawhney.github.io/mcgp-resources/ We cover a lot of ground: Monte Carlo integration, differential equations, Brownian motion, and of course walk on spheres, which nicely ties all these topics

Nick Sharp (@nmwsharp) 's Twitter Profile Photo

A quick tutorial on polyscope in Python, in just a few tweets from Bruno Levy Bruno has been showing some great experiments this past week combining Polyscope with the excellent #geogram + Graphite, I love it!!

Keenan Crane (@keenanisalive) 's Twitter Profile Photo

Need to solve PDEs, and struggle with meshing? Heard about "Walk on Spheres," but didn't know where to start? Check out the awesome intro course by Rohan Sawhney and @baileymmiller1, just posted from #SGP2024: youtube.com/watch?v=1u-5b4…

Keenan Crane (@keenanisalive) 's Twitter Profile Photo

If you're at #SIGGRAPH2024, I will be giving a talk on "Repulsive Shells" tomorrow (Thursday) in the Geometry: Editing and Deformation session, which begins at 10:45am in Mile High 2A.

Keenan Crane (@keenanisalive) 's Twitter Profile Photo

Signed distance functions (SDFs) are an important surface representation, which can be directly visualized via the “sphere tracing” algorithm. At #SIGGRAPH2024 we showed how to sphere trace a whole new class of surfaces, based on *harmonic functions* rather than SDFs. [1/n]

Signed distance functions (SDFs) are an important surface representation, which can be directly visualized via the “sphere tracing” algorithm.

At #SIGGRAPH2024 we showed how to sphere trace a whole new class of surfaces, based on *harmonic functions* rather than SDFs. [1/n]
Rohan Sawhney (@rohansawhney1) 's Twitter Profile Photo

🔍Need efficient distance queries for 2D/3D meshes? Check out FCPW – a user-friendly library in C++ and Python with GPU support! 💻 Get started here: github.com/rohan-sawhney/… Also available on PyPI: pip install fcpw🐍

Nicole Feng (@nicolefeng_) 's Twitter Profile Photo

Signed distance functions (SDFs) are fundamental tools in graphics, vision, and physics simulation. But how do you get a high-quality SDF from messy, real-world input? At #SIGGRAPH2024, we introduced a simple method for turning "broken" geometry into a well-behaved SDF. <🧵>

Signed distance functions (SDFs) are fundamental tools in graphics, vision, and physics simulation. 

But how do you get a high-quality SDF from messy, real-world input? At #SIGGRAPH2024, we introduced a simple method for turning "broken" geometry into a well-behaved SDF. &lt;🧵&gt;
Nicole Feng (@nicolefeng_) 's Twitter Profile Photo

If you’re interested in generalized signed distance functions but didn’t make it to our SIGGRAPH talk, I’ve recorded my presentation: youtube.com/watch?v=IzBY-j… Look for official code releases in the coming weeks!

Keenan Crane (@keenanisalive) 's Twitter Profile Photo

OpenAI's new 4o image generation is pretty amazing. It also fails on some utterly basic tasks. Maybe a good metaphor for how easily we can be misled by algorithms based largely on fitting empirical data (i.e., machine learning) rather than deductive reasoning. Penrose

<a href="/OpenAI/">OpenAI</a>'s new 4o image generation is pretty amazing.

It also fails on some utterly basic tasks.

Maybe a good metaphor for how easily we can be misled by algorithms based largely on fitting empirical data (i.e., machine learning) rather than deductive reasoning. <a href="/UsePenrose/">Penrose</a>