Triangulation

Results: 842



#Item
1Triangulation Numbers Caspar and Klug found that only some arrangements of subunits can form quasisymmetrical capsids. To explain this, they developed the concept

Triangulation Numbers Caspar and Klug found that only some arrangements of subunits can form quasisymmetrical capsids. To explain this, they developed the concept

Add to Reading List

Source URL: cdn.rcsb.org

- Date: 2016-07-22 10:16:33
    2CONSTRUCTING REGULAR TRIANGULATION VIA LOCAL TRANSFORMATIONS: THEORETICAL AND PRACTICAL ADVANCES MINGCEN GAO

    CONSTRUCTING REGULAR TRIANGULATION VIA LOCAL TRANSFORMATIONS: THEORETICAL AND PRACTICAL ADVANCES MINGCEN GAO

    Add to Reading List

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

    - Date: 2015-04-07 09:21:46
      3AN O(n2 log n) TIME ALGORITHM FOR THE MINMAX ANGLE TRIANGULATION HERBERT EDELSBRUNNERy , TIOW SENG TANy AND ROMAN WAUPOTITSCHy Abstract. We show that a triangulation of a set of n points in the plane that minimizes the m

      AN O(n2 log n) TIME ALGORITHM FOR THE MINMAX ANGLE TRIANGULATION HERBERT EDELSBRUNNERy , TIOW SENG TANy AND ROMAN WAUPOTITSCHy Abstract. We show that a triangulation of a set of n points in the plane that minimizes the m

      Add to Reading List

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

      - Date: 2003-07-20 23:05:10
        4Edge 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
          5A QUADRATIC TIME ALGORITHM FOR THE MINMAX LENGTH TRIANGULATION HERBERT EDELSBRUNNER AND TIOW SENG TANy Abstract. We show that a triangulation of a set of n points in the plane that minimizes the maximum edge length can b

          A QUADRATIC TIME ALGORITHM FOR THE MINMAX LENGTH TRIANGULATION HERBERT EDELSBRUNNER AND TIOW SENG TANy Abstract. We show that a triangulation of a set of n points in the plane that minimizes the maximum edge length can b

          Add to Reading List

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

          - Date: 2003-07-20 23:05:10
            6Triangulation + 0 refines Triangulation + 1 refines (8) 1

            Triangulation + 0 refines Triangulation + 1 refines (8) 1

            Add to Reading List

            Source URL: pgfplots.sourceforge.net

            - Date: 2012-04-06 09:51:30
              7Tan, Tiow-Seng Optimal Triangulation Problems This paper surveys some recent solutions to triangulation problems in 2D plane and surface. In particular, it focuses on three ecient and practical schemes in computing opt

              Tan, Tiow-Seng Optimal Triangulation Problems This paper surveys some recent solutions to triangulation problems in 2D plane and surface. In particular, it focuses on three ecient and practical schemes in computing opt

              Add to Reading List

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

              - Date: 2003-07-20 23:05:10
                8A GPU accelerated algorithm for 3D Delaunay triangulation

                A GPU accelerated algorithm for 3D Delaunay triangulation

                Add to Reading List

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

                - Date: 2014-08-06 05:10:52
                  9Improving machine translation via triangulation and transliteration

                  Improving machine translation via triangulation and transliteration

                  Add to Reading List

                  Source URL: www.mt-archive.info

                  - Date: 2014-07-30 05:49:26
                    10Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation among all Delaunay

                    Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation among all Delaunay

                    Add to Reading List

                    Source URL: heim.ifi.uio.no

                    - Date: 2007-06-14 10:35:59