Area and perimeter computation of the union of a set of iso-rectangles in parallel

DOI10.1006/jpdc.1995.1076zbMath0835.68059OpenAlexW2095525703MaRDI QIDQ1898218

Mohan S. Kankanhalli, William Randolph Franklin

Publication date: 16 April 1996

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1995.1076

zbMATH Keywords

VLSI designuniform gridvertex neighborhood technique

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Distributed algorithms (68W15)

Related Items (1)

Exact Fast Parallel Intersection of Large 3-D Triangular Meshes

This page was built for publication: Area and perimeter computation of the union of a set of iso-rectangles in parallel