A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
type: Item
instance of: scholarly article
title: A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
zbMATH Open document ID: 0939.68504
DOI: 10.1016/0898-1221(95)00029-X
author: Yanyan Li
publication date: 2000-07-06T00:00:00Z
Mathematics Subject Classification ID: 68M01
zbMATH DE Number: 779213
MaRDI profile type: Publication
cites work: Efficient worst-case data structures for range searching
cites work: New upper bounds for neighbor searching
cites work: Optimal solutions for a class of point retrieval problems
cites work: On k-Nearest Neighbor Voronoi Diagrams in the Plane
cites work: Filtering Search: A New Approach to Query-Answering
cites work: On a circle placement problem
cites work: An improved algorithm for the rectangle enclosure problem
cites work: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
cites work: On the maximum empty rectangle problem
cites work: Computing the Largest Empty Rectangle
cites work: A new algorithm for the largest empty rectangle problem
cites work: Q3359799
cites work: Q3694703
cites work: Q3328583
cites work: Multidimensional binary search trees used for associative searching
cites work: Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
full work available at URL: 0898-1221(95)00029-x
OpenAlex ID: W2043832401
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 779213