File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Delaunay triangulation of non-convex planar domains

TitleDelaunay triangulation of non-convex planar domains
Authors
Issue Date1989
PublisherJohn Wiley & Sons Ltd. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/1430
Citation
International Journal For Numerical Methods In Engineering, 1989, v. 28 n. 11, p. 2695-2707 How to Cite?
AbstractThis paper investigates the possibility of integrating the two currently most popular mesh generation techniques, namely the method of advancing front and the Delaunay triangulation algorithm. The merits of the resulting scheme are its simplicity, efficiency and versatility. With the introduction of 'non-Delaunay' line segments, the concept of using Delaunay triangulation as a means of mesh generation is clarified. An efficient algorithm is proposed for the construction of Delaunay triangulations over non-convex planar domains. Interior nodes are first generated within the planar domain. These interior nodes and the boundary nodes are then linked up together to produce a valid triangulation. Through the study of numerous examples of various characteristics, it is found that high-quality triangular element meshes are obtained by the proposed algorithm, and the mesh generation time bears a linear relationship with the number of elements/nodes of the triangulation.
Persistent Identifierhttp://hdl.handle.net/10722/149924
ISSN
2015 Impact Factor: 2.1
2015 SCImago Journal Rankings: 2.007

 

DC FieldValueLanguage
dc.contributor.authorLo, SHen_US
dc.date.accessioned2012-06-26T06:00:35Z-
dc.date.available2012-06-26T06:00:35Z-
dc.date.issued1989en_US
dc.identifier.citationInternational Journal For Numerical Methods In Engineering, 1989, v. 28 n. 11, p. 2695-2707en_US
dc.identifier.issn0029-5981en_US
dc.identifier.urihttp://hdl.handle.net/10722/149924-
dc.description.abstractThis paper investigates the possibility of integrating the two currently most popular mesh generation techniques, namely the method of advancing front and the Delaunay triangulation algorithm. The merits of the resulting scheme are its simplicity, efficiency and versatility. With the introduction of 'non-Delaunay' line segments, the concept of using Delaunay triangulation as a means of mesh generation is clarified. An efficient algorithm is proposed for the construction of Delaunay triangulations over non-convex planar domains. Interior nodes are first generated within the planar domain. These interior nodes and the boundary nodes are then linked up together to produce a valid triangulation. Through the study of numerous examples of various characteristics, it is found that high-quality triangular element meshes are obtained by the proposed algorithm, and the mesh generation time bears a linear relationship with the number of elements/nodes of the triangulation.en_US
dc.languageengen_US
dc.publisherJohn Wiley & Sons Ltd. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/1430en_US
dc.relation.ispartofInternational Journal for Numerical Methods in Engineeringen_US
dc.titleDelaunay triangulation of non-convex planar domainsen_US
dc.typeArticleen_US
dc.identifier.emailLo, SH:hreclsh@hkucc.hku.hken_US
dc.identifier.authorityLo, SH=rp00223en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0024767430en_US
dc.identifier.volume28en_US
dc.identifier.issue11en_US
dc.identifier.spage2695en_US
dc.identifier.epage2707en_US
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridLo, SH=7401542444en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats