Original title: On the Longest-Edge Bisection Algorithm
Translated title: O algoritmu půlení nejdelší hrany
Authors: Kropáč, Aleš ; Křížek, Michal
Document type: Papers
Conference/Event: International Conference Programs and Algorithms of Numerical Mathematics 13 in honor of Ivo Babuška´s 80th birthday, Praha (CZ), 2006-05-28 / 2006-05-31
Year: 2006
Language: eng
Abstract: [eng] [cze]
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.
Keywords: bisection; minimum angle condition; refinement of triangulations
Project no.: CEZ:AV0Z10190503 (CEP), GA201/04/1503 (CEP)
Funding provider: GA ČR
Host item entry: Proceedings of Conference dedicated to the 80th birthday of Professor Ivo Babuška, ISBN 80-85823-54-3

Institution: Institute of Mathematics AS ČR (web)
Document availability information: Fulltext is available in the digital repository of the Academy of Sciences.
Original record: http://hdl.handle.net/11104/0144800

Permalink: http://www.nusl.cz/ntk/nusl-36900


The record appears in these collections:
Research > Institutes ASCR > Institute of Mathematics
Conference materials > Papers