Processing an Offline Insertion-Query Sequence with Applications

DOI10.1007/978-3-642-02270-8_16zbMath1248.68542OpenAlexW1529628801MaRDI QIDQ5321704

Danny Z. Chen, Haitao Wang

Publication date: 14 July 2009

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02270-8_16

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• 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
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Obtaining lower bounds using artificial components
• Preserving order in a forest in less than logarithmic time and linear space
• Efficient ray shooting and hidden surface removal
• Ray Shooting and Parametric Search
• Efficiency of a Good But Not Linear Set Union Algorithm
• Design and implementation of an efficient priority queue
• SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS