The complexity of manipulating hierarchically defined sets of rectangles-Reference-Cited by-同舟云学术

The complexity of manipulating hierarchically defined sets of rectangles

Published:1981 Issue: Volume: Page:1-15
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bentley Jon Louis,Ottmann Thomas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-10856-4_70.pdf

Reference17 articles.

1. Bentley, J.L. [1977]: Solution to Klee's rectangle problems, unpublished manuscript, Dept. of Computer Science, Carnegie-Mellon University, 1977.

2. Bentley, J.L. and Wood, D. [1980]: An optimal worst-case algorithm for reporting intersections of rectangles, IEEE Transactions on Computers, Vol. C-29, 1980, 572–577.

3. Bentley, J.L., Haken, D., and Hon, R. [1980]: Statistics on VLSI Designs, Dept. of Computer Science, Carnegie-Mellon University, Technical Report CMU-CS-80.

4. Computer Science Technical Report;H. Edelsbrunner,1980

5. Garey, M.R. and Johnson, D.S. [1979]: Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.

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

1. HIPARE: Hierarchical Circuit and Parameter Extraction from Mask Layout Data;Rechnergestützter Entwurf und Architektur mikroelektronischer Systeme;1990

2. Analysis and evaluation of parallel rectangle intersection for VLSI Design Rule Checking;Microprocessing and Microprogramming;1987-02

3. An Isothetic View of Computational Geometry† †Work carried out under a Natural Sciences and Engineering Research Council of Canada Grant No. A-5692.;Computational Geometry;1985

4. The complexity of problems concerning graphs with regularities;Mathematical Foundations of Computer Science 1984;1984