Finding a closet visible vertex pair between two polygons
From MaRDI portal
Publication:1899450
DOI10.1007/BF01293668zbMath0833.68057OpenAlexW2006059657MaRDI QIDQ1899450
Publication date: 9 October 1995
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01293668
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
- Parallel algorithms for fractional and maximal independent sets in planar graphs
- Finding the minimum vertex distance between two disjoint convex polygons in linear time
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- Geometric applications of a matrix-searching algorithm
- A sweepline algorithm for Voronoi diagrams
- Parallel algorithms for some functions of two convex polygons
- Parallel computational geometry
- Triangulating a simple polygon in linear time
- Constructing the Voronoi diagram of a set of line segments in parallel
- Triangulating a simple polygon
- A unifying approach for a class of problems in the computational geometry of polygons
- Optimal shortest path queries in a simple polygon
- An addendum to parallel methods for visibility and shortest-path problems in simple polygons
- A new linear convex hull algorithm for simple polygons (Corresp.)
- Efficient parallel convex hull algorithms
- PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
- DETERMINING THE SEPARATION OF SIMPLE POLYGONS
- Triangulating a polygon in parallel
- Matrix searching with the shortest path metric
This page was built for publication: Finding a closet visible vertex pair between two polygons
