An improved algorithm for the rectangle enclosure problem-Reference-Cited by-同舟云学术

An improved algorithm for the rectangle enclosure problem

Published:1982-09 Issue:3 Volume:3 Page:218-224
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Lee D.T,Preparata F.P

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference7 articles.

1. Fast algorithms for LSI artwork analysis;Baird;J. Design Automation Fault-Tolerant Comput.,1978

2. 4-dimensional binary search trees as a means to speed up associative searches in the design verification of integrated circuits;Lauther;J. Design Automation Fault-Tolerant Comput.,1978

3. Data structures for the rectangle containment and enclosure problems;Vaishnavi;Computer Graphics and Image Processing,1980

4. Algorithms for reporting and counting geometric intersections;Bentley;IEEE Trans. Computers,1979

5. The rectangle intersection problem revisited;Six;BIT,1981

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A simple and space efficient segment tree implementation;MethodsX;2019

2. In-place algorithms for computing a largest clique in geometric intersection graphs;Discrete Applied Mathematics;2014-12

3. Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM;Automata, Languages, and Programming;2014

4. An Improved Algorithm for Static 3D Dominance Reporting in the Pointer Machine;Algorithms and Computation;2012

5. In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs;Frontiers in Algorithmics and Algorithmic Aspects in Information and Management;2012