Sciweavers

    CCCG
    2006
    116views Computational Geometry» more  CCCG 2006»
    Geometric Separator for d-Dimensional Ball Graphs
    13 years 6 months 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
    13 years 6 months 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
    13 years 6 months 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
    13 years 6 months 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
    13 years 6 months 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
    13 years 6 months 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 »
    CCCG
    2006
    118views Computational Geometry» more  CCCG 2006»
    Characterization of Polygons Searchable by a Boundary 1-Searcher
    13 years 6 months ago
    Characterization of Polygons Searchable by a Boundary 1-Searcher
    Download  www.cs.sfu.ca
    Suppose intruders are in a dark polygonal room and they can move at a finite but unbounded speed, trying to avoid detection. A boundary 1-searcher can move along the polygon bounda...
    Tsunehiko Kameda, John Z. Zhang, Masafumi Yamashit...
    claim paper
    Read More »
    CCCG
    2006
    96views Computational Geometry» more  CCCG 2006»
    On Bipartite Matching under the RMS Distance
    13 years 6 months ago
    On Bipartite Matching under the RMS Distance
    Download  www.cs.duke.edu
    Given two sets A and B of n points each in R2 , we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. W...
    Jeff M. Phillips, Pankaj K. Agarwal
    claim paper
    Read More »
    CCCG
    2006
    70views Computational Geometry» more  CCCG 2006»
    Polygons Flip Finitely: Flaws and a Fix
    13 years 6 months ago
    Polygons Flip Finitely: Flaws and a Fix
    Download  maven.smith.edu
    Every simple planar polygon can undergo only a finite number of pocket flips before becoming convex. Since Erdos posed this as an open problem in 1935, several independent purport...
    Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, ...
    claim paper
    Read More »
    CCCG
    2006
    92views Computational Geometry» more  CCCG 2006»
    Polygon Reconstruction from Line Cross-Sections
    13 years 6 months ago
    Polygon Reconstruction from Line Cross-Sections
    Download  www.cs.technion.ac.il
    We study the following geometric probing problem: Reconstruct a planar polygon from its intersections with a collection of arbitrarily-oriented "cutting" lines. We propo...
    Gill Barequet, Craig Gotsman, Avishay Sidlesky
    claim paper
    Read More »
    « first‹ previous…111213141516171819…next ›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.