FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS (Q4818559): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q751323
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Xue-Hou Tan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The furthest-site geodesic Voronoi diagram / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations / 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: On optimal bridges between two convex regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons / rank
 
Normal rank

Revision as of 11:56, 7 June 2024

scientific article; zbMATH DE number 2104260
Language Label Description Also known as
English
FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS
scientific article; zbMATH DE number 2104260

    Statements