Brönnimann, Hervé; Devillers, Olivier; Dujmović, Vida; Everett, Hazel; Glisse, Marc; Goaoc, Xavier; Lazard, Sylvain; Na, Hyeon-Suk; Whitesides, Sue Lines and free line segments tangent to arbitrary three-dimensional convex polyhedra. (English) Zbl 1138.65019 SIAM J. Comput. 37, No. 2, 522-551 (2007). MSC: 65D18 52B55 PDFBibTeX XMLCite \textit{H. Brönnimann} et al., SIAM J. Comput. 37, No. 2, 522--551 (2007; Zbl 1138.65019) Full Text: DOI
Brönnimann, H.; Everett, H.; Lazard, S.; Sottile, F.; Whitesides, S. Transversals to line segments in three-dimensional space. (English) Zbl 1083.52003 Discrete Comput. Geom. 34, No. 3, 381-390 (2005). Reviewer: Marek Lassak (Bydgoszcz) MSC: 52A15 52A20 PDFBibTeX XMLCite \textit{H. Brönnimann} et al., Discrete Comput. Geom. 34, No. 3, 381--390 (2005; Zbl 1083.52003) Full Text: DOI
Brönnimann, H.; Devillers, O.; Dujmović, V.; Everett, H.; Glisse, M.; Goaoc, X.; Lazard, S.; Na, H.-S.; Whitesides, S. The number of lines tangent to arbitrary convex polyhedra in 3D. (English) Zbl 1374.68645 Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8–11, 2004. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-885-7). 46-55 (2004). MSC: 68U05 52B05 52B55 PDFBibTeX XMLCite \textit{H. Brönnimann} et al., in: Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8--11, 2004. New York, NY: Association for Computing Machinery (ACM). 46--55 (2004; Zbl 1374.68645) Full Text: DOI Link
Dujmović, Vida; Whitesides, Sue A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation. (English) Zbl 1082.68589 Algorithmica 40, No. 1, 15-31 (2004). MSC: 68R10 68Q25 52B55 PDFBibTeX XMLCite \textit{V. Dujmović} and \textit{S. Whitesides}, Algorithmica 40, No. 1, 15--31 (2004; Zbl 1082.68589) Full Text: DOI
Biedl, Therese; Demaine, Erik; Demaine, Martin; Lazard, Sylvain; Lubiw, Anna; O’Rourke, Joseph; Robbins, Steve; Streinu, Ileana; Toussaint, Godfried; Whitesides, Sue A note on reconfiguring tree linkages: Trees can lock. (English) Zbl 0993.52003 Discrete Appl. Math. 117, No. 1-3, 293-297 (2002). MSC: 52C25 PDFBibTeX XMLCite \textit{T. Biedl} et al., Discrete Appl. Math. 117, No. 1--3, 293--297 (2002; Zbl 0993.52003) Full Text: DOI