default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoel Hass
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j13]Joel Hass
, Maria Trnkova:
Approximating isosurfaces by guaranteed-quality triangular meshes. Comput. Graph. Forum 39(5): 29-40 (2020)- [i2]Joel Hass, Maria Trnkova:
Approximating Surfaces in R3 by Meshes with Guaranteed Regularity. CoRR abs/2001.09081 (2020)
2010 – 2019
- 2017
- [j12]Joel Hass, Patrice Koehl:
Comparing shapes of genus-zero surfaces. J. Appl. Comput. Topol. 1(1): 57-87 (2017) - 2016
- [j11]Chaim Even-Zohar, Joel Hass, Nati Linial, Tahl Nowik:
Invariants of Random Knots and Links. Discret. Comput. Geom. 56(2): 274-314 (2016) - 2014
- [j10]Patrice Koehl, Joel Hass:
Automatic Alignment of Genus-Zero Surfaces. IEEE Trans. Pattern Anal. Mach. Intell. 36(3): 466-478 (2014) - 2013
- [c4]Alex Tsui, Devin Fenton, Phong Vuong, Joel Hass, Patrice Koehl, Nina Amenta, David Coeurjolly, Charles DeCarli, Owen T. Carmichael:
Globally Optimal Cortical Surface Matching with Exact Landmark Correspondence. IPMI 2013: 487-498 - 2010
- [j9]Patricia Francis-Lyon, Shengyin Gu, Joel Hass, Nina Amenta, Patrice Koehl:
Sampling the conformation of protein surface residues for flexible protein docking. BMC Bioinform. 11: 575 (2010) - [j8]Joel Hass, Tahl Nowik:
Unknot Diagrams Requiring a Quadratic Number of Reidemeister Moves to Untangle. Discret. Comput. Geom. 44(1): 91-95 (2010)
2000 – 2009
- 2007
- [j7]Joel Hass, Rida T. Farouki, Chang Yong Han, Xiaowen Song, Thomas W. Sederberg:
Guaranteed consistency of surface intersections and trimmed surfaces using a coupled topology resolution and domain decomposition scheme. Adv. Comput. Math. 27(1): 1-26 (2007) - 2005
- [j6]Rida T. Farouki, Chang Yong Han, Joel Hass:
Boundary evaluation algorithms for Minkowski combinations of complex sets using topological analysis of implicit curves. Numer. Algorithms 40(3): 251-283 (2005) - 2004
- [j5]Xiaowen Song, Thomas W. Sederberg, Jianmin Zheng, Rida T. Farouki, Joel Hass:
Linear perturbation methods for topologically consistent representations of free-form surface intersections. Comput. Aided Geom. Des. 21: 303-319 (2004) - [j4]Xiaowen Song, Thomas W. Sederberg, Jianmin Zheng, Rida T. Farouki, Joel Hass:
Corrigendum to: 'Linear perturbation methods for topologically consistent representations of free-form surface intersections': Computer Aided Geometric Design 21 (2004) 303-319. Comput. Aided Geom. Des. 21: 321 (2004) - [j3]Rida T. Farouki, Chang Yong Han, Joel Hass, Thomas W. Sederberg:
Topologically consistent trimmed surface approximations based on triangular patches. Comput. Aided Geom. Des. 21: 459-478 (2004) - 2003
- [j2]Joel Hass, Jack Snoeyink, William P. Thurston:
The Size of Spanning Disks for Polygonal Curves. Discret. Comput. Geom. 29(1): 1-17 (2003) - 2002
- [c3]Ian Agol, Joel Hass, William P. Thurston:
3-MANIFOLD KNOT GENUS is NP-complete. CCC 2002: 24 - [c2]Ian Agol, Joel Hass, William P. Thurston:
3-manifold knot genus is NP-complet. STOC 2002: 761-766
1990 – 1999
- 1999
- [j1]Joel Hass, J. C. Lagarias, Nicholas Pippenger:
The Computational Complexity of Knot and Link Problems. J. ACM 46(2): 185-211 (1999) - [i1]Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin:
Emerging Challenges in Computational Topology. CoRR cs.CG/9909001 (1999) - 1997
- [c1]Joel Hass, J. C. Lagarias, Nicholas Pippenger:
The Computational Complexity of Knot and Link Problems. FOCS 1997: 172-181
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-04-25 05:57 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:
