Erickson, Jeff; Nayyeri, Amir Tracing compressed curves in triangulated surfaces. (English) Zbl 1275.68153 Discrete Comput. Geom. 49, No. 4, 823-863 (2013). MSC: 68U05 57M20 05C10 53C22 PDFBibTeX XMLCite \textit{J. Erickson} and \textit{A. Nayyeri}, Discrete Comput. Geom. 49, No. 4, 823--863 (2013; Zbl 1275.68153) Full Text: DOI
Keil, Mark; Mount, David M.; Wismath, S. K. Visibility stabs and depth-first spiralling on line segments in output sensitive time. (English) Zbl 0968.68122 Int. J. Comput. Geom. Appl. 10, No. 5, 535-552 (2000). MSC: 68R10 PDFBibTeX XMLCite \textit{M. Keil} et al., Int. J. Comput. Geom. Appl. 10, No. 5, 535--552 (2000; Zbl 0968.68122) Full Text: DOI
Ghosh, Subir Kumar; Maheshwari, Anil; Pal, Sudebkumar Prasant; Saluja, Sanjeev; Veni Madhavan, C. E. Characterizing and recognizing weak visibility polygons. (English) Zbl 0777.68077 Comput. Geom. 3, No. 4, 213-233 (1993). MSC: 68U05 68Q25 PDFBibTeX XMLCite \textit{S. K. Ghosh} et al., Comput. Geom. 3, No. 4, 213--233 (1993; Zbl 0777.68077) Full Text: DOI
Wismath, S. K. Computing the full visibility graph of a set of line segments. (English) Zbl 0772.68109 Inf. Process. Lett. 42, No. 5, 257-261 (1992). MSC: 68U05 68Q25 PDFBibTeX XMLCite \textit{S. K. Wismath}, Inf. Process. Lett. 42, No. 5, 257--261 (1992; Zbl 0772.68109) Full Text: DOI
Djidjev, Hristo N.; Lingas, Andrzej; Sack, Jörg-Rüdiger An \(O(n\log n)\) algorithm for computing the link center of a simple polygon. (English) Zbl 0776.68108 Discrete Comput. Geom. 8, No. 2, 131-152 (1992). MSC: 68U05 52A10 PDFBibTeX XMLCite \textit{H. N. Djidjev} et al., Discrete Comput. Geom. 8, No. 2, 131--152 (1992; Zbl 0776.68108) Full Text: DOI
Djidjev, Hristo N.; Lingas, Andrzej; Sack, Jörg-Rüdiger An \(O(n \log n)\) algorithm for computing a link center in a simple polygon. (English) Zbl 1492.68133 Monien, Burkhard (ed.) et al., STACS 89. 6th annual symposium on theoretical aspects of computer science, Paderborn, FRG, February 16–18, 1989. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 349, 96-107 (1989). MSC: 68U05 68Q25 PDFBibTeX XMLCite \textit{H. N. Djidjev} et al., Lect. Notes Comput. Sci. 349, 96--107 (1989; Zbl 1492.68133) Full Text: DOI
Toussaint, G. On separating two simple polygons by a single translation. (English) Zbl 0684.68063 Discrete Comput. Geom. 4, No. 3, 265-278 (1989). MSC: 68Q25 52A10 PDFBibTeX XMLCite \textit{G. Toussaint}, Discrete Comput. Geom. 4, No. 3, 265--278 (1989; Zbl 0684.68063) Full Text: DOI EuDML
Guibas, Leonidas; Hershberger, John; Leven, Daniel; Sharir, Micha; Tarjan, Robert E. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. (English) Zbl 0642.68081 Algorithmica 2, 209-233 (1987). MSC: 68Q25 68P10 52-04 52A10 51M15 PDFBibTeX XMLCite \textit{L. Guibas} et al., Algorithmica 2, 209--233 (1987; Zbl 0642.68081) Full Text: DOI