Connected component and simple polygon intersection searching (Q1918994): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Pankaj K. Agarwal / rank
Normal rank
 
Property / author
 
Property / author: Marc J. van Kreveld / rank
Normal rank
 
Property / author
 
Property / author: Pankaj K. Agarwal / rank
 
Normal rank
Property / author
 
Property / author: Marc J. van Kreveld / 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. II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Queries in Curved Objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a new space-partitioning technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of edges of many faces in a line segment arrangement / 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: Algorithms for ray-shooting and intersection searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general approach to connected-component labeling for arbitrary image representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space searching for intersecting objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: GENERALIZED INTERSECTION SEARCHING PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range searching with efficient hierarchical cuttings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: The design of dynamic data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing line segments in partition trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal real-time algorithm for planar convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3358267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General methods for adding range restrictions to decomposable searching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding range restriction capability to dynamic data structures / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:35, 24 May 2024

scientific article
Language Label Description Also known as
English
Connected component and simple polygon intersection searching
scientific article

    Statements

    Connected component and simple polygon intersection searching (English)
    0 references
    0 references
    0 references
    23 July 1996
    0 references
    0 references
    intersection searching
    0 references
    efficient data structures
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references