Geometry Lab: Sitemap

Geometry Lab

[German] [About geometrylab.de]

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
      Triangulation of simple polygons
    - Minimum Fortress Guard Problem
      and VC-Dimension
    - MatMax
      Applications of the Matrix Maximum
  - Voronoi Diagrams and Delauney Triagulations
    - Lectures with Animations
      about selected topics in computational geometry
      (only in german)
    - VoroGlide
      Interactive Voronoi Diagrams
    - Convex distance functions
      Bisectors
    - 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
  - Dilation
  - Miscellaneous
- Robot Motion Planning
  - Robot motion planning in polygons
    - Exploring a rectangular polygon
    - STIP
      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
    - Search Ratio Calculator
      Search Ratio Of Search Paths In Simple Polygons
    - Flashlight Searcher
    - Trace Target
    - Inspection Paths
  - 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
    - RacingRobots
      Robot swarms with restricted orientation
    - Shannons Mouse
  - Manufacturing Technology
    - JawGripper
      Automated Polygon Orientation
  - Exploration of Graphs
    - CGE
      Constrained Graph Exploration
    - constrainedgraphexploration
      Shortest Constrained Path
- Online Algorithms
  - Operating Systems
    Memory allocation and paging algorithms
  - Online Bin Packing
  - Seat reservation problem

© University of Bonn, Computer Science I -

- Last modified 30-03-2010 08:50