Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Partitioning arrangements of lines. II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: New applications of random sampling in computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast Las Vegas algorithm for triangulating a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal-Time Algorithm for Slope Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On <i>k</i>-Hulls and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicitly representing arrangements of lines or segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity and construction of many faces in arrangements of lines and of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Belts in Two-Dimensional Arrangements with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of \(\epsilon\)-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for minimum link paths inside a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on k-sets of finite sets in the plane / rank
 
Normal rank

Revision as of 15:45, 20 June 2024

scientific article
Language Label Description Also known as
English
Partitioning arrangements of lines. I: An efficient deterministic algorithm
scientific article

    Statements

    Partitioning arrangements of lines. I: An efficient deterministic algorithm (English)
    0 references
    0 references
    1990
    0 references
    partitioning algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references