The triangulation of a planar domain is an important and largely studied problem in many applications. In the article we present an easy-to-use graphical user interface for interactive construction, visualization and triangulation of two dimensional domains with holes. The construction of the domain is realized through geometric primitives, such as point, arc, circle. The triangulation algorithm is based on polygon offsetting starting from the boundary of the domain. It allows to create high quality triangulations with low computational time, also for complicated geometric regions, as can be seen by comparing with other mesh generators.
An algorithm for planar triangulations. A graphical user interface
EGIDI, Nadaniela;MISICI, Luciano;R. PENNESI;PIERGALLINI, Riccardo
2004-01-01
Abstract
The triangulation of a planar domain is an important and largely studied problem in many applications. In the article we present an easy-to-use graphical user interface for interactive construction, visualization and triangulation of two dimensional domains with holes. The construction of the domain is realized through geometric primitives, such as point, arc, circle. The triangulation algorithm is based on polygon offsetting starting from the boundary of the domain. It allows to create high quality triangulations with low computational time, also for complicated geometric regions, as can be seen by comparing with other mesh generators.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
