|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
Xian Wen Sim, Sie Long Kek, Sy Yi Sim, Jiao Li
Pág. 150 - 161
|
|
|
|
|
|
|
|
|
Fakhar Uddin, Naveed Riaz, Abdul Manan, Imran Mahmood, Oh-Young Song, Arif Jamal Malik and Aaqif Afzaal Abbasi
The travelling salesman problem (TSP) is perhaps the most researched problem in the field of Computer Science and Operations. It is a known NP-hard problem and has significant practical applications in a variety of areas, such as logistics, planning, and...
ver más
|
|
|
|
|
|
|
|
|
Anna Okhitina, Stepan Tkachev and Dmitry Roldugin
This paper considers a construction procedure of a satellite reference angular motion in the vicinity of an unstable gravitational equilibrium position. The satellite is stabilized on the reference trajectory by the magnetic coils. The problem is solved ...
ver más
|
|
|
|
|
|
|
|
|
Alexander Robitzsch
This article reviews several implementation aspects in estimating regularized single-group and multiple-group structural equation models (SEM). It is demonstrated that approximate estimation approaches that rely on a differentiable approximation of non-d...
ver más
|
|
|
|