Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers

DOI10.1007/BF01758751zbMath0764.68170OpenAlexW2004572455MaRDI QIDQ1187199

S. Singh

Publication date: 28 June 1992

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01758751

zbMATH Keywords

hypercubeconvex hulldominationpoint sets

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Related Items (1)

TIME-OPTIMAL GEOMETRIC ALGORITHMS IN HYPERCUBIC NETWORKS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multidimensional divide-and-conquer
• Parallel computational geometry
• Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
• Efficient parallel convex hull algorithms
• Parallel permutation and sorting algorithms and a new generalized connection network
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• On the Average Number of Maxima in a Set of Vectors and Applications
• Mesh computer algorithms for computational geometry
• [https://portal.mardi4nfdi.de/wiki/Publication:5728818 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten]

This page was built for publication: Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers