2007 |
10 | EE | 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) |
2004 |
9 | EE | Xiaowen Song,
Thomas W. Sederberg,
Jianmin Zheng,
Rida T. Farouki,
Joel Hass:
Linear perturbation methods for topologically consistent representations of free-form surface intersections.
Computer Aided Geometric Design 2004: 303-319 |
8 | EE | 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.
Computer Aided Geometric Design 2004: 321 |
7 | EE | Rida T. Farouki,
Chang Yong Han,
Joel Hass,
Thomas W. Sederberg:
Topologically consistent trimmed surface approximations based on triangular patches.
Computer Aided Geometric Design 2004: 459-478 |
2003 |
6 | EE | Joel Hass,
Jack Snoeyink,
William P. Thurston:
The Size of Spanning Disks for Polygonal Curves.
Discrete & Computational Geometry 29(1): 1-17 (2003) |
2002 |
5 | EE | Ian Agol,
Joel Hass,
William P. Thurston:
3-MANIFOLD KNOT GENUS is NP-complete.
IEEE Conference on Computational Complexity 2002: 24 |
4 | EE | Ian Agol,
Joel Hass,
William P. Thurston:
3-manifold knot genus is NP-complet.
STOC 2002: 761-766 |
1999 |
3 | EE | 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) |
2 | EE | Joel Hass,
J. C. Lagarias,
Nicholas Pippenger:
The Computational Complexity of Knot and Link Problems.
J. ACM 46(2): 185-211 (1999) |
1997 |
1 | EE | Joel Hass,
J. C. Lagarias,
Nicholas Pippenger:
The Computational Complexity of Knot and Link Problems.
FOCS 1997: 172-181 |