17
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Generalized delaunay triangulation for planar graphs

      ,
      Discrete & Computational Geometry
      Springer Nature

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references21

          • Record: found
          • Abstract: not found
          • Article: not found

          An efficient algorith for determining the convex hull of a finite planar set

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            On the Angle Condition in the Finite Element Method

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Optimal Search in Planar Subdivisions

                Bookmark

                Author and article information

                Journal
                Discrete & Computational Geometry
                Discrete Comput Geom
                Springer Nature
                0179-5376
                1432-0444
                September 1986
                September 1986
                : 1
                : 3
                : 201-217
                Article
                10.1007/BF02187695
                f560365d-a4ce-432e-9d0f-7cf3661843e7
                © 1986
                History

                Comments

                Comment on this article