Finding a closet visible vertex pair between two polygons (Q1899450): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q735497
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Nancy M. Amato / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the minimum vertex distance between two disjoint convex polygons in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying approach for a class of problems in the computational geometry of polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix searching with the shortest path metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for some functions of two convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: DETERMINING THE SEPARATION OF SIMPLE POLYGONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sweepline algorithm for Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for fractional and maximal independent sets in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing the Voronoi diagram of a set of line segments in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: An addendum to parallel methods for visibility and shortest-path problems in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a polygon in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal shortest path queries in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a simple polygon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel convex hull algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new linear convex hull algorithm for simple polygons (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01293668 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006059657 / rank
 
Normal rank

Latest revision as of 09:52, 30 July 2024

scientific article
Language Label Description Also known as
English
Finding a closet visible vertex pair between two polygons
scientific article

    Statements

    Finding a closet visible vertex pair between two polygons (English)
    0 references
    0 references
    9 October 1995
    0 references
    visible vertex distance
    0 references
    CREW PRAM
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers