default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKeenan Crane
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j40]Bailey Miller
, Rohan Sawhney, Keenan Crane, Ioannis Gkioulekas:
Walkin' Robin: Walk on Stars with Robin Boundary Conditions. ACM Trans. Graph. 43(4): 41:1-41:18 (2024)- [j39]Nicole Feng, Keenan Crane:
A Heat Method for Generalized Signed Distance. ACM Trans. Graph. 43(4): 92:1-92:19 (2024) - [j38]Mark Gillespie, Denise Yang, Mario Botsch, Keenan Crane:
Ray Tracing Harmonic Functions. ACM Trans. Graph. 43(4): 99:1-99:18 (2024) - [j37]Josua Sassen, Henrik Schumacher, Martin Rumpf, Keenan Crane:
Repulsive Shells. ACM Trans. Graph. 43(4): 140:1-140:22 (2024) - [c8]Jirí Minarcík, Sam Estep, Wode Ni, Keenan Crane:
Minkowski Penalties: Robust Differentiable Constraint Enforcement for Vector Graphics. SIGGRAPH (Conference Paper Track) 2024: 2 - [i14]Bailey Miller, Rohan Sawhney, Keenan Crane, Ioannis Gkioulekas:
Differential Walk on Spheres. CoRR abs/2405.12964 (2024) - 2023
- [j36]Nicole Feng, Mark Gillespie, Keenan Crane:
Winding Numbers on Discrete Surfaces. ACM Trans. Graph. 42(4): 36:1-36:17 (2023) - [j35]Rohan Sawhney, Bailey Miller, Ioannis Gkioulekas, Keenan Crane:
Walk on Stars: A Grid-Free Monte Carlo Method for PDEs with Neumann Boundary Conditions. ACM Trans. Graph. 42(4): 80:1-80:20 (2023) - [j34]Bailey Miller, Rohan Sawhney, Keenan Crane, Ioannis Gkioulekas:
Boundary Value Caching for Walk on Spheres. ACM Trans. Graph. 42(4): 82:1-82:11 (2023) - [j33]Hsueh-Ti Derek Liu, Mark Gillespie, Benjamin Chislett, Nicholas Sharp, Alec Jacobson, Keenan Crane:
Surface Simplification using Intrinsic Error Metrics. ACM Trans. Graph. 42(4): 118:1-118:17 (2023) - [i13]Rohan Sawhney, Bailey Miller, Ioannis Gkioulekas, Keenan Crane:
Walk on Stars: A Grid-Free Monte Carlo Method for PDEs with Neumann Boundary Conditions. CoRR abs/2302.11815 (2023) - [i12]Bailey Miller, Rohan Sawhney, Keenan Crane, Ioannis Gkioulekas:
Boundary Value Caching for Walk on Spheres. CoRR abs/2302.11825 (2023) - [i11]Hsueh-Ti Derek Liu, Mark Gillespie, Benjamin Chislett, Nicholas Sharp, Alec Jacobson, Keenan Crane:
Surface Simplification using Intrinsic Error Metrics. CoRR abs/2305.06410 (2023) - 2022
- [j32]Nicholas Sharp, Souhaib Attaiki, Keenan Crane, Maks Ovsjanikov:
DiffusionNet: Discretization Agnostic Learning on Surfaces. ACM Trans. Graph. 41(3): 27:1-27:16 (2022) - [j31]Rohan Sawhney, Dario Seyb, Wojciech Jarosz, Keenan Crane:
Grid-free Monte Carlo for PDEs with spatially varying coefficients. ACM Trans. Graph. 41(4): 53:1-53:17 (2022) - [i10]Rohan Sawhney, Dario Seyb, Wojciech Jarosz, Keenan Crane:
Grid-Free Monte Carlo for PDEs with Spatially Varying Coefficients. CoRR abs/2201.13240 (2022) - 2021
- [j30]Chris Yu, Henrik Schumacher, Keenan Crane:
Repulsive Curves. ACM Trans. Graph. 40(2): 10:1-10:21 (2021) - [j29]Mark Gillespie, Boris Springborn, Keenan Crane:
Discrete conformal equivalence of polyhedral surfaces. ACM Trans. Graph. 40(4): 103:1-103:20 (2021) - [j28]Mark Gillespie, Nicholas Sharp, Keenan Crane:
Integer coordinates for intrinsic geometry processing. ACM Trans. Graph. 40(6): 252:1-252:13 (2021) - [j27]Chris Yu, Caleb Brakensiek, Henrik Schumacher, Keenan Crane:
Repulsive surfaces. ACM Trans. Graph. 40(6): 268:1-268:19 (2021) - [c7]Nicholas Sharp, Mark Gillespie, Keenan Crane:
Geometry processing with intrinsic triangulations. SIGGRAPH Courses 2021: 6:1 - [i9]Mark Gillespie, Nicholas Sharp, Keenan Crane:
Integer Coordinates for Intrinsic Geometry Processing. CoRR abs/2106.00220 (2021) - [i8]Christopher Yu, Caleb Brakensiek, Henrik Schumacher, Keenan Crane:
Repulsive Surfaces. CoRR abs/2107.01664 (2021) - 2020
- [j26]Nicholas Sharp, Keenan Crane:
A Laplacian for Nonmanifold Triangle Meshes. Comput. Graph. Forum 39(5): 69-80 (2020) - [j25]Rohan Sawhney, Keenan Crane:
Monte Carlo geometry processing: a grid-free approach to PDE-based methods on volumetric domains. ACM Trans. Graph. 39(4): 123 (2020) - [j24]Katherine Ye, Wode Ni, Max Krieger, Dor Ma'ayan, Jenna Wise, Jonathan Aldrich, Joshua Sunshine, Keenan Crane:
Penrose: from mathematical notation to beautiful diagrams. ACM Trans. Graph. 39(4): 144 (2020) - [j23]Nicholas Sharp, Keenan Crane:
You can find geodesic paths in triangle meshes by just flipping edges. ACM Trans. Graph. 39(6): 249:1-249:15 (2020) - [i7]Christopher Yu, Henrik Schumacher, Keenan Crane:
Repulsive Curves. CoRR abs/2006.07859 (2020) - [i6]Keenan Crane, Marco Livesu, Enrico Puppo, Yipeng Qin:
A Survey of Algorithms for Geodesic Paths and Distances. CoRR abs/2007.10430 (2020) - [i5]Nicholas Sharp, Souhaib Attaiki, Keenan Crane, Maks Ovsjanikov:
Diffusion is All You Need for Learning on Surfaces. CoRR abs/2012.00888 (2020)
2010 – 2019
- 2019
- [j22]Nicholas Sharp, Yousuf Soliman, Keenan Crane:
The Vector Heat Method. ACM Trans. Graph. 38(3): 24:1-24:19 (2019) - [j21]Nicholas Sharp, Yousuf Soliman, Keenan Crane:
Navigating intrinsic triangulations. ACM Trans. Graph. 38(4): 55:1-55:16 (2019) - [j20]Etienne Corman, Keenan Crane:
Symmetric moving frames. ACM Trans. Graph. 38(4): 87:1-87:16 (2019) - 2018
- [j19]Alex Baden, Keenan Crane, Misha Kazhdan:
Möbius Registration. Comput. Graph. Forum 37(5): 211-220 (2018) - [j18]Rohan Sawhney, Keenan Crane:
Boundary First Flattening. ACM Trans. Graph. 37(1): 5 (2018) - [j17]Oded Stein, Eitan Grinspun, Keenan Crane:
Developability of triangle meshes. ACM Trans. Graph. 37(4): 77 (2018) - [j16]Yousuf Soliman, Dejan Slepcev, Keenan Crane:
Optimal cone singularities for conformal flattening. ACM Trans. Graph. 37(4): 105 (2018) - [j15]Mina Konakovic-Lukovic, Julian Panetta, Keenan Crane, Mark Pauly:
Rapid deployment of curved surfaces via programmable auxetics. ACM Trans. Graph. 37(4): 106 (2018) - [j14]Nicholas Sharp, Keenan Crane:
Variational surface cutting. ACM Trans. Graph. 37(4): 156 (2018) - [i4]Nicholas Sharp, Yousuf Soliman, Keenan Crane:
The Vector Heat Method. CoRR abs/1805.09170 (2018) - 2017
- [j13]Keenan Crane, Clarisse Weischedel, Max Wardetzky:
The heat method for distance computation. Commun. ACM 60(11): 90-99 (2017) - [j12]Hsueh-Ti Derek Liu, Alec Jacobson, Keenan Crane:
A Dirac Operator for Extrinsic Shape Analysis. Comput. Graph. Forum 36(5): 139-149 (2017) - [j11]Christopher Yu, Keenan Crane, Stelian Coros:
Computational design of telescoping structures. ACM Trans. Graph. 36(4): 83:1-83:9 (2017) - [i3]Rohan Sawhney, Keenan Crane:
Boundary First Flattening. CoRR abs/1704.06873 (2017) - 2016
- [j10]Mina Konakovic, Keenan Crane, Bailin Deng, Sofien Bouaziz, Daniel Piker, Mark Pauly:
Beyond developable: computational design and fabrication with auxetic materials. ACM Trans. Graph. 35(4): 89:1-89:11 (2016) - 2015
- [j9]Felix Knöppel, Keenan Crane, Ulrich Pinkall, Peter Schröder:
Stripe patterns on surfaces. ACM Trans. Graph. 34(4): 39:1-39:11 (2015) - 2014
- [i2]Justin Solomon, Keenan Crane, Adrian Butscher, Chris Wojtan:
A General Framework for Bilateral and Mean Shift Filtering. CoRR abs/1405.4734 (2014) - 2013
- [b1]Keenan Crane:
Conformal Geometry Processing. California Institute of Technology, USA, 2013 - [j8]Felix Knöppel, Keenan Crane, Ulrich Pinkall, Peter Schröder:
Globally optimal direction fields. ACM Trans. Graph. 32(4): 59:1-59:10 (2013) - [j7]Keenan Crane, Ulrich Pinkall, Peter Schröder:
Robust fairing via conformal curvature flow. ACM Trans. Graph. 32(4): 61:1-61:10 (2013) - [j6]Keenan Crane, Clarisse Weischedel, Max Wardetzky:
Geodesics in heat: A new approach to computing distance based on heat flow. ACM Trans. Graph. 32(5): 152:1-152:11 (2013) - [c6]Keenan Crane, Fernando de Goes, Mathieu Desbrun, Peter Schröder:
Digital geometry processing with discrete exterior calculus. SIGGRAPH Courses 2013: 7:1-7:126 - 2012
- [i1]Keenan Crane, Clarisse Weischedel, Max Wardetzky:
Geodesics in Heat. CoRR abs/1204.6216 (2012) - 2011
- [j5]Keenan Crane, Ulrich Pinkall, Peter Schröder:
Spin transformations of discrete surfaces. ACM Trans. Graph. 30(4): 104 (2011) - 2010
- [j4]Keenan Crane, Mathieu Desbrun, Peter Schröder:
Trivial Connections on Discrete Surfaces. Comput. Graph. Forum 29(5): 1525-1533 (2010)
2000 – 2009
- 2009
- [j3]Marin Kobilarov, Keenan Crane, Mathieu Desbrun:
Lie group integrators for animation and control of vehicles. ACM Trans. Graph. 28(2): 16:1-16:14 (2009) - [j2]Patrick Mullen, Keenan Crane, Dmitry Pavlov, Yiying Tong, Mathieu Desbrun:
Energy-preserving integrators for fluid animation. ACM Trans. Graph. 28(3): 38 (2009) - [c5]Michael Glueck, Keenan Crane, Sean Anderson, Andres Rutnik, Azam Khan:
Multiscale 3D reference visualization. SI3D 2009: 225-232 - 2007
- [j1]Ryan White, Keenan Crane, David A. Forsyth:
Capturing and animating occluded cloth. ACM Trans. Graph. 26(3): 34 (2007) - [c4]Keenan Crane:
Capturing and animating occluded cloth. SIGGRAPH Computer Animation Festival 2007: 36 - [c3]Ryan White, Keenan Crane, David A. Forsyth:
Data driven cloth animation. SIGGRAPH Sketches 2007: 37 - 2006
- [c2]Nathan A. Carr, Jared Hoberock, Keenan Crane, John C. Hart:
Fast GPU ray tracing of dynamic meshes using geometry images. Graphics Interface 2006: 203-209 - [c1]Nathan A. Carr, Jared Hoberock, Keenan Crane, John C. Hart:
Rectangular multi-chart geometry images. Symposium on Geometry Processing 2006: 181-190
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
