Planar maximum-box problem revisited (Q1749536)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Planar maximum-box problem revisited	scientific article

Statements

scholarly article

0 references

Planar maximum-box problem revisited (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.tcs.2017.12.038

0 references

0 references

0 references

Theoretical Computer Science

0 references

publication date

17 May 2018

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

discrete optimization

0 references

computational geometry

0 references

plane sweep algorithms

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2017.12.038

0 references

0 references

The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions

0 references

Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations

0 references

Maximum-weight planar boxes in \(O(n^2)\) time (and better)

0 references

The maximum box problem for moving points in the plane

0 references

0 references

Largest empty rectangle among a point set

0 references

Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning

0 references

The maximum box problem and its application to data analysis

0 references

Pareto-optimal patterns in logical analysis of data

0 references

Planar maximum box problem

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1749536

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1749536&oldid=36390669"