Complexity and modeling aspects of mesh refinement into quadrilaterals

DOI10.1007/s004539910008zbMath0949.68160OpenAlexW2785650282WikidataQ57013343 ScholiaQ57013343MaRDI QIDQ1969949

Rolf H. Möhring, Matthias Müller-Hannemann

Publication date: 5 December 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15649

zbMATH Keywords

mesh refinement problem

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations ⋮ Weighted matching in the semi-streaming model ⋮ Implicit computation of maximum bipartite matchings by sublinear functional operations ⋮ A simple approximation algorithm for the weighted matching problem ⋮ Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation

This page was built for publication: Complexity and modeling aspects of mesh refinement into quadrilaterals