Sciweavers

    CCCG
    2006
    86views Computational Geometry» more  CCCG 2006»
    Optimal Polygon Placement
    14 years 26 days ago
    Optimal Polygon Placement
    Download  cccg.ca
    Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
    Prosenjit Bose, Jason Morrison
    claim paper
    Read More »
    CCCG
    2006
    113views Computational Geometry» more  CCCG 2006»
    Small Weak Epsilon-Nets in Three Dimensions
    14 years 26 days ago
    Small Weak Epsilon-Nets in Three Dimensions
    Download  research.cs.queensu.ca
    We study the problem of finding small weak -nets in three dimensions and provide new upper and lower bounds on the value of for which a weak -net of a given small constant size e...
    Maryam Babazadeh, Hamid Zarrabi-Zadeh
    claim paper
    Read More »
    CCCG
    2006
    95views Computational Geometry» more  CCCG 2006»
    Shortest Descending Paths through Given Faces
    14 years 26 days ago
    Shortest Descending Paths through Given Faces
    Download  research.cs.queensu.ca
    A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
    Mustaq Ahmed, Anna Lubiw
    claim paper
    Read More »
    CCCG
    2006
    127views Computational Geometry» more  CCCG 2006»
    Another Paradigm for Geometric Constraints Solving
    14 years 26 days ago
    Another Paradigm for Geometric Constraints Solving
    Download  research.cs.queensu.ca
    Geometric constraints solving often relies on graphbased methods to decompose systems of geometric constraints. These methods have intrinsic and unavoidable limitations which are ...
    Dominique Michelucci, Sebti Foufou, Loïc Lama...
    claim paper
    Read More »
    CCCG
    2006
    94views Computational Geometry» more  CCCG 2006»
    Rotationally Monotone Polygons
    14 years 26 days ago
    Rotationally Monotone Polygons
    Download  people.scs.carleton.ca
    We introduce a generalization of monotonicity. An n-vertex polygon P is rotationally monotone with respect to a point r if there exists a partitioning of the boundary of P into ex...
    Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Ste...
    claim paper
    Read More »
    CCCG
    2006
    97views Computational Geometry» more  CCCG 2006»
    An Improved Approximation Factor For The Unit Disk Covering Problem
    14 years 26 days ago
    An Improved Approximation Factor For The Unit Disk Covering Problem
    Download  research.cs.queensu.ca
    We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...
    Sada Narayanappa, Petr Vojtechovský
    claim paper
    Read More »
    CCCG
    2006
    87views Computational Geometry» more  CCCG 2006»
    Hamiltonian Cycles in Triangular Grids
    14 years 26 days ago
    Hamiltonian Cycles in Triangular Grids
    Download  www.ams.sunysb.edu
    We study the Hamiltonian Cycle problem in graphs induced by subsets of the vertices of the tiling of the plane with equilateral triangles. By analogy with grid graphs we call such...
    Valentin Polishchuk, Esther M. Arkin, Joseph S. B....
    claim paper
    Read More »
    CCCG
    2006
    87views Computational Geometry» more  CCCG 2006»
    K-Nearest Neighbor Search using the Pyramid Technique
    14 years 26 days ago
    K-Nearest Neighbor Search using the Pyramid Technique
    Download  research.cs.queensu.ca
    A k-nearest neighbor search algorithm for the Pyramid technique is presented. The Pyramid technique divides d-dimensional data space into 2d pyramids. Given a query point q, we in...
    Bradford G. Nickerson, Qingxiu Shi
    claim paper
    Read More »
    CCCG
    2006
    137views Computational Geometry» more  CCCG 2006»
    An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points
    14 years 26 days ago
    An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points
    Download  cccg.ca
    In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
    Asish Mukhopadhyay, Robert L. Scot Drysdale
    claim paper
    Read More »
    CCCG
    2006
    102views Computational Geometry» more  CCCG 2006»
    Local Overlaps In Special Unfoldings Of Convex Polyhedra
    14 years 26 days ago
    Local Overlaps In Special Unfoldings Of Convex Polyhedra
    Download  research.cs.queensu.ca
    We define a notion of local overlaps in polyhedron unfoldings. We use this concept to construct convex polyhedra for which certain classes of edge unfoldings contain overlaps, the...
    Brendan Lucier
    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.