×

Found 26 Documents (Results 1–26)

Partially walking a polygon. (English) Zbl 07561414

Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 60, 9 p. (2018).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Hide-and-seek: algorithms for polygon walk problems. (English) Zbl 1331.68249

Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 495-504 (2011).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

A linear-time algorithm for finding all door locations that make a room searchable. (Extended abstract). (English) Zbl 1139.68416

Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 5th international conference, TAMC 2008, Xi’an, China, April 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79227-7/pbk). Lecture Notes in Computer Science 4978, 502-513 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Finding all weakly-visible chords of a polygon in linear time (extended abstract). (English) Zbl 1502.68310

Schmidt, Erik M. (ed.) et al., Algorithm theory – SWAT ’94. 4th Scandinavian workshop on algorithm theory, Aarhus, Denmark, July 6–8, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 824, 119-130 (1994).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field