Scaling and Related Techniques for Geometry Problems

@inproceedings{Gabow1984ScalingAR,
  title={Scaling and Related Techniques for Geometry Problems},
  author={Harold N. Gabow and Jon Louis Bentley and Robert E. Tarjan},
  booktitle={STOC},
  year={1984}
}
Three techniques in computational geometry are explored: <italic>Scaling</italic> solves a problem by viewing it at increasing levels of numerical precision; <italic>activation</italic> is a restricted type of update operation, useful in sweep algorithms; the <italic>Cartesian tree</italic> is a data structure for problems involving maximums and minimums. These techniques solve the minimum spanning tree problem in R<supscrpt>k</supscrpt><subscrpt>1</subscrpt> and R<supscrpt>k</supscrpt… CONTINUE READING
Highly Influential
This paper has highly influenced 51 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 315 extracted citations

Efficient range searching for categorical and plain data

ACM Trans. Database Syst. • 2014
View 10 Excerpts
Highly Influenced

LATIN 2012: Theoretical Informatics

Lecture Notes in Computer Science • 2012
View 16 Excerpts
Highly Influenced

Adaptive and Approximate Orthogonal Range Counting

ACM Trans. Algorithms • 2016
View 4 Excerpts
Highly Influenced

Combinatorial Pattern Matching

Lecture Notes in Computer Science • 2015
View 7 Excerpts
Highly Influenced

Space-efficient range reporting for categorical data

PODS • 2012
View 4 Excerpts
Highly Influenced

On finding skylines in external memory

PODS • 2011
View 4 Excerpts
Highly Influenced

On Cartesian Trees and Range Minimum Queries

View 7 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…