Sciweavers

    CCCG
    2006
    87views Computational Geometry» more  CCCG 2006»
    Tight Bounds for Point Recolouring
    14 years 26 days ago
    Tight Bounds for Point Recolouring
    Download  research.cs.queensu.ca
    In their paper on delineating boundaries from geographic data, Reinbacher et al. [9] use a recolouring method to reclassify points so that the boundaries that separate points of d...
    Yurai Núñez Rodríguez, David ...
    claim paper
    Read More »
    CCCG
    2006
    96views Computational Geometry» more  CCCG 2006»
    On Planar Path Transformation
    14 years 26 days ago
    On Planar Path Transformation
    Download  research.cs.queensu.ca
    A flip or edge-replacement is considered as a transformation by which one edge e of a geometric object is removed and an edge f (f = e) is inserted such that the resulting object ...
    Kamrul Islam, Selim G. Akl, Henk Meijer
    claim paper
    Read More »
    CCCG
    2006
    126views Computational Geometry» more  CCCG 2006»
    An Optimal Solution to Room Search Problem
    14 years 26 days ago
    An Optimal Solution to Room Search Problem
    Download  www.cs.sfu.ca
    A room is a simple polygon with a prespecified point, called the door, on its boundary. A search starts at the door and must detect any intruder that may be in the room, while maki...
    Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Sh...
    claim paper
    Read More »
    CCCG
    2006
    108views Computational Geometry» more  CCCG 2006»
    (Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
    14 years 26 days ago
    (Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
    Download  research.cs.queensu.ca
    For a given point set in Euclidean space we consider the problem of finding (approximate) nearest neighbors of a query point but restricting only to points that lie within a fixed...
    Stefan Funke, Theocharis Malamatos, Domagoj Matije...
    claim paper
    Read More »
    CCCG
    2006
    116views Computational Geometry» more  CCCG 2006»
    Geometric Separator for d-Dimensional Ball Graphs
    14 years 26 days ago
    Geometric Separator for d-Dimensional Ball Graphs
    Download  research.cs.queensu.ca
    We study the graph partitioning problem on ddimensional ball graphs in a geometric way. Let B be a set of balls in d-dimensional Euclidean space with radius ratio and -precision....
    Kebin Wang, Shang-Hua Teng
    claim paper
    Read More »
    CCCG
    2006
    90views Computational Geometry» more  CCCG 2006»
    Predicates for Line Transversals in 3D
    14 years 26 days ago
    Predicates for Line Transversals in 3D
    Download  research.cs.queensu.ca
    In this paper we study various predicates concerning line transversals to lines and segments in 3D. We compute the degrees of standard methods of evaluating these predicates. The ...
    Hazel Everett, Sylvain Lazard, William J. Lenhart,...
    claim paper
    Read More »
    CCCG
    2006
    92views Computational Geometry» more  CCCG 2006»
    Minimizing the Number of Arcs Linking a Permutation of Points in the Plane
    14 years 26 days ago
    Minimizing the Number of Arcs Linking a Permutation of Points in the Plane
    Download  www.cs.mcgill.ca
    Stephane Durocher, Chris Gray, James A. King
    claim paper
    Read More »
    CCCG
    2006
    114views Computational Geometry» more  CCCG 2006»
    On the Smallest Enclosing Information Disk
    14 years 26 days ago
    On the Smallest Enclosing Information Disk
    Download  www.informationgeometry.org
    We present a generalization of Welzl's smallest enclosing disk algorithm [E. Welzl, Smallest enclosing disks (balls and ellipsoids), in: New Results and New Trends in Compute...
    Frank Nielsen, Richard Nock
    claim paper
    Read More »
    CCCG
    2006
    127views Computational Geometry» more  CCCG 2006»
    Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts
    14 years 26 days ago
    Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts
    Download  www.cs.duke.edu
    In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the o...
    R. Sharathkumar, Prosenjit Gupta
    claim paper
    Read More »
    CCCG
    2006
    136views Computational Geometry» more  CCCG 2006»
    On Computing Shortest External Watchman Routes for Convex Polygons
    14 years 26 days ago
    On Computing Shortest External Watchman Routes for Convex Polygons
    Download  research.cs.queensu.ca
    We study the relationship between the interior angles of a convex polygon and the lengths of external watchman routes.
    Rafa Absar, Sue Whitesides
    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.