PARTIAL MATCH QUERIES IN TWO-DIMENSIONAL QUADTREES: A PROBABILISTIC APPROACH

@inproceedings{Curien2011PARTIALMQ,
  title={PARTIAL MATCH QUERIES IN TWO-DIMENSIONAL QUADTREES: A PROBABILISTIC APPROACH},
  author={Nicolas Curien and Adrien Joseph},
  year={2011}
}
We analyze the mean cost of the partial match queries in random two-dimensional quadtrees. The method is based on fragmentation theory. The convergence is guaranteed by a coupling argument of Markov chains, whereas the value of the limit is computed as the fixed point of an integral equation. 

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

Hypergeometrics and the cost structure of quadtrees

  • R. Sedgewick
  • Random Structures Algorithms
  • 1995

Analytic variations on quadtrees

  • G. Labelle, L. Laforest, B. Salvy
  • Algorithmica
  • 1993

Similar Papers

Loading similar papers…