Number of the records: 1
On the Longest-Edge Bisection Algorithm
- 1.0080698 - MÚ 2007 RIV CZ eng C - Conference Paper (international conference)
Kropáč, Aleš - Křížek, Michal
On the Longest-Edge Bisection Algorithm.
[O algoritmu půlení nejdelší hrany.]
Proceedings of Conference dedicated to the 80th birthday of Professor Ivo Babuška. Praha: Mathematical Institute Academy of Sciences of the Czech Republic, 2006 - (Chleboun, J.; Segeth, K.; Vejchodský, T.), s. 149-155. ISBN 80-85823-54-3.
[International Conference Programs and Algorithms of Numerical Mathematics 13 in honor of Ivo Babuška´s 80th birthday. Praha (CZ), 28.05.2006-31.05.2006]
R&D Projects: GA ČR(CZ) GA201/04/1503
Institutional research plan: CEZ:AV0Z10190503
Keywords : bisection * minimum angle condition * refinement of triangulations
Subject RIV: BA - General Mathematics
We examine the longest-edge bisection algorithm which chooses for bisection the longest edge in a given face-to-face simplicial partition of a bounded polytopic domain.
V článku vyšetřujeme chování algoritmu půlení nejdelší hrany, která se vybírá z konformní simpliciální triangulace omezené polytopické oblasti.
Permanent Link: http://hdl.handle.net/11104/0144800
File Download Size Commentary Version Access Krizek7.pdf 1 221.6 KB Publisher’s postprint open-access
Number of the records: 1