4   Artículos

 
en línea
Costas Panagiotakis    
In this paper, we present a general version of polygonal fitting problem called Unconstrained Polygonal Fitting (UPF). Our goal is to represent a given 2D shape S with an N-vertex polygonal curve P with a known number of vertices, so that the Intersectio... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Pamuda Pudjisuryadi     Pág. pp. 99 - 108
A meshless local Petrov-Galerkin (MLPG) method that employs polygonal sub-domains constructed from several triangular patches rather than the typically used circular sub-domains is presented. Moving least-squares approximation is used to construct the tr... ver más
Revista: Civil Engineering Dimension    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »