doi.org/10.1007/BF01553881
Preview meta tags from the doi.org website.
Linked Hostnames
21- 18 links todoi.org
- 15 links tolink.springer.com
- 10 links towww.springernature.com
- 5 links toscholar.google.com
- 3 links towww.ams.org
- 3 links towww.emis.de
- 2 links tocitation-needed.springer.com
- 2 links tosupport.springernature.com
Thumbnail
Search Engine Appearance
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
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- titleConstrained delaunay triangulations | Algorithmica
- charsetUTF-8
- X-UA-CompatibleIE=edge
- applicable-devicepc,mobile
- viewportwidth=device-width, initial-scale=1
Open Graph Meta Tags
6- og:urlhttps://link.springer.com/article/10.1007/BF01553881
- og:typearticle
- og:site_nameSpringerLink
- og:titleConstrained delaunay triangulations - Algorithmica
- og:descriptionGiven 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:cardsummary_large_image
- twitter:image:altContent cover image
- twitter:titleConstrained delaunay triangulations
- twitter:descriptionAlgorithmica - 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- position1
- position2
- position3
Link Tags
9- apple-touch-icon/oscar-static/img/favicons/darwin/apple-touch-icon-6ef0829b9c.png
- canonicalhttps://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- http://scholar.google.com/scholar_lookup?&title=A%20Sweepline%20algorithm%20for%20Voronoi%20diagrams&journal=Algorithmica&doi=10.1007%2FBF01840357&volume=2&pages=153-174&publication_year=1987&author=Fortune%2CS.
- http://scholar.google.com/scholar_lookup?&title=Computational%20Geometry&publication_year=1985&author=Preparata%2CF.%20P.&author=Shamos%2CM.%20I.
- http://scholar.google.com/scholar_lookup?&title=Delaunay-based%20representation%20of%20surfaces%20defined%20over%20arbitrarily%20shaped%20domains&journal=Computer%20Vision%2C%20Graphics%2C%20and%20Image%20Processing&doi=10.1016%2F0734-189X%2885%2990005-2&volume=32&pages=127-140&publication_year=1985&author=Floriani%2CL.&author=Falcidieno%2CB.&author=Pienovi%2CC.
- http://scholar.google.com/scholar_lookup?&title=Generalized%20Delaunay%20triangulation%20for%20planar%20graphs&journal=Discrete%20and%20Computational%20Geometry&doi=10.1007%2FBF02187695&volume=1&pages=201-217&publication_year=1986&author=Lee%2CD.%20T.&author=Lin%2CA.%20K.
- http://scholar.google.com/scholar_lookup?&title=Two%20algorithms%20for%20constructing%20Delaunay%20triangulations&journal=International%20Journal%20of%20Computer%20and%20Information%20Sciences&doi=10.1007%2FBF00977785&volume=9&pages=219-242&publication_year=1980&author=Lee%2CD.%20T.&author=Schachter%2CB.