Processing an Offline Insertion-Query Sequence with Applications

Authors:
Danny Z. Chen;Haitao Wang
Affiliations:
Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA IN 46556;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA IN 46556
Venue:
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Year:
2009

Citing 11
Cited 0

Linear time algorithms for visibility and shortest path problems inside simple polygons

SCG '86 Proceedings of the second annual symposium on Computational geometry
Obtaining lower bounds using artificial components

Information Processing Letters
Visibility and intersection problems in plane geometry

Discrete & Computational Geometry
Ray shooting and other applications of spanning trees with low stabbing number

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Efficient ray shooting and hidden surface removal

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Ray shooting and parametric search

SIAM Journal on Computing
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Introduction to Algorithms

Introduction to Algorithms
Some approximation algorithms for the clique partition problem in weighted interval graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present techniques and algorithms for processing an offline sequence of insertion and query operations and for related problems. Most problems we consider are solved optimally in linear time by our algorithms, which are based on a new geometric modeling and interesting techniques. We also discuss some applications to which our algorithms and techniques can be applied to yield efficient solutions.