Processing an offline insertion-query sequence with applications

DOI10.1142/S0129054111008805zbMATH Open1222.68396OpenAlexW2050208876MaRDI QIDQ3173480FDOQ3173480

Danny Z. Chen, Haitao Wang

Publication date: 10 October 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111008805

Recommendations

• Processing an Offline Insertion-Query Sequence with Applications
• Off-Line Maintenance of Planar Configurations
• Dynamic orthogonal segment intersection search
• Efficient dynamic range minimum query
• Deferred Data Structuring

zbMATH Keywords

computational geometryray shootingmax-gapmin-gapupdate-query sequence

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• Introduction to algorithms
• Title not available (Why is that?)
• Preserving order in a forest in less than logarithmic time and linear space
• Title not available (Why is that?)
• A linear-time algorithm for a special case of disjoint set union
• Log-logarithmic worst-case range queries are possible in space theta(N)
• Design and implementation of an efficient priority queue
• Visibility and intersection problems in plane geometry
• Geometric complexity of some location problems
• SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
• Ray Shooting and Parametric Search
• Some approximation algorithms for the clique partition problem in weighted interval graphs
• Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions
• Obtaining lower bounds using artificial components

This page was built for publication: Processing an offline insertion-query sequence with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173480)