Sciweavers

    CCCG
    2009
    115views Computational Geometry» more  CCCG 2009»
    Data Structures for Reporting Extension Violations in a Query Range
    14 years 17 days 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
    112views Computational Geometry» more  CCCG 2009»
    Optimal Empty Pseudo-Triangles in a Point Set
    14 years 17 days ago
    Optimal Empty Pseudo-Triangles in a Point Set
    Download  www.postech.ac.kr
    Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
    Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher
    claim paper
    Read More »
    CCCG
    2009
    119views Computational Geometry» more  CCCG 2009»
    On the Height of a Homotopy
    14 years 17 days ago
    On the Height of a Homotopy
    Download  mathcs.slu.edu
    Given 2 homotopic curves in a topological space, there are several ways to measure similarity between the curves, including Hausdorff distance and Fr
    Erin W. Chambers, David Letscher
    claim paper
    Read More »
    CCCG
    2009
    126views Computational Geometry» more  CCCG 2009»
    Enumeration of Polyominoes for p4 Tiling
    14 years 17 days ago
    Enumeration of Polyominoes for p4 Tiling
    Download  cccg.ca
    Polyominoes are the two dimensional shapes made by connecting n unit squares, joined along their edges. In this paper, we propose algorithms to enumerate polyominoes for p4 tiling...
    Takashi Horiyama, Masato Samejima
    claim paper
    Read More »
    CCCG
    2009
    88views Computational Geometry» more  CCCG 2009»
    Inapproximability of the Perimeter Defense Problem
    14 years 17 days ago
    Inapproximability of the Perimeter Defense Problem
    Download  users.encs.concordia.ca
    We model the problem of detecting intruders using a set of infrared beams by the perimeter defense problem: given a polygon P, find a minimum set of edges S of the polygon such th...
    Evangelos Kranakis, Danny Krizanc, Lata Narayanan,...
    claim paper
    Read More »
    CCCG
    2009
    92views Computational Geometry» more  CCCG 2009»
    Open Problems from CCCG 2008
    14 years 17 days ago
    Open Problems from CCCG 2008
    Download  cccg.ca
    Erik D. Demaine, Joseph O'Rourke
    claim paper
    Read More »
    CCCG
    2009
    119views Computational Geometry» more  CCCG 2009»
    The Bichromatic Rectangle Problem in High Dimensions
    14 years 17 days ago
    The Bichromatic Rectangle Problem in High Dimensions
    Download  cccg.ca
    Given a set of blue points and a set of red points in ddimensional space, we show how to find an axis-aligned hyperrectangle that contains no red points and as many blue points as...
    Jonathan Backer, J. Mark Keil
    claim paper
    Read More »
    CCCG
    2009
    70views Computational Geometry» more  CCCG 2009»
    General minisum circle location
    14 years 17 days ago
    General minisum circle location
    Download  cccg.ca
    -extended abstractMark K
    Mark Körner, Jack Brimberg, Henrik Juel, Anit...
    claim paper
    Read More »
    CCCG
    2009
    132views Computational Geometry» more  CCCG 2009»
    Colored Simultaneous Geometric Embeddings and Universal Pointsets
    14 years 17 days ago
    Colored Simultaneous Geometric Embeddings and Universal Pointsets
    Download  www.cs.arizona.edu
    A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
    Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
    claim paper
    Read More »
    CCCG
    2009
    85views Computational Geometry» more  CCCG 2009»
    Planar Packing of Diameter-Four Trees
    14 years 17 days ago
    Planar Packing of Diameter-Four Trees
    Download  cccg.ca
    We prove that, for every two n-node non-star trees of diameter at most four, there exists an n-node planar graph containing them as edge-disjoint subgraphs.
    Fabrizio Frati
    claim paper
    Read More »
    « first‹ previous1234next ›last »
    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.