PROCESSING AN OFFLINE INSERTION-QUERY SEQUENCE WITH APPLICATIONS

DOI10.1142/S0129054111008805zbMath1222.68396OpenAlexW2050208876MaRDI QIDQ3173480

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

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

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

This page was built for publication: PROCESSING AN OFFLINE INSERTION-QUERY SEQUENCE WITH APPLICATIONS