National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 
O algoritmu půlení nejdelší hrany
Kropáč, Aleš ; Křížek, Michal
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.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.