Transforming triangulations in polygonal domains

DOI10.1016/0167-8396(93)90029-3zbMath0806.65152OpenAlexW1990052191WikidataQ126582415 ScholiaQ126582415MaRDI QIDQ1315799

Ifat Goren, N. Richter-Dyn, Samuel Rippa

Publication date: 9 February 1995

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8396(93)90029-3

zbMATH Keywords

algorithmfinite element methodstriangulationstransformationpolygonal domaincomputational geometryscattered data interpolation

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (7)

A proof of the orbit conjecture for flipping edge-labelled triangulations ⋮ Flip paths between lattice triangulations ⋮ Flip distance between two triangulations of a point set is NP-complete ⋮ Computing optimal triangulations using simulated annealing ⋮ All triangulations are reachable via sequences of edge-flips: an elementary proof ⋮ Data-dependent triangulations for scattered data interpolation and finite element approximation ⋮ Scattered data interpolation using minimum energy Powell-Sabin elements and data dependent triangulations

Cites Work

• Finite element mesh generation methods: A review and classification
• Transforming triangulations
• Data Dependent Triangulations for Piecewise Linear Interpolation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Transforming triangulations in polygonal domains