Sciweavers

    2 search results - page 1 / 1
    » Thick non-crossing paths and minimum-cost flows in polygonal...
    Sort
    View
    87
    Voted
    COMPGEOM
    2007
    ACM
    83views Discrete Geometry» more  COMPGEOM 2007»
    Thick non-crossing paths and minimum-cost flows in polygonal domains
    15 years 1 months ago
    Thick non-crossing paths and minimum-cost flows in polygonal domains
    Download  www.ams.sunysb.edu
    Valentin Polishchuk, Joseph S. B. Mitchell
    claim paper
    Read More »
    CCCG
    2009
    120views Computational Geometry» more  CCCG 2009»
    Approximating Maximum Flow in Polygonal Domains using Spanners
    14 years 10 months ago
    Approximating Maximum Flow in Polygonal Domains using Spanners
    Download  cccg.ca
    We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
    Joondong Kim, Joseph S. B. Mitchell, Jingyu Zou
    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-2025, USA.