Sciweavers

    CCCG
    2007
    130views Computational Geometry» more  CCCG 2007»
    Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs
    13 years 6 months ago
    Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs
    Download  people.csail.mit.edu
    The empty space around n disjoint line segments in the plane can be partitioned into n + 1 convex faces by extending the segments in some order. The dual graph of such a partition...
    Nadia Benbernou, Erik D. Demaine, Martin L. Demain...
    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.