scientific article
From MaRDI portal
Publication:3750129
zbMATH Open0609.68047MaRDI QIDQ3750129FDOQ3750129
Publication date: 1986
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (8)
- Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length
- Amortized analysis of smooth quadtrees in all dimensions
- Title not available (Why is that?)
- Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors
- Set operations on linear quadtrees
- Study of the universal constants for the multidimensional search quadtrees
- Amortized Analysis of Smooth Quadtrees in All Dimensions
- A generalized solution to the quadtree expected complexity problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750129)
