Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Terminal-edges Delaunay (small-angle based) algorithm for the quality triangulation problem
Autore:
Rivara, MC; Hitschfeld, N; Simpson, B;
Indirizzi:
Univ Chile, Dept Comp Sci, Santiago, Chile Univ Chile Santiago ChileUniv Chile, Dept Comp Sci, Santiago, Chile Univ Waterloo, Dept Comp Sci, Waterloo, ON N2L 3G1, Canada Univ Waterloo Waterloo ON Canada N2L 3G1 ci, Waterloo, ON N2L 3G1, Canada
Titolo Testata:
COMPUTER-AIDED DESIGN
fascicolo: 3, volume: 33, anno: 2001,
pagine: 263 - 277
SICI:
0010-4485(200103)33:3<263:TD(BAF>2.0.ZU;2-Y
Fonte:
ISI
Lingua:
ENG
Soggetto:
REFINEMENT ALGORITHM; MULTIGRID TECHNIQUES;
Keywords:
optimal quality triangulation; Delaunay meshes; longest-edge based algorithms;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
--discip_EC--
Citazioni:
23
Recensione:
Indirizzi per estratti:
Indirizzo: Rivara, MC Univ Chile, Dept Comp Sci, Casilla 2777, Santiago, Chile Univ Chile Casilla 2777 Santiago Chile 2777, Santiago, Chile
Citazione:
M.C. Rivara et al., "Terminal-edges Delaunay (small-angle based) algorithm for the quality triangulation problem", COMPUT AID, 33(3), 2001, pp. 263-277

Abstract

The terminal-edge Delaunay algorithm, initially called Lepp-Delaunay algorithm, deals with the construction of size-optimal (adapted to the geometry)quality triangulation of complex objects. In two dimensions, the algorithmcan be formulated in terms of the Delaunay insertion of both midpoints of terminal edges (the common longest-edge of a pair of Delaunay triangles) and midpoints of boundary related edges in the current mesh. For the processing of a small angled triangle in the current mesh, the terminal-edge is found as the final longest-edge of the finite chain of triangles that neighboron a longest edge - the longest edge propagating path of the small angled triangle. Three boundary-related point insertion operations, which prevent nonconvergence behavior, are discussed in detail. The triangle improvement properties of the point insertion operations are used to prove that optimal-size triangulations, with smallest-angle greater than or equal to 30 degrees are always produced. (C) 2001 Elsevier Science Ltd. All rights reserved.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 10/07/20 alle ore 12:31:06