Optimal parallel algorithms for rectilinear link-distance problems

DOI10.1007/BF01206332MaRDI QIDQ1897477zbMATHOpenAlexWikidataFDO

Authors Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack

Publication date 27 August 1995

Published in Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

parallel random access machinelink-distance problemsoptimal parallel solutions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Recommendations

• Parallel algorithms for all minimum link paths and link center problems
• On rectilinear link distance
• -Algorithms for Minimum Link Path and Related Problems
• An optimal algorithm for the rectilinear link center of a rectilinear polygon
• Parallel rectilinear shortest paths with rectangular obstacles

Cites work

• scientific article; zbMATH DE number 176583 (Why is no real title available?)
• scientific article; zbMATH DE number 177553 (Why is no real title available?)
• scientific article; zbMATH DE number 512835 (Why is no real title available?)
• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• scientific article; zbMATH DE number 742973 (Why is no real title available?)
• -Algorithms for Minimum Link Path and Related Problems
• A linear time algorithm for minimum link paths inside a simple polygon
• An Efficient Parallel Biconnectivity Algorithm
• An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
• An addendum to parallel methods for visibility and shortest-path problems in simple polygons
• Computing geodesic furthest neighbors in simple polygons
• Computing the link center of a simple polygon
• Computing the visibility polygon from a convex set and related problems
• MANHATTONIAN PROXIMITY IN A SIMPLE POLYGON
• Matching parentheses in parallel
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• On rectilinear link distance
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• Optimal parallel algorithms for rectilinear link-distance problems
• Rectilinear shortest paths in the presence of rectangular barriers
• Triangulating a simple polygon in linear time

Cited in

(15)

• scientific article; zbMATH DE number 177553 (Why is no real title available?)
• Optimal parallel algorithms for point-set and polygon problems
• Accelerated parallel projection method for solving the shortest distance problem
• An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions
• An O(n log n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT
• -Algorithms for Minimum Link Path and Related Problems
• An optimal algorithm for the rectilinear link center of a rectilinear polygon
• scientific article; zbMATH DE number 2090688 (Why is no real title available?)
• Parallel Optimal Weighted Links
• Parallel algorithms for all minimum link paths and link center problems
• Computing the L 1-diameter and center of a simple rectilinear polygon in parallel
• Systolic algorithms for rectilinear polygons
• PARALLEL COMPUTATION OF INTERNAL AND EXTERNAL FARTHEST NEIGHBORS IN SIMPLE POLYGONS
• scientific article; zbMATH DE number 1729273 (Why is no real title available?)
• Optimal parallel algorithms for rectilinear link-distance problems

This page was built for publication: Optimal parallel algorithms for rectilinear link-distance problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897477)