Sciweavers

    CCCG
    2007
    103views Computational Geometry» more  CCCG 2007»
    On the Number of Empty Pseudo-Triangles in Point Sets
    13 years 6 months ago
    On the Number of Empty Pseudo-Triangles in Point Sets
    Download  www.win.tue.nl
    We analyze the minimum and maximum number of empty pseudo-triangles defined by any planar point set. We consider the cases where the three convex vertices are fixed and where th...
    Marc J. van Kreveld, Bettina Speckmann
    claim paper
    Read More »
    CCCG
    2007
    75views Computational Geometry» more  CCCG 2007»
    A Note on Drawing Direction-constrained Paths in 3D
    13 years 6 months ago
    A Note on Drawing Direction-constrained Paths in 3D
    Download  cccg.ca
    We study the problem of drawing a graph-theoretic path where each edge is assigned an axis-parallel direction in 3D. Di Battista et al.[3] gives a combinatorial characterization f...
    Ethan Kim, Sue Whitesides, Giuseppe Liotta
    claim paper
    Read More »
    CCCG
    2007
    94views Computational Geometry» more  CCCG 2007»
    Optimistic and Pessimistic Shortest Paths on Uncertain Terrains
    13 years 6 months ago
    Optimistic and Pessimistic Shortest Paths on Uncertain Terrains
    Download  www.cs.ubc.ca
    Yury Kholondyrev, William Evans
    claim paper
    Read More »
    CCCG
    2007
    80views Computational Geometry» more  CCCG 2007»
    Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment
    13 years 6 months ago
    Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment
    Download  cccg.ca
    Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
    Arindam Karmakar, Sasanka Roy, Sandip Das
    claim paper
    Read More »
    CCCG
    2007
    96views Computational Geometry» more  CCCG 2007»
    Hamilton Circuits in Hexagonal Grid Graphs
    13 years 6 months ago
    Hamilton Circuits in Hexagonal Grid Graphs
    Download  research.cs.queensu.ca
    We look at a variant of the Hamilton circuit problem, where the input is restricted to hexagonal grid graphs. A hexagonal grid graph has a vertex set that is a subset of the grid ...
    Kamrul Islam, Henk Meijer, Yurai Núñ...
    claim paper
    Read More »
    CCCG
    2007
    108views Computational Geometry» more  CCCG 2007»
    Approximation Algorithms for the Minimum-Length Corridor and Related Problems
    13 years 6 months ago
    Approximation Algorithms for the Minimum-Length Corridor and Related Problems
    Download  cccg.ca
    Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...
    Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
    claim paper
    Read More »
    CCCG
    2007
    118views Computational Geometry» more  CCCG 2007»
    Medial Axis Approximation of Planar Shapes from Union of Balls: A Simpler and more Robust Algorithm
    13 years 6 months ago
    Medial Axis Approximation of Planar Shapes from Union of Balls: A Simpler and more Robust Algorithm
    Download  data.agg.ethz.ch
    Given a dense sampling S of the smooth boundary of a planar shape O. We show that the medial axis of the union of Voronoi balls centered at Voronoi vertices inside O has a particu...
    Joachim Giesen, Balint Miklos, Mark Pauly
    claim paper
    Read More »
    CCCG
    2007
    90views Computational Geometry» more  CCCG 2007»
    Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area
    13 years 6 months ago
    Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area
    Download  cccg.ca
    We show an algorithm for constructing O(dn log n) area outerplanar straight-line drawings of n-vertex outerplanar graphs with degree d. Also, we settle in the negative a conjectur...
    Fabrizio Frati
    claim paper
    Read More »
    CCCG
    2007
    131views Computational Geometry» more  CCCG 2007»
    Computing Acute and Non-obtuse Triangulations
    13 years 6 months ago
    Computing Acute and Non-obtuse Triangulations
    Download  cccg.ca
    We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a tr...
    Hale Erten, Alper Üngör
    claim paper
    Read More »
    CCCG
    2007
    91views Computational Geometry» more  CCCG 2007»
    Open Problems from CCCG 2006
    13 years 6 months ago
    Open Problems from CCCG 2006
    Download  erikdemaine.org
    Erik D. Demaine, Joseph O'Rourke
    claim paper
    Read More »
    « first‹ previous…161718192021222324next ›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.