Sciweavers

    35 search results - page 3 / 7
    » cccg 2009
    Sort
    View
    CCCG
    2009
    115views Computational Geometry» more  CCCG 2009»
    Data Structures for Reporting Extension Violations in a Query Range
    13 years 6 months ago
    Data Structures for Reporting Extension Violations in a Query Range
    Download  cccg.ca
    Design Rule Checking (DRC) in VLSI design involves checking if a given VLSI layout satisfies a given set of rules, and reporting the violations if any. We propose data structures ...
    Ananda Swarup Das, Prosenjit Gupta, Kannan Srinath...
    claim paper
    Read More »
    CCCG
    2009
    100views Computational Geometry» more  CCCG 2009»
    Relaxed Gabriel Graphs
    13 years 6 months ago
    Relaxed Gabriel Graphs
    Download  www.infor.uva.es
    We study a new family of geometric graphs that interpolate between the Delaunay triangulation and the Gabriel graph. These graphs share many properties with skeletons for [0, 1]...
    Prosenjit Bose, Jean Cardinal, Sébastien Co...
    claim paper
    Read More »
    CCCG
    2009
    128views Computational Geometry» more  CCCG 2009»
    On Graph Thickness, Geometric Thickness, and Separator Theorems
    13 years 6 months ago
    On Graph Thickness, Geometric Thickness, and Separator Theorems
    Download  cccg.ca
    We investigate the relationship between geometric thickness and the thickness, outerthickness, and arboricity of graphs. In particular, we prove that all graphs with arboricity tw...
    Christian A. Duncan
    claim paper
    Read More »
    CCCG
    2009
    131views Computational Geometry» more  CCCG 2009»
    Data Structures for Range Aggregation by Categories
    13 years 6 months ago
    Data Structures for Range Aggregation by Categories
    Download  cccg.ca
    We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles...
    Saladi Rahul, Prosenjit Gupta, K. S. Rajan
    claim paper
    Read More »
    CCCG
    2009
    172views Computational Geometry» more  CCCG 2009»
    New Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Lin
    13 years 6 months ago
    New Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Lin
    Download  cccg.ca
    In this paper, we present new algorithms for computing maximum perimeter and maximum area of the convex hull of imprecise inputs based on the parallel line segment model. The runn...
    Wenqi Ju, Jun Luo
    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.