• Home
  • Computational Geometry
    • Basics

      Visibility In Polygons Kernel and Visibility Polygons

      Convex Hulls Algorithms for computing the convex hull

      The Diameter Function of an arbitrary polygon

      Polygon Area

      Minkowski Sum The Minkowski sum of simple polygons

      Triangulation of simple polygons

      Minimum Fortress Guard Problem and VC-Dimension

      MatMax Applications of the Matrix Maximum

      VisibleSegments Visible parts of n line segments

    • Voronoi Diagrams And Delauney Triagulations

      Lectures with Animations about selected topics in computational geometry (only in german)

      VoroGlide Interactive Voronoi Diagrams

      Convex distance functions

      VoroAdd Voronoi Diagrams With Additive Weights

      FCVD Farthest Color Voronoi Diagrams

      Graph FCVD Weighted Farthest Color Voronoi Diagrams on Trees and Graphs

      TopoVoro Topological Voronoi Regions

      Finding an Optimum Location

    • Dilation

      Polygon Detour

      Geometric dilation of a graph

      Graph-theoretic Dilation Of A Graph

      Minimum Dilation Triangulation

    • Miscellaneous

      Moving a Ladder in Two Dimensio

      Random polygon algorithms

      The Visibility Graph

      The bichromatic 2-center problem

      Smallest Color-Spanning Objects

      Watchtower

  • Robot Motion Planning
    • Robot Motion Planning In Polygons

      Exploring a rectangular polygon

      Searching in polygons

      SWR Shortest Watchman Route

      SAM Exploring an arbitrary polygon

      SIRIUS Searching in streets

      DASAC Maximum Detour from a given curve

      Shortest Path LP Shortest path in a simple polygon

      Shortest Paths Shortest Path Queries in a Simple Polygon

      SWR 2 Shortest Watchman Route In Rectangular Polygons

      SRCalc Search Ratio Of Search Paths In Simple Polygons

      Flashlight Searcher

      Trace Target

      Inspection Paths

      Path Planning Translation and Rotation with constant turns

    • Robot Motion Planning In Polygonal Scenes

      PolyRobot Robot Navigation In Polygonal Scenes

      Covering (Vacuum Cleaners) Covering polygonal scenes

      TPP Touring a sequence of polygons

      TPP 2 Touring a sequence of polygons

      CrPlacings Critical Placements

    • Motion planning in cellular environments

      GridRobot Exploring unknown cellular environments

      GridRobot3D Exploring three-dimensional unknown cellular environments

      Shannons Mouse

    • Manufacturing Technology

      JawGripper Automated Polygon Orientation

    • Exploration of Graphs

      CGE Constrained Graph Exploration

      Shortest Constrained Path

      GatheringRobot

  • Online Algorithms

    Operating Systems Memory allocation and paging algorithms

    Online Bin Packing

    Seat Reservation Problem

© Universität Bonn, Informatik Abt. I -