Computing a single cell in the overlay of two simple polygons (Q287185): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of random sampling to on-line algorithms in computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: ERRATUM: "RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS" / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of random sampling in computational geometry. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lazy randomized incremental construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: RANDOMIZATION YIELDS SIMPLE O(n <font>log</font><sup>⋆</sup> n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized incremental construction of Delaunay and Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the general motion-planning problem with two degrees of freedom / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00125-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2138405350 / rank
 
Normal rank

Latest revision as of 10:50, 30 July 2024

scientific article
Language Label Description Also known as
English
Computing a single cell in the overlay of two simple polygons
scientific article

    Statements

    Identifiers