Work

Finding Largest Rectangles in Convex Polygons

Year: 2014

Type: preprint

Abstract: We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with $n$ vertices. We give exact algorithms that solve these problems in time $O(n^3)$. We also give $(1-\varepsilon)$-approximation algorithms that take time $O(\varepsilon^{-3/2}+ \varepsilon^{-1/2} \log n)$.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1405.1223

Authors: Cabello, Sergio, Cheong, Otfried, Knauer, Christian, Schlipf, Lena

Institutions: University of Ljubljana, Institute of Mathematics, Physics, and Mechanics, Korea Advanced Institute of Science and Technology, University of Bayreuth, Freie Universität Berlin

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: European Science Foundation, Javna Agencija za Raziskovalno Dejavnost RS, Korea Advanced Institute of Science and Technology, European Social Fund

Awards: Izredno veliki grafi in omrežja (Slovene), Graph theory, Grafovski modeli in algoritmi pri parametriziranju baznih postaj mobilne telefonije četrte generacije (Slovene)

OpenAlex ID: W2949956439

Cites: 10

Cited by: 1

Related to: 20