Queries about the largest empty rectangle in large 2-dimensional datasets stored in secondary memory

Let  be a set of points located in a rectangle  and  is a point that is not in . This article describes the design, implementation, and experimentation of different algorithms to solve the following two problems: (i) Maximum Empty Rectangle (MER), which consists in finding an empty rectangle with a...

Full description

Autores:
Lara, Felipe
Gutiérrez, Gilberto
Soto, Maria Antonieta
Corral, Antonio
Tipo de recurso:
Article of journal
Fecha de publicación:
2017
Institución:
Universidad Nacional de Colombia
Repositorio:
Universidad Nacional de Colombia
Idioma:
spa
OAI Identifier:
oai:repositorio.unal.edu.co:unal/67560
Acceso en línea:
https://repositorio.unal.edu.co/handle/unal/67560
http://bdigital.unal.edu.co/68589/
Palabra clave:
62 Ingeniería y operaciones afines / Engineering
geometric algorithms
spatial databases
geometric problems
Algoritmos geométricos
bases de datos espaciales
problemas geométricos.
Rights
openAccess
License
Atribución-NoComercial 4.0 Internacional