Finding a closet visible vertex pair between two polygons
type: Item
instance of: scholarly article
title: Finding a closet visible vertex pair between two polygons
zbMATH Open document ID: 0833.68057
DOI: 10.1007/BF01293668
published in: Algorithmica
publication date: 1995-10-09T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 803782
zbMATH Keywords: visible vertex distance
zbMATH Keywords: CREW PRAM
author: Nancy M. Amato
MaRDI profile type: Publication
cites work: Q4038707
cites work: Finding the minimum vertex distance between two disjoint convex polygons in linear time
cites work: An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
cites work: A unifying approach for a class of problems in the computational geometry of polygons
cites work: Q4028879
cites work: Matrix searching with the shortest path metric
cites work: PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
cites work: Q4385522
cites work: Parallel algorithms for some functions of two convex polygons
cites work: DETERMINING THE SEPARATION OF SIMPLE POLYGONS
cites work: A sweepline algorithm for Voronoi diagrams
cites work: An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
cites work: Parallel algorithms for fractional and maximal independent sets in planar graphs
cites work: Constructing the Voronoi diagram of a set of line segments in parallel
cites work: An addendum to parallel methods for visibility and shortest-path problems in simple polygons
cites work: Triangulating a polygon in parallel
cites work: Optimal shortest path queries in a simple polygon
cites work: Triangulating a simple polygon in linear time
cites work: Q3138976
cites work: Parallel computational geometry
cites work: Efficient parallel convex hull algorithms
cites work: A new linear convex hull algorithm for simple polygons (Corresp.)
cites work: Triangulating a simple polygon
cites work: Geometric applications of a matrix-searching algorithm
full work available at URL: https://doi.org/10.1007/bf01293668
OpenAlex ID: W2006059657
description: scientific article; zbMATH DE number 803782