Point set triangulation

Results: 23



#Item
1Edge Insertion for Optimal Triangulations1 M. Bern2 , H. Edelsbrunner3 , D. Eppstein4 , S. Mitchell5 and T. S. Tan3 Abstract The edge-insertion paradigm improves a triangulation of a nite point set in <2 iteratively by

Edge Insertion for Optimal Triangulations1 M. Bern2 , H. Edelsbrunner3 , D. Eppstein4 , S. Mitchell5 and T. S. Tan3 Abstract The edge-insertion paradigm improves a triangulation of a nite point set in <2 iteratively by

Add to Reading List

Source URL: www.comp.nus.edu.sg

- Date: 2003-07-20 23:05:10
    2Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation Martin Fink, Jan-Henrik Haunert, Joachim Spoerhase, and Alexander Wolff (a) a point set with four clusters at two different aspect ratios

    Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation Martin Fink, Jan-Henrik Haunert, Joachim Spoerhase, and Alexander Wolff (a) a point set with four clusters at two different aspect ratios

    Add to Reading List

    Source URL: www1.pub.informatik.uni-wuerzburg.de

    - Date: 2013-08-08 08:48:44
      3This template contains a style sheet followed by Cartography and Geographic Information Science (CaGIS)

      This template contains a style sheet followed by Cartography and Geographic Information Science (CaGIS)

      Add to Reading List

      Source URL: www.cartogis.org

      Language: English - Date: 2012-11-06 14:47:53
      4A WEAK CHARACTERISATION OF THE DELAUNAY TRIANGULATION VIN DE SILVA Abstract. We consider a new construction, the weak Delaunay triangulation of a finite point set in a metric space, which contains as a subcomplex the tra

      A WEAK CHARACTERISATION OF THE DELAUNAY TRIANGULATION VIN DE SILVA Abstract. We consider a new construction, the weak Delaunay triangulation of a finite point set in a metric space, which contains as a subcomplex the tra

      Add to Reading List

      Source URL: pages.pomona.edu

      Language: English
        5CCCG 2006, Kingston, Ontario, August 14–16, 2006 Tight Bounds for Point Recolouring Yurai N´ un ˜ez and David Rappaport

        CCCG 2006, Kingston, Ontario, August 14–16, 2006 Tight Bounds for Point Recolouring Yurai N´ un ˜ez and David Rappaport

        Add to Reading List

        Source URL: cccg.ca

        Language: English - Date: 2008-10-27 22:57:44
        6CCCG 2009, Vancouver, BC, August 17–19, 2009 Optimal Empty Pseudo-Triangles in a Point Set∗ Hee-Kap Ahn† Sang Won Bae†

        CCCG 2009, Vancouver, BC, August 17–19, 2009 Optimal Empty Pseudo-Triangles in a Point Set∗ Hee-Kap Ahn† Sang Won Bae†

        Add to Reading List

        Source URL: cccg.ca

        Language: English - Date: 2009-09-02 14:18:59
        7CCCG 2007, Ottawa, Ontario, August 20–22, 2007 On the Number of Empty Pseudo-Triangles in Point Sets Marc van Kreveld∗ Abstract

        CCCG 2007, Ottawa, Ontario, August 20–22, 2007 On the Number of Empty Pseudo-Triangles in Point Sets Marc van Kreveld∗ Abstract

        Add to Reading List

        Source URL: cccg.ca

        Language: English - Date: 2008-10-28 21:24:19
        8CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 A Constant-Factor Approximation for Maximum Weight Triangulation Shiyan Hu∗

        CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 A Constant-Factor Approximation for Maximum Weight Triangulation Shiyan Hu∗

        Add to Reading List

        Source URL: www.cccg.ca

        Language: English - Date: 2004-01-08 18:44:37
        9New results on Pseudo-triangulations with low vertex degree Andr´e Schulz∗ constrained pseudo-triangulations this question is NPcomplete. Even though for every point set there exists a pseudotriangulations with degree

        New results on Pseudo-triangulations with low vertex degree Andr´e Schulz∗ constrained pseudo-triangulations this question is NPcomplete. Even though for every point set there exists a pseudotriangulations with degree

        Add to Reading List

        Source URL: www.cccg.ca

        Language: English - Date: 2005-07-31 13:56:02
        10An Algorithm for the Construction of Intrinsic Delaunay Triangulations with Applications to Digital Geometry Processing Matthew Fisher Caltech Boris Springborn

        An Algorithm for the Construction of Intrinsic Delaunay Triangulations with Applications to Digital Geometry Processing Matthew Fisher Caltech Boris Springborn

        Add to Reading List

        Source URL: multires.caltech.edu

        Language: English - Date: 2007-05-29 16:37:55