Search results for "Polygon"
showing 10 items of 282 documents
3d mesh denoising using normal based myriad filter
2011
We propose a new filtering scheme for denoising of 3D objects which are represented by a triangular mesh. This scheme consists on applying myriad filter to face normals and then updating the vertices positions in order to preserve the original shape of the object. The choice of the Myriad is justified by the assumption of Cauchy distributed angles between surface normals. This filter improves the performance of a normal-based method which is adapted to the underlying mesh structure. To evaluate these methods of filtering, we use three error metrics. The first is based on the vertices, the second is based on the normals and the third is based on Hausdorff distance. Experimental results demon…
Third-order accurate monotone cubic Hermite interpolants
2019
Abstract Monotonicity-preserving interpolants are used in several applications as engineering or computer aided design. In last years some new techniques have been developed. In particular, in Arandiga (2013) some new methods to design monotone cubic Hermite interpolants for uniform and non-uniform grids are presented and analyzed. They consist on calculating the derivative values introducing the weighted harmonic mean and a non-linear variation. With these changes, the methods obtained are third-order accurate, except in extreme situations. In this paper, a new general mean is used and a third-order interpolant for all cases is gained. We perform several experiments comparing the known tec…
A nonlinear algorithm for monotone piecewise bicubic interpolation
2016
We present an algorithm for monotone interpolation on a rectangular mesh.We use the sufficient conditions for monotonicity of Carlton and Fritsch.We use nonlinear techniques to approximate the partial derivatives at the grid points.We develop piecewise bicubic Hermite interpolants with these approximations.We present some numerical examples where we compare different results. In this paper we present an algorithm for monotone interpolation of monotone data on a rectangular mesh by piecewise bicubic functions. Carlton and Fritsch (1985) develop conditions on the Hermite derivatives that are sufficient for such a function to be monotone. Here we extend our results of Arandiga (2013) to obtain…
Higher genera Catalan numbers and Hirota equations for extended nonlinear Schrödinger hierarchy
2021
We consider the Dubrovin--Frobenius manifold of rank $2$ whose genus expansion at a special point controls the enumeration of a higher genera generalization of the Catalan numbers, or, equivalently, the enumeration of maps on surfaces, ribbon graphs, Grothendieck's dessins d'enfants, strictly monotone Hurwitz numbers, or lattice points in the moduli spaces of curves. Liu, Zhang, and Zhou conjectured that the full partition function of this Dubrovin--Frobenius manifold is a tau-function of the extended nonlinear Schr\"odinger hierarchy, an extension of a particular rational reduction of the Kadomtsev--Petviashvili hierarchy. We prove a version of their conjecture specializing the Givental--M…
Integrated prototyping and rendering system for the display of ceramic finds
2017
The project, carried out in collaboration between the Department of Architecture of Palermo and the Archaeological Museum Antonino Salinas of Palermo, proposes a system of integration and reconstruction of ceramic artefacts, using modeling, 3D printing and rendering processes for an integrated museum exhibition system, which the viewers can observe the fragment nearing the re-reconstructed fragment that reconstructs the original morphology and an interactive digital model in which the viewers can also observe the metric aspect and, where present, the decorative apparatus.
Efficiency in constrained continuous location
1998
Abstract We present a geometrical characterization of the efficient, weakly efficient and strictly efficient points for multi-objective location problems in presence of convex constraints and when distances are measured by an arbitrary norm. These results, established for a compact set of demand points, generalize similar characterizations previously obtained for uncontrained problems. They are used to show that, in planar problems, the set of constrained weakly efficient points always coincides with the closest projection of the set of unconstrained weakly efficient points onto the feasible set. This projection property which are known previously only for strictly convex norms, allows to e…
SimuRed: A flit-level event-driven simulator for multicomputer network performance evaluation
2009
The interconnection network is one of the most important multicomputer components, since it has a great impact on global system performance. Many models and simulators have been proposed to evaluate network performance. This paper presents SimuRed, an event-driven flit-level, cycle-accurate simulator to evaluate different orthogonal network configurations. The core of the simulator has been designed to be expandable and portable to different situations. Some of the advantages of this simulator over other similar tools are its visual interface, its fast execution and its simplicity. Moreover, it is multiplatform and its source code versions (C++ and Java) are freely available under GNU open-…
Some supplementary results on the 1+ $$\sqrt 2 $$ order method for the solution of nonlinear equations
1982
Recently an iterative method for the solution of systems of nonlinear equations having at leastR-order 1+ $$\sqrt 2 $$ for simple roots has been investigated by the author [7]; this method uses as many function evaluations per step as the classical Newton method. In the present note we deal with several properties of the method such as monotone convergence, asymptotic inclusion of the solution and convergence in the case of multiple roots.
A backward sweep method for power flow solution in distribution networks
2010
Abstract A methodology for the analysis of radial or weakly meshed distribution systems supplying voltage dependent loads is here developed. The solution process is iterative and, at each step, loads are simulated by means of impedances. Therefore, at each iteration, it is necessary to solve a network made up only of impedances; for this kind of network, all the voltages and currents can be expressed as linear functions of a single unknown current (in radial systems) or of two unknown currents for each independent mesh (for meshed systems). The methodology has been called “backward” since the unique equation, in case of radial network, and the linear system of equations, in case of meshed n…
Distributed learning automata for solving a classification task
2016
In this paper, we propose a novel classifier in two-dimensional feature spaces based on the theory of Learning Automata (LA). The essence of our scheme is to search for a separator in the feature space by imposing a LA based random walk in a grid system. To each node in the gird we attach an LA, whose actions are the choice of the edges forming the separator. The walk is self-enclosing, i.e, a new random walk is started whenever the walker returns to starting node forming a closed classification path yielding a many edged polygon. In our approach, the different LA attached at the different nodes search for a polygon that best encircles and separates each class. Based on the obtained polygon…