Wyniki wyszukiwania - BazTech

1

Ear-slicing and quality triangulation

Kajak B., Gewali L., Selvaraj H.

Systems Science

|

2010

|

Vol. 36, no 4

105-109

EN

Most algorithms for polygon triangulation do not consider the quality of generated triangles. We present two approaches for modifying the ear-cutting triangulation algorithm so that the resulting mesh contains higher proportion of quality triangles. The first approach is based on searching for the best triangle by scanning the boundary. The second approach uses "stabbing diagonals" to partition the polygon onto components which can then be separately triangulated to increase the number of quality triangles.

2

Recognizing Sharp Features of 2-D Shapes

Gewali L., Scanlan J. P.

International Journal of Electronics and Telecommunications

|

2010

|

Vol. 56, No. 2

153-156

EN

We present an efficient algorithm for recognizing and extracting sharp-features from complex polygonal shapes. The algorithm executes in O(n²) time, where n is the number of vertices in the polygon. Sharp-feature extraction algorithms can be useful as a pre-processing step for measuring shape-similarity between polygonal shapes.

3

Free regions of sensor nodes

Gewali L., Rongatana N., Selvaraj H., Pedersen J. B.

Systems Science

|

2009

|

Vol. 35, no 2

67-72

EN

We introduce the notion of free region of a node in a sensor network. Intuitively, a free region of a node is the connected set of points R in its neighborhood such that the connectivity of the network remains the same when the node is moved to any point in R. We characterize several properties of free regions and develop an efficient algorithm for computing them. We capture free region in terms of related notions called in-free region and out-free region. We present an O(n2) algorithm for constructing the free region of a node, where n is the number of nodes in the network.

4

CG-guided signature of polygons

Gewali L., Jain H.

Systems Science

|

2009

|

Vol. 35, no 2

89-93

EN

The notion of signature has been useful in measuring similarity between polygonal shapes. The standard signatures of all convex polygons are identical and equal to a constant function. We propose a variation of the standard signature called cg-guided signature which is capable of distinguishing different convex shapes.

5

A fast and simple algorithm for computing m-shortest paths in stage graph

Sherwood M., Gewali L., Selvaraj H., Muthukumar V.

Systems Science

|

2004

|

Vol. 30, no 1

91-97

EN

We consider the problem of computing m shortest paths between a source node s and a target node t in a stage graph. Polynomial time algorithms known to solve this problem use complicated data structures. This paper proposes a very simple algorithm for computing all m shortest paths in a stage graph efficiently. The proposed algorithm does not use any complicated data structure and can be implemented in a straightforward way by using only array data structure. This problem appears as a sub-problem for planning risk reduced multiple k-legged trajectories for aerial vehicles.