Sciweavers

    COMPGEOM
    2007
    ACM
    86views Discrete Geometry» more  COMPGEOM 2007»

    On the exact maximum complexity of Minkowski sums of convex polyhedra

    14 years 3 months ago
    On the exact maximum complexity of Minkowski sums of convex polyhedra
    Download  www.cs.tau.ac.il
    Efi Fogel, Dan Halperin, Christophe Weibel
    claim paper
    Added 14 Aug 2010
    Updated 14 Aug 2010
    Type Conference
    Year 2007
    Where COMPGEOM
    Authors Efi Fogel, Dan Halperin, Christophe Weibel
    Comments (0)
    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.