Sciweavers

    47 search results - page 10 / 10
    » cccg 2008
    Sort
    View
    CCCG
    2008
    89views Computational Geometry» more  CCCG 2008»
    Memory Requirements for Local Geometric Routing and Traversal in Digraphs
    13 years 6 months ago
    Memory Requirements for Local Geometric Routing and Traversal in Digraphs
    Download  www.matem.unam.mx
    Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
    Maia Fraser, Evangelos Kranakis, Jorge Urrutia
    claim paper
    Read More »
    CCCG
    2008
    101views Computational Geometry» more  CCCG 2008»
    Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap
    13 years 6 months ago
    Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap
    Download  www.cs.sfu.ca
    We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
    Hamid Reza Chitsaz, Steven M. LaValle, Jason M. O'...
    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.