Sciweavers

    99 search results - page 2 / 20
    » On empty convex polygons in a planar point set
    Sort
    View
    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
    13 years 6 months 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 »
    SIGACT
    2008
    103views more  SIGACT 2008»
    Computational geometry column 50
    13 years 5 months ago
    Computational geometry column 50
    Download  maven.smith.edu
    Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
    Joseph O'Rourke
    claim paper
    Read More »
    CCCG
    2008
    85views Computational Geometry» more  CCCG 2008»
    Recognition of Largest Empty Orthoconvex Polygon in a Point Set
    13 years 6 months ago
    Recognition of Largest Empty Orthoconvex Polygon in a Point Set
    Download  cccg.ca
    An algorithm for computing the maximum area empty isothetic orthoconvex polygon among a set of n points in a rectangular region, is presented. The worst case time and space comple...
    Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab...
    claim paper
    Read More »
    CCCG
    2009
    112views Computational Geometry» more  CCCG 2009»
    Optimal Empty Pseudo-Triangles in a Point Set
    13 years 6 months ago
    Optimal Empty Pseudo-Triangles in a Point Set
    Download  www.postech.ac.kr
    Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
    Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher
    claim paper
    Read More »
    COMGEO
    2006
    ACM
    103views Applied Computing» more  COMGEO 2006»
    Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
    13 years 5 months ago
    Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
    Download  tclab.kaist.ac.kr
    Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hye...
    claim paper
    Read More »
    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.