Finding a closet visible vertex pair between two polygons

DOI10.1007/BF01293668MaRDI QIDQ1899450zbMATH OpenOpenAlexFDO

Authors Nancy M. Amato

Publication date 9 October 1995

Published in Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

CREW PRAMvisible vertex distance

Mathematics Subject Classification ID

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

Recommendations

• PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
• scientific article; zbMATH DE number 278832
• scientific article; zbMATH DE number 140463
• DETERMINING THE SEPARATION OF SIMPLE POLYGONS

Cites work

• A new linear convex hull algorithm for simple polygons (Corresp.)
• A sweepline algorithm for Voronoi diagrams
• A unifying approach for a class of problems in the computational geometry of polygons
• An addendum to parallel methods for visibility and shortest-path problems in simple polygons
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
• Constructing the Voronoi diagram of a set of line segments in parallel
• DETERMINING THE SEPARATION OF SIMPLE POLYGONS
• Efficient parallel convex hull algorithms
• Finding the minimum vertex distance between two disjoint convex polygons in linear time
• Geometric applications of a matrix-searching algorithm
• scientific article; zbMATH DE number 432842 (Why is no real title available?)
• scientific article; zbMATH DE number 140463 (Why is no real title available?)
• scientific article; zbMATH DE number 177829 (Why is no real title available?)
• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• Matrix searching with the shortest path metric
• Optimal shortest path queries in a simple polygon
• PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
• Parallel algorithms for fractional and maximal independent sets in planar graphs
• Parallel algorithms for some functions of two convex polygons
• Parallel computational geometry
• Triangulating a polygon in parallel
• Triangulating a simple polygon
• Triangulating a simple polygon in linear time

Cited in

(4)

• PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
• scientific article; zbMATH DE number 140463 (Why is no real title available?)
• DETERMINING THE SEPARATION OF SIMPLE POLYGONS
• Determining Weak Visibility of a Polygon from an Edge in Parallel

This page was built for publication: Finding a closet visible vertex pair between two polygons

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