Department of Computer Science

  1. Published

    Numerical methods for linear complementarity problems in physics-based animation

    Abel, S. M. N. & Erleben, Kenny, 2015, Morgan & Claypool Publishers. 159 p. (Synthesis Lectures on Computer Graphics and Animation; No. 1, Vol. 7).

    Research output: Book/ReportCompendium/lecture notesEducation

  2. Published

    Euclidean TSP between two nested convex obstacles

    Abrahamsen, J., Shokoufandeh, A. & Winter, Pawel, 2005, In: Information Processing Letters. 95, p. 370-375

    Research output: Contribution to journalJournal articleResearchpeer-review

  3. Published

    Best laid plans of lions and men

    Abrahamsen, Mikkel, Holm, Jacob, Rotenberg, E. & Wulff-Nilsen, Christian, 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 6. (Leibniz International Proceedings in Informatics, Vol. 77).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  4. Published

    The art gallery problem is ∃ ℝ-complete

    Abrahamsen, Mikkel, Adamaszek, A. & Miltzow, T., 2018, STOC 2018 Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, p. 65-73

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  5. Published

    Finding the maximum subset with bounded convex curvature

    Abrahamsen, Mikkel & Thorup, Mikkel, 2016, 32nd International Symposium on Computational Geometry (SoCG 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 17 p. 4. (Leibniz International Proceedings in Informatics, Vol. 51).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  6. Published

    Minimum perimeter-sum partitions in the plane

    Abrahamsen, Mikkel, de Berg, M., Buchin, K., Mehr, M. & Mehrabi, A. D., 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 p. 4. (Leibniz International Proceedings in Informatics, Vol. 77).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  7. Published

    Spiral toolpaths for high-speed machining of 2d pockets with or without islands

    Abrahamsen, Mikkel, 2015, Proceedings of the ASME 2015 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference IDETC/CIE 2015. American Society of Mechanical Engineers, Vol. 2B. 10 p. DETC2015-46255

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  8. Published

    An optimal algorithm for the separating common tangents of two polygons

    Abrahamsen, Mikkel, 2015, In: Leibniz International Proceedings in Informatics. 34, p. 198-208 11 p.

    Research output: Contribution to journalConference articleResearchpeer-review

  9. Published

    Range-clustering queries

    Abrahamsen, Mikkel, de Berg, M., Buchin, K., Mehr, M. & Mehrabi, A. D., 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 5. (Leibniz International Proceedings in Informatics, Vol. 77).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  10. Published

    An optimal algorithm computing edge-to-edge visibility in a simple polygon

    Abrahamsen, Mikkel, 2013, Proceedings of the 25th Canadian Conference on Computational Geometry: CCCG 2013. p. 157-162 6 p.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Previous 1 2 3 4 5 6 7 8 ...170 Next