Keenan Crane

@keenanisalive

Digital Geometer. Assistant Professor of Computer Science and Robotics , and member of the .

Pittsburgh, PA
Joined January 2008

Tweets

You blocked @keenanisalive

Are you sure you want to view these Tweets? Viewing Tweets won't unblock @keenanisalive

  1. Retweeted
    Jan 29

    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:

    Undo
  2. Jan 11
    Undo
  3. Jan 10

    Most useful thing I have learned about Mathematica in the past year: you *can* actually tell it that some variables are (always!) real, positive, etc., using the global $Assumptions list.

    Undo
  4. Jan 6

    Great stuff from and for rapidly prototyping geometric algorithms

    Undo
  5. Jan 5

    (The other point of a caption, of course, is to totally oversell your research—which is really just bananas. 🍌)

    Show this thread
    Undo
  6. Jan 5

    I find that many students struggle early on to write good figure captions. A good caption doesn't just explain what’s already apparent in an image—it highlights how a specific example supports a more general principle, and explains why that principle is relevant or interesting.

    Show this thread
    Undo
  7. 29 Dec 2019

    How do you chop up a tetrahedron into nicely-shaped little cubes? Here's one way, obtained a la symmetric moving frames (). How else can you do it?

    Undo
  8. Retweeted
    22 Dec 2019

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

    Undo
  9. Retweeted
    29 Nov 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.

    Show this thread
    Undo
  10. Retweeted
    31 Jul 2016

    Awesome presentation/paper on optimal stripe patterns & pattern formation by

    Undo
  11. 29 Nov 2019

    More info about here: Applicants with an interdisciplinary background (e.g., CS + math or CS + physics) are especially encouraged to apply. Deadline is December 12, 2019!

    Show this thread
    Undo
  12. 29 Nov 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.

    Show this thread
    Undo
  13. 24 Nov 2019

    Nominations can be sent to technical-awards@siggraph.org and should include a suggested citation (short phrase starting with "for .. ") and a nomination statement (maximum of 500 words) addressing why the candidate should receive the award.

    Show this thread
    Undo
  14. 24 Nov 2019

    The SIGGRAPH Technical Awards Committee is soliciting nominations for the 2020 Computer Graphics Achievement and Significant New Researcher Awards: Help our community flourish by nominating the (many!) deserving graphics researchers. Deadline Jan 31 2020

    Show this thread
    Undo
  15. Retweeted
    11 Nov 2019

    Simulation and field-driven five axis FDM/FFF/AFP/ATL? Constant width plies of known width on arbitrary surface curvature? Layers generated from spatially varying offsets that never fail? C-∞ blends? Centerline+Normal and STEP output? Yeah, we're on it.

    90 Degree Separation between layers
    120 Degree Separation
    Undo
  16. 6 Nov 2019
    Show this thread
    Undo
  17. 6 Nov 2019

    In college I recreated “The Gibson” from Hackers as an interactive OpenGL program. As of tonight it still runs on my 2004 PowerBook G4.

    Show this thread
    Undo
  18. 6 Nov 2019

    *Where B₀(x)=(1−x)³, B₁(x)=3x(1−x)², B₂(x)=3x²(1−x), B₃(x)=x³ are the cubic Bernstein polynomials.

    Show this thread
    Undo
  19. 6 Nov 2019

    How do you ensure that a cubic Bézier* f(x)=∑ᵢ cᵢBᵢ(x), is strictly increasing? A: Pick coefficients such that c₁>c₀, c₃>c₂ and (c₁²+c₂²+c₀(c₃−c₂)−c₁(c₂+c₃))/(c₀−3c₁+3c₂−c₃) > 0. (Who says you don't learn anything useful in high school math?)

    Show this thread
    Undo
  20. 2 Nov 2019

    Nice background on convex duality; particularly useful for anyone interested in digging deeper into our algorithm for optimal cone singularities:

    Undo

Loading seems to be taking a while.

Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.

    You may also like

    ·