Sciweavers

    CCCG
    2009
    119views Computational Geometry» more  CCCG 2009»
    Streaming 1-Center with Outliers in High Dimensions
    13 years 9 months ago
    Streaming 1-Center with Outliers in High Dimensions
    Download  cccg.ca
    We study the 1-center problem with outliers in highdimensional data streams. The problem definition is as follows: given a sequence of n points in d dimensions (with d arbitrarily...
    Hamid Zarrabi-Zadeh, Asish Mukhopadhyay
    claim paper
    Read More »
    CCCG
    2009
    88views Computational Geometry» more  CCCG 2009»
    On symmetric realizations of the simplicial complex of 3-crossing-free sets of diagonals of the octagon
    13 years 9 months ago
    On symmetric realizations of the simplicial complex of 3-crossing-free sets of diagonals of the octagon
    Download  cccg.ca
    Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
    Jürgen Bokowski, Vincent Pilaud
    claim paper
    Read More »
    CCCG
    2009
    113views Computational Geometry» more  CCCG 2009»
    Wireless Localization with Vertex Guards is NP-hard
    13 years 9 months ago
    Wireless Localization with Vertex Guards is NP-hard
    Download  cccg.ca
    We consider a special class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key with...
    Tobias Christ, Michael Hoffmann
    claim paper
    Read More »
    CCCG
    2009
    113views Computational Geometry» more  CCCG 2009»
    Every Large Point Set contains Many Collinear Points or an Empty Pentagon
    14 years 16 days ago
    Every Large Point Set contains Many Collinear Points or an Empty Pentagon
    Download  cccg.ca
    We prove the following generalised empty pentagon theorem: for every integer 2, every sufficiently large set of points in the plane contains collinear points or an empty pentagon...
    Zachary Abel, Brad Ballinger, Prosenjit Bose, S&ea...
    claim paper
    Read More »
    CCCG
    2009
    114views Computational Geometry» more  CCCG 2009»
    On Directed Graphs with an Upward Straight-line
    14 years 16 days ago
    On Directed Graphs with an Upward Straight-line
    Download  cccg.ca
    In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
    Carla Binucci, Emilio Di Giacomo, Walter Didimo, A...
    claim paper
    Read More »
    CCCG
    2009
    131views Computational Geometry» more  CCCG 2009»
    Data Structures for Range Aggregation by Categories
    14 years 16 days 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
    82views Computational Geometry» more  CCCG 2009»
    How to make a picturesque maze
    14 years 16 days ago
    How to make a picturesque maze
    Download  cccg.ca
    Yoshio Okamoto, Ryuhei Uehara
    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
    14 years 16 days 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 »
    CCCG
    2009
    125views Computational Geometry» more  CCCG 2009»
    Clarkson's Algorithm for Violator Spaces
    14 years 16 days ago
    Clarkson's Algorithm for Violator Spaces
    Download  cccg.ca
    Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
    Yves Brise, Bernd Gärtner
    claim paper
    Read More »
    CCCG
    2009
    96views Computational Geometry» more  CCCG 2009»
    Rigid Components of Random Graphs
    14 years 16 days ago
    Rigid Components of Random Graphs
    Download  cccg.ca
    We study the emergence of rigid components in an Erdos-R
    Louis Theran
    claim paper
    Read More »
    1234next ›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.