scientific article; zbMATH DE number 140463
From MaRDI portal
Publication:4028879
zbMATH Open0794.68061MaRDI QIDQ4028879FDOQ4028879
Authors: Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri 
Publication date: 28 March 1993
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 278832
- Finding a closet visible vertex pair between two polygons
- Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
- PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
- An optimal algorithm for finding the separation of simple polygons
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Parallel algorithms in computer science (68W10)
Cited In (9)
- Computing the shortest diagonal of a monotone polygon in linear time
- An optimal algorithm for finding the separation of simple polygons
- Finding a closet visible vertex pair between two polygons
- PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
- Title not available (Why is that?)
- Computing the longest diagonal of a simple polygon
- Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
- Subtraction of two 2D polygons with some matching vertices
- Optimal time bounds for some proximity problems in the plane
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028879)
