Optimal parallel algorithms for rectilinear link-distance problems
DOI10.1007/BF01206332zbMATH Open0831.68108OpenAlexW2043144539WikidataQ62037495 ScholiaQ62037495MaRDI QIDQ1897477FDOQ1897477
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)
Cites Work
- Computing the visibility polygon from a convex set and related problems
- Triangulating a simple polygon in linear time
- Title not available (Why is that?)
- An Efficient Parallel Biconnectivity Algorithm
- A linear time algorithm for minimum link paths inside a simple polygon
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
- On rectilinear link distance
- Computing geodesic furthest neighbors in simple polygons
- Computing the link center of a simple polygon
- Title not available (Why is that?)
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
- Title not available (Why is that?)
- Rectilinear shortest paths in the presence of rectangular barriers
- Optimal parallel algorithms for rectilinear link-distance problems
- An addendum to parallel methods for visibility and shortest-path problems in simple polygons
- Matching parentheses in parallel
- -Algorithms for Minimum Link Path and Related Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- MANHATTONIAN PROXIMITY IN A SIMPLE POLYGON
Cited In (16)
- -Algorithms for Minimum Link Path and Related Problems
- Systolic algorithms for rectilinear polygons
- Accelerated parallel projection method for solving the shortest distance problem
- Title not available (Why is that?)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains
- PARALLEL COMPUTATION OF INTERNAL AND EXTERNAL FARTHEST NEIGHBORS IN SIMPLE POLYGONS
- An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions
- An optimal algorithm for the rectilinear link center of a rectilinear polygon
- Title not available (Why is that?)
- Optimal parallel algorithms for rectilinear link-distance problems
- Optimal parallel algorithms for point-set and polygon problems
- An O(n log n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT
- Parallel Optimal Weighted Links
- Computing the L 1-diameter and center of a simple rectilinear polygon in parallel
- Title not available (Why is that?)
- Parallel algorithms for all minimum link paths and link center 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)
