Filters

951,218 Hits in 3.1 sec

### Extensible point location algorithm

R. Sundareswara, P. Schrater
2003 International Conference on Geometric Modeling and Graphics, 2003. Proceedings
We present a general walk-through point location algorithm for use with general polyhedron lattices and polygonal meshes assuming the usage of nothing more than a simple linked list as a data structure  ...  The generality of the approach stems from using barycentric coordinates to extract local information about the location of the query point that allows a 'gradient descent'-like walk toward the goal.  ...  We propose a very general decision step that allows extensions of walk-through point location to arbitrary polygonizations.  ...

### On the Tracking of Dynamical Optimal Meeting Points

Elif Eser, Julien Monteil, Andrea Simonetto
2018 IFAC-PapersOnLine
Our algorithms are an extension of existing static algorithms.  ...  Our algorithms are an extension of existing static algorithms.  ...  Our algorithms are an extension of existing static algorithms.  ...

### Study on Automatic Threshold Selection Algorithm of Sensor Images

Yu Liu
2012 Physics Procedia
In the end of this paper, it points out the OTSU Algorithm based on gray extension is a better method for the threshold segmentation.  ...  that for lattice images with large contrast, there is no much difference in the standard deviations of solving mass centers by four algorithms, however, the OTSU Algorithm based on gray extension obtain  ...  mainly from the Bimodal algorithm, the Iterative algorithm, the OTSU Algorithm and the OTSU Algorithm based on gray extension.  ...

### Page 148 of American Society of Civil Engineers. Collected Journals Vol. 9, Issue 2 [page]

1995 American Society of Civil Engineers. Collected Journals
Visibility Algorithm The algorithm determines whether two arbitrarily located points in a given floor plan A(x,, ya) and B(x,, yg) can “see” each other (Fig. 5).  ...  Algorithm 1: Visibility Algorithm Input: Py, the floor plan, P;, P,,..., P,, a group of n floor polygons (n > 0), two points of the plan, A(x,, y,), B(xg, ya). Output: True or False. Algorithm: 1.  ...

### Extension of the Accurate Voltage-Sag Fault Location Method in Electrical Power Distribution Systems

Youssef Menchafou, Mustapha Zahri, Mohamed Habibi, Hassane El Markhi
2016 Journal of Electrical Systems
It is based on the voltage-sag calculation between two measurement points chosen carefully from the available strategic measurement points of the line, network topology and current measurements at substation  ...  In contrast to traditional approaches, an accurate impedance-based Fault Location (FL) method is presented in this paper.  ...  After the study of a new accurate SLG fault location method in EPDS based on voltage-sag calculation between two measurement points and network parameters, this paper presents an extension of the previous  ...

### Cluster By

Chengyang Zhang, Yan Huang
2007 Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems - GIS '07
We also provide a language construct to specify spatial clustering algorithms. The extension is demonstrated with several motivating examples.  ...  The development of areas such as remote and airborne sensing, location based services, and geosensor networks enables the collection of large volumes of spatial data.  ...  However, Group By point locations is almost meaningless given each spatial data point usually has a distinct location. Spatial clustering is a well studied area in data mining.  ...

### Simulation Research of Extension Control Based on Crane-Double Pendulum System

Gang Yang, Weiwei Zhang, Ying Huang, Yongquan Yu
2009 Computer and Information Science
According to the existed structure and algorithm of extension controller, proposed an improved extension control algorithm based on the Optimal Control, which was named LQR-EC, and applied to a SIMO system-Crane-Double  ...  And, using MATLAB simulation platform to study the effect of the LQR-EC Algorithm. The result shows that, the LQR-EC Algorithm not only has a simple theory, but also has rapid response and stability.  ...  So, we adopt the improved extension control algorithm in this measure pattern, named LQR-EC algorithm.  ...

### Capacitated spatial clustering with multiple constraints and attributes [article]

Leena Ruha and Tero Lähderanta and Lauri Lovén and Markku Kuismin and Teemu Leppänen and Jukka Riekki and Mikko J. Sillanpää
2021 arXiv   pre-print
These extensions are relocation and location preference of cluster centers, outliers, and non-spatial attributes. The strength of PACK is that it can consider all of these extensions jointly.  ...  Depending on the application at hand, a wide set of extensions may be necessary in clustering.  ...  Such location-constrained algorithms are referred to as actual point-prototype-based clustering algorithms (Xiao and Yu, 2012) .  ...

### On the Traveling Salesman Problem in Nautical Environments: an Evolutionary Computing Approach to Optimization of Tourist Route Paths in Medulin, Croatia

Sandi Baressi Šegota, Ivan Lorencin, Kazuhiro Ohkura, Zlatan Car
2019 Journal of Maritime & Transportation Science
The results show that evolutionary computing algorithms provide comparable results to an extensive search in a shorter amount of time, with SA providing better results of the two.  ...  The problem is solved using two evolutionary computing methods – the genetic algorithm (GA) and the simulated annealing (SA) - and comparing the results (are compared) by an extensive search of the solution  ...  The distances to all locations were measured from the same point on the coast of each location.  ...

### Time delayed discounted Steiner trees to locate two or more discounted Steiner points

Kashyapa Sirinanda, Marcus Brazil, Peter Grossman, Hyam Rubinstein, Doreen Thomas
2016 ANZIAM Journal
A generalisation of the algorithm to locate more discounted Steiner points is also discussed.  ...  The discounted Steiner point algorithm is extended to locate two Contents C254 junction points where time delays may occur at a discounted Steiner point before constructing the adjacent edges.  ...  Extension of the Discounted Steiner Point Algorithm In this section, the Extension of the Discounted Steiner Point Algorithm (edspa) is proposed to locate two discounted Steiner points for Layout A shown  ...

### Continuous Reverse k-Nearest-Neighbor Query in Dynamic Road Network

Chen Wen
2016 International Journal of Grid and Distributed Computing
Traditional location-based query measures the distance of all data points in various methods, but it is not applicable for the condition in which the weight of all sections in the road network are altered  ...  with temporary network extension tree incrementally.  ...  Introduction With the extensive application of smart mobile device and wireless location technique, the number of users applying location service-based applications increases drastically.  ...

### Bayesian-Based Methods for the Estimation of the Unknown Model's Parameters in the Case of the Localization of the Atmospheric Contamination Source

M. Borysiewicz, A. Wawrzynczak, P. Kopka
2012 Foundations of Computing and Decision Sciences
The results indicate the probability of a source to occur at a particular location with a particular release rate.  ...  The algorithm input data are the on-line arriving information about concentration of given substance registered by distributed sensor network.  ...  As the most effective we pointed the MCMC via Rejuvenation, Modification and Extension algorithm.  ...

### An Online Stream Monitoring Algorithm for Fraud Detection in the Transport of Goods

Paweł M. Białoń, National Institute of Telecommunications, Poland
2020 Journal of Telecommunications and Information Technology
The algorithm detects potential illegal activities along the route between the origin and the destination.  ...  Algorithm designers face a number of challenges, including large number of vehicles monitored, demands related to online calculations, and ability to easily explain fraud alarms triggered to supervisors  ...  Extensions The algorithm is equipped with several extensions.  ...

### Applicability of Genetic and Ant Algorithms in Highway Alignment and Rail Transit Station Location Optimization

Sutapa Samanta, Manoj K. Jha
2012 International Journal of Operations Research and Information Systems
INTRODUCTION In recent years, artificial intelligence (AI)-based optimization heuristics have been extensively applied to solve many transportation location optimization problems.  ...  These heuristics (such as, Genetic Algorithm (GA), Ant Algorithm Applicability of Genetic and Ant Algorithms in Highway Alignment and Rail Transit Station Location Optimization ABSTRACT The emergence  ...

### Continuous location of dimensional structures

J.M. Dı́az-Báñez, J.A. Mesa, A. Schöbel
2004 European Journal of Operational Research
In this way, the location of dimensional structures can be considered as a natural extension of point location.  ...  When the new facilities cannot be represented as points but as some kind of dimensional sets then extensive facility location problems arise.  ...
« Previous Showing results 1 — 15 out of 951,218 results