Sciweavers

    2 search results - page 1 / 1
    » Routing a maximum number of disks through a scene of moving ...
    Sort
    View
    COMPGEOM
    2008
    ACM
    93views Discrete Geometry» more  COMPGEOM 2008»
    Routing a maximum number of disks through a scene of moving obstacles
    13 years 6 months ago
    Routing a maximum number of disks through a scene of moving obstacles
    Download  www.ams.sunysb.edu
    This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
    Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
    claim paper
    Read More »
    COMPGEOM
    2008
    ACM
    111views Discrete Geometry» more  COMPGEOM 2008»
    Maximum thick paths in static and dynamic environments
    13 years 6 months ago
    Maximum thick paths in static and dynamic environments
    Download  www.ams.sunysb.edu
    We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
    Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.