Computing the triangle maximizing the length of its smallest side inside a convex polygon

Document Type

Conference Article

Publication Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract

Given a convex polygon with n vertices, we study the problem of identifying a triangle with its smallest side as large as possible among all the triangles that can be drawn inside the polygon. We show that at least one of the vertices of such a triangle must be common with a vertex of the polygon. Next we propose an O(n2 log n) time algorithm to compute such a triangle inside the given convex polygon.

First Page

509

Last Page

524

DOI

10.1007/978-3-319-62395-5_35

Publication Date

1-1-2017

This document is currently not available here.

Share

COinS