[[abstract]]In this paper, we discuss the problem of finding all the regions, which are congruent to a testing region, in a planar figure. Aparallelalgorithm is developed to find all of these regions. This algorithm takes O(n2) computation time and needs O(m) processors where n and m are the numbers of edges of the input planar figure and the testing region respectively.[[fileno]]2030256010085[[department]]資訊工程學
In computer vision and image processing, image segmentation remains a relevant research area that co...
In this paper we give a fast randomized algorithm for finding a partition of the plane induced by a ...
A representation for polygons and polygonal lines is described which allows sets of consecutive side...
[[abstract]]In this paper, we discuss the problem of finding all the regions, which are congruent to...
[[abstract]]In this paper, we describe a systolic algorithm for extracting all of the fundamental re...
[[abstract]]In this paper, we describe a systolic algorithm for extracting all of the fundamental re...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
We show that testing reachability in a planar DAG can be performed in parallel in O(log n log tim...
This paper describes several parallel algorithms that solve geometric problems. The algorithms are b...
AbstractA direct, simple and general parallel algorithm is described for the preprocessing of a plan...
In this paper, we describe a systolic algorithm for extracting all of the fundamental regions in a p...
SIGLEAvailable from British Library Document Supply Centre- DSC:9106.17(CUED/F-INFENG/TR--228) / BLD...
There has recently been an interest in the introduction of reconfigurable buses to existing parallel...
AbstractWe describe a parallel algorithm for testing a graph for planarity, and for finding an embed...
In computer vision and image processing, image segmentation remains a relevant research area that co...
In computer vision and image processing, image segmentation remains a relevant research area that co...
In this paper we give a fast randomized algorithm for finding a partition of the plane induced by a ...
A representation for polygons and polygonal lines is described which allows sets of consecutive side...
[[abstract]]In this paper, we discuss the problem of finding all the regions, which are congruent to...
[[abstract]]In this paper, we describe a systolic algorithm for extracting all of the fundamental re...
[[abstract]]In this paper, we describe a systolic algorithm for extracting all of the fundamental re...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
We show that testing reachability in a planar DAG can be performed in parallel in O(log n log tim...
This paper describes several parallel algorithms that solve geometric problems. The algorithms are b...
AbstractA direct, simple and general parallel algorithm is described for the preprocessing of a plan...
In this paper, we describe a systolic algorithm for extracting all of the fundamental regions in a p...
SIGLEAvailable from British Library Document Supply Centre- DSC:9106.17(CUED/F-INFENG/TR--228) / BLD...
There has recently been an interest in the introduction of reconfigurable buses to existing parallel...
AbstractWe describe a parallel algorithm for testing a graph for planarity, and for finding an embed...
In computer vision and image processing, image segmentation remains a relevant research area that co...
In computer vision and image processing, image segmentation remains a relevant research area that co...
In this paper we give a fast randomized algorithm for finding a partition of the plane induced by a ...
A representation for polygons and polygonal lines is described which allows sets of consecutive side...
DOI
Add to ORKG