Dynamic Trees and Dynamic Point Location (Q4210167): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a simple polygon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional cascading. I: A data structuring technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional cascading. II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility and intersection problems in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Dynamic Planar Point Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and storing similar lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Point Location in a Monotone Subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintenance of a minimum spanning forest in a dynamic plane graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitives for the manipulation of general subdivisions and the computation of Voronoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Planar Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location of a Point in a Planar Subdivision and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3776623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A balanced search tree O(1) worst-case update time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Planar Point Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Dynamic Point Location in a Monotone Subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic planar point location with optimal query time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Point Location in a Convex Spatial Cell-Complex / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding range restriction capability to dynamic data structures / rank
 
Normal rank

Latest revision as of 15:10, 28 May 2024

scientific article; zbMATH DE number 1200806
Language Label Description Also known as
English
Dynamic Trees and Dynamic Point Location
scientific article; zbMATH DE number 1200806

    Statements

    Dynamic Trees and Dynamic Point Location (English)
    0 references
    0 references
    0 references
    21 September 1998
    0 references
    computational geometry
    0 references
    point location
    0 references
    centroid decomposition
    0 references
    dynamic data structures
    0 references
    on-line algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references