doi.org/10.1007/BF01553881

Preview meta tags from the doi.org website.

Linked Hostnames

21

Thumbnail

Search Engine Appearance

Google

https://doi.org/10.1007/BF01553881

Constrained delaunay triangulations - Algorithmica

Given a set ofn vertices in the plane together with a set of noncrossing, straight-line edges, theconstrained Delaunay triangulation (CDT) is the triangula



Bing

Constrained delaunay triangulations - Algorithmica

https://doi.org/10.1007/BF01553881

Given a set ofn vertices in the plane together with a set of noncrossing, straight-line edges, theconstrained Delaunay triangulation (CDT) is the triangula



DuckDuckGo

https://doi.org/10.1007/BF01553881

Constrained delaunay triangulations - Algorithmica

Given a set ofn vertices in the plane together with a set of noncrossing, straight-line edges, theconstrained Delaunay triangulation (CDT) is the triangula

  • General Meta Tags

    75
    • title
      Constrained delaunay triangulations | Algorithmica
    • charset
      UTF-8
    • X-UA-Compatible
      IE=edge
    • applicable-device
      pc,mobile
    • viewport
      width=device-width, initial-scale=1
  • Open Graph Meta Tags

    6
    • og:url
      https://link.springer.com/article/10.1007/BF01553881
    • og:type
      article
    • og:site_name
      SpringerLink
    • og:title
      Constrained delaunay triangulations - Algorithmica
    • og:description
      Given a set ofn vertices in the plane together with a set of noncrossing, straight-line edges, theconstrained Delaunay triangulation (CDT) is the triangulation of the vertices with the following properties: (1) the prespecified edges are included in the triangulation, and (2) it is as close as possible to the Delaunay triangulation. We show that the CDT can be built in optimalO(n logn) time using a divide-and-conquer technique. This matches the time required to build an arbitrary (unconstrained) Delaunay triangulation and the time required to build an arbitrary constrained (non-Delaunay) triagulation. CDTs, because of their relationship with Delaunay triangulations, have a number of properties that make them useful for the finite-element method. Applications also include motion planning in the presence of polygonal obstacles and constrained Euclidean minimum spanning trees, spanning trees subject to the restriction that some edges are prespecified.
  • Twitter Meta Tags

    6
    • twitter:site
      @SpringerLink
    • twitter:card
      summary_large_image
    • twitter:image:alt
      Content cover image
    • twitter:title
      Constrained delaunay triangulations
    • twitter:description
      Algorithmica - Given a set ofn vertices in the plane together with a set of noncrossing, straight-line edges, theconstrained Delaunay triangulation (CDT) is the triangulation of the vertices with...
  • Item Prop Meta Tags

    3
    • position
      1
    • position
      2
    • position
      3
  • Link Tags

    9
    • apple-touch-icon
      /oscar-static/img/favicons/darwin/apple-touch-icon-6ef0829b9c.png
    • canonical
      https://link.springer.com/article/10.1007/BF01553881
    • icon
      /oscar-static/img/favicons/darwin/android-chrome-192x192.png
    • icon
      /oscar-static/img/favicons/darwin/favicon-32x32.png
    • icon
      /oscar-static/img/favicons/darwin/favicon-16x16.png

Links

71