Geometric Data Structures on a Reconfigurable Mesh, with Applications

Authors:
Amitava Datta
Affiliations:
-
Venue:
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Year:
1997

Citing 6
Cited 1

Computational geometry: an introduction

Computational geometry: an introduction
Finding tailored partitions

Journal of Algorithms
Polymorphic Processor Arrays

IEEE Transactions on Parallel and Distributed Systems
An Optimal Algorithm for the Angle-Restricted All Nearest Neighbor Problem on the Reconfigurable

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Computational Geometry on a Reconflgurable Mesh

Proceedings of the 8th International Symposium on Parallel Processing
A simple Voronoi diagram algorithm for a reconfigurable mesh

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing

SPIDA: Abstracting and generalizing layout design cases

Artificial Intelligence for Engineering Design, Analysis and Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present several geometric data structures and algorithms for problems for a planar set of rectangles and bipartitioning problems for a point set in two dimensions on a reconfigurable mesh of size n\times n. The problems for rectangles include computing the measure, contour, perimeter and maximum clique for the union of a set of rectangles. The bipartitioning problems for a two dimensional point set are solved in the L_\infty and L_1 metrics. We solve all these problems in O(\log n) time.