Optimal algorithms to embed trees in a point set

1996 ◽  
pp. 64-75 ◽  
Author(s):  
Prosenjit Bose ◽  
Michael McAllister ◽  
Jack Snoeyink
Keyword(s):  
Optimal Algorithms ◽  
Point Set

scholarly journals Optimal Algorithms to Embed Trees in a Point Set

1997 ◽  
Vol 1 (2) ◽  
pp. 1-15 ◽  
Author(s):  
P. Bose ◽  
M. McAllister ◽  
J. Snoeyink
Keyword(s):  
Optimal Algorithms ◽  
Point Set

Optimal Algorithms to Embed Trees in a Point Set

2002 ◽  
pp. 29-43
Author(s):  
Prosenjit Bose ◽  
Michael McAllister ◽  
Jack Snoeyink
Keyword(s):  
Optimal Algorithms ◽  
Point Set

Computational Micrograph Registration with Sieve Processes

1996 ◽  
Vol 54 ◽  
pp. 440-441
Author(s):  
P.J. Phillips ◽  
J. Huang ◽  
S. M. Dunn
Keyword(s):  
Planar Graph ◽  
Efficient Algorithm ◽  
Spatial Organization ◽  
Spatial Arrangement ◽  
Stereo Image ◽  
Image Model ◽  
Geometric Invariants ◽  
Point Set

In this paper we present an efficient algorithm for automatically finding the correspondence between pairs of stereo micrographs, the key step in forming a stereo image. The computation burden in this problem is solving for the optimal mapping and transformation between the two micrographs. In this paper, we present a sieve algorithm for efficiently estimating the transformation and correspondence.In a sieve algorithm, a sequence of stages gradually reduce the number of transformations and correspondences that need to be examined, i.e., the analogy of sieving through the set of mappings with gradually finer meshes until the answer is found. The set of sieves is derived from an image model, here a planar graph that encodes the spatial organization of the features. In the sieve algorithm, the graph represents the spatial arrangement of objects in the image. The algorithm for finding the correspondence restricts its attention to the graph, with the correspondence being found by a combination of graph matchings, point set matching and geometric invariants.

Almost empty polygons

2003 ◽  
Vol 40 (3) ◽  
pp. 269-286 ◽  
Author(s):  
H. Nyklová
Keyword(s):  
Exact Results ◽  
Point Sets ◽  
Planar Point ◽  
Convex Position ◽  
Vertex Set ◽  
Point Set ◽  
Empty Polygons

In this paper we study a problem related to the classical Erdos--Szekeres Theorem on finding points in convex position in planar point sets. We study for which n and k there exists a number h(n,k) such that in every planar point set X of size h(n,k) or larger, no three points on a line, we can find n points forming a vertex set of a convex n-gon with at most k points of X in its interior. Recall that h(n,0) does not exist for n = 7 by a result of Horton. In this paper we prove the following results. First, using Horton's construction with no empty 7-gon we obtain that h(n,k) does not exist for k = 2(n+6)/4-n-3. Then we give some exact results for convex hexagons: every point set containing a convex hexagon contains a convex hexagon with at most seven points inside it, and any such set of at least 19 points contains a convex hexagon with at most five points inside it.

Modified K-means clustering algorithm based on good point set and Leader method

2011 ◽  
Vol 31 (5) ◽  
pp. 1359-1362
Author(s):  
Yan-ping ZHANG ◽  
Juan ZHANG ◽  
Cheng-gang HE ◽  
Wei-cui CHU ◽  
Li-na ZHANG
Keyword(s):  
Clustering Algorithm ◽  
Good Point ◽  
Point Set ◽  
Good Point Set
Sign in / Sign up

Export Citation Format

Share Document