The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The integration of efficient supply technologies like electric heat pumps and combined-heat-and-power (CHP) plants into multi-energy-systems is of growing interest. However, typical off-the-shelf systems like CHP units and industrial heat pumps are characterized as single-degree-of-freedom systems, which means the interaction between electric and thermal power input/output is well-defined and cannot...
This In the paper we propose optimal algorithm for area triangulation between m arbitrary polygons on the plane with time complexity O(NlogN). The efficiency of the algorithm is achieved by reducing the problem to the triangulation of simple polygons with holes. A simple polygon with holes we triangulate using the monotone chains method. It allows getting a simple implementation.
Man's tryst with mapping neural activity of the brain has been around since the last couple of decades. From MRI, fMRI to EEGs and then finally to MEG, it has been quite a long road. In our study we have used the last most rapidly advancing neural imaging technique (Magnetoencephalography) and have applied its result onto computational geometry for generating an anatomically and physiologically feasible...
Procedural layout generation is common practice in digital, analog or RF circuit layout design. Designers generate mask designs by specifying only the key parameters of devices, digital or analog blocks and have algorithms construct the complete layout. But automated layout design is limited to Manhattan structures (orthogonal shapes) or to devices with 45° angles (typically octagonal inductors)....
Any data based method is vulnerable to the problem of extrapolation, nonetheless there exists no unified theory on handling it. The main topic of this publication is to point out the differences in definitions of extrapolation and related methods. There are many different interpretations of extrapolation and a multitude of methods and algorithms, which address the problem of extrapolation detection...
Shapes extraction methods for getting two or more characters in convex hull or approximate convex hull are proposed in this paper. Proposed approaches use Genetic Algorithm (GA) with a improved local search or new local search method, which can get some characters as a shrink-wrapping from convex hull or approximate convex hull. The test problems are newly provided, which are made of the original...
The development of automated measurement systems for monitoring basic functional geometries arises as a response to the increasing automation of manufacture. The paper describes the optimization of the grid increment to be used in the algorithm established by the authors to automatically recognize 3D geometries. Differential geometry was used to determine Gaussian and mean local curvatures of surfaces...
Good quality meshes are extensively used for finding approximate solutions for partial differential equations for fluid flow in two dimensional surfaces. We present an overview of existing algorithms for refinement and generation of triangular meshes. We introduce the concept of node stability in the refinement of Delaunay triangulation. We present an algorithm based on the location of center of gravity...
It is important that our vital networks (e.g., infrastructures) are robust to more than single-link failures. Failures might for instance affect a part of the network that resides in a certain geographical region. In this paper, considering networks embedded in a two-dimensional plane, we study the problem of finding a critical region — that is, a part of the network that can be enclosed by a given...
Automating chromosome classification and segmentation has been a major challenge in automated karyotyping especially due to overlapping chromosomes. The earlier reported methods for disentangling the chromosome overlaps have limited success as they are sensitive to scale variations, computationally complex, use only color information in case of multispectral imaging and most of them are limited to...
This research deals with the two-dimensional 0–1 knapsack problem considering items of irregular shape. In this version of the problem the items correspond to convex and non-convex polygons, while the knapsack has rectangular shape. We proposed a hybrid heuristic that combines GRASP and Simulated Annealing: begins with an initial solution and, thus, explores its neighborhood using a local search procedure...
In this paper, we propose a very efficient novel parametric model to describe the surface and structure of the human tongue and a corresponding mathematical model for performing 3D tongue animation. A skeletal chain of virtual bones is automatically generated depending on the geometric features of the 3D object, allowing each tongue segment to be easily manipulated by its corresponding parameters,...
The shape reconstruction problem is one of important and most applied problems in many branches of computer science. In this paper a new method is introduced which a graph as output and work on boundary samples as input, in the plan. The proposed method starts reconstruction from the random polygon production on input points and by calculating the Euclidean distance between points, it produces a set...
A semiautomatic management of traffic scenes displays a large diversity of mobile data arising from usual Computer Vision techniques. The mobile nature of inputs requires the combination of different techniques for filtering, tracking, and clustering features along a video sequence. These problems are considerably harder in presence of low visibility conditions arising from rain, fog or dazzling conditions...
We considered the grid generation problem of computation of a grid over a given domain from the knowledge of the domain boundary. A simple grid generation method based on the direct computing of grid curves was proposed. The grid curves wer constructed in u-direction and v-direction by two formulas with the shape parameters, seperately. By choosing different shape parameters, different grid curves...
The currently known point pattern matching algorithms generally performs poorly when the two point patterns to be matched are not isomorphic. To improve the matching performance of the point pattern matching methods for non-isomorphic point patterns, a novel and robust inexact point pattern matching algorithm that combines with the invariant feature and probabilistic relaxation labelling is proposed...
In the dome display environment, it is known that three-dimensional scene can be represented utilizing the effects of geometrical perspective and motion parallax effectively without using the stereo glasses. However, the creation of contents for the dome display is not easy, because it needs omni-directional images. In this study, we propose the layer based method to create the dome contents easily...
This work introduces techniques to facilitate large-scale Augmented Reality (AR) experiences in unprepared outdoor environments. We develop a shape-based object detection framework that works with limited texture and can robustly handle extreme illumination and occlusion issues. The contribution of this work is a purely geometric approach for detecting marker-like objects under difficult and realistic...
The goal of this study is to develop a new procedure for the integration of computer aided design and analysis (ICADA) using absolute nodal coordinate formulation (ANCF). Bezier, B-spline and NURBS are widely used as geometric description in CAD system. A new computer procedure is introduced for the integration of geometric description and the ANCF finite element analysis. The procedure is based on...
A novel two-stage algorithm for constructing the orthogonal concavity tree (OCT) of a digital object is proposed. In Stage I, it derives the minimum-area orthogonal cover of the object. In Stage II, it constructs the orthogonal hull from the ortho-cover, and while doing so, extracts the orthogonal concavities in an iterative manner. Nested concavities, if any, are obtained by considering each concavity...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.