On counting pairs of intersecting segments and off-line triangle range searching (Q676268): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Marco Pellegrini / rank
Normal rank
 
Property / author
 
Property / author: Marco Pellegrini / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning arrangements of lines. I: An efficient deterministic algorithm / rank
 
Normal rank
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: Algorithms for Reporting and Counting Geometric Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for intersecting line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for bichromatic line-segment problems and polyhedral terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic view of random sampling and its use in geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reporting and counting segment intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Complexity of Polytope Range Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting hyperplanes for divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234124 / 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: Applications of random sampling in computational geometry. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-optimal upper bounds for simplex range searching and new zone theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-optimal range searching in spaces of finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric retrieval problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTTINGS AND APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Arrangements of Lines and Hyperplanes with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Zone Theorem for Hyperplane Arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halfplanar range search in linear space and \(O(n^{0.695})\) query time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generic algorithm for one-dimensional homotopic compaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting hyperplane arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient partition trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane-sweep algorithms for intersecting geometric figures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On point location and motion planning among simplices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygon Retrieval / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02523679 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053735114 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:45, 30 July 2024

scientific article
Language Label Description Also known as
English
On counting pairs of intersecting segments and off-line triangle range searching
scientific article

    Statements

    On counting pairs of intersecting segments and off-line triangle range searching (English)
    0 references
    0 references
    16 March 1997
    0 references
    derandomization
    0 references
    bichromatic intersecting segments
    0 references
    monochromatic intersection points
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers