Joel Hass

Orcid: 0000-0002-9019-4464

According to our database1, Joel Hass authored at least 18 papers between 1999 and 2020.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Approximating Surfaces in R<sup>3</sup> by Meshes with Guaranteed Regularity.
CoRR, 2020

Approximating isosurfaces by guaranteed-quality triangular meshes.
Comput. Graph. Forum, 2020

2017
Comparing shapes of genus-zero surfaces.
J. Appl. Comput. Topol., 2017

2016
Invariants of Random Knots and Links.
Discret. Comput. Geom., 2016

2014
Automatic Alignment of Genus-Zero Surfaces.
IEEE Trans. Pattern Anal. Mach. Intell., 2014

2013
Globally Optimal Cortical Surface Matching with Exact Landmark Correspondence.
Proceedings of the Information Processing in Medical Imaging, 2013

2010
Unknot Diagrams Requiring a Quadratic Number of Reidemeister Moves to Untangle.
Discret. Comput. Geom., 2010

Sampling the conformation of protein surface residues for flexible protein docking.
BMC Bioinform., 2010

2007
Guaranteed consistency of surface intersections and trimmed surfaces using a coupled topology resolution and domain decomposition scheme.
Adv. Comput. Math., 2007

2005
Boundary evaluation algorithms for Minkowski combinations of complex sets using topological analysis of implicit curves.
Numer. Algorithms, 2005

2004
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., 2004

Linear perturbation methods for topologically consistent representations of free-form surface intersections.
Comput. Aided Geom. Des., 2004

Topologically consistent trimmed surface approximations based on triangular patches.
Comput. Aided Geom. Des., 2004

2003
The Size of Spanning Disks for Polygonal Curves.
Discret. Comput. Geom., 2003

2002
3-manifold knot genus is NP-complet.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

3-MANIFOLD KNOT GENUS is NP-complete.
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

1999
The Computational Complexity of Knot and Link Problems.
J. ACM, 1999

Emerging Challenges in Computational Topology
CoRR, 1999


  Loading...